IDEAS home Printed from https://ideas.repec.org/a/eee/proeco/v123y2010i1p42-51.html
   My bibliography  Save this article

The balanced cargo vehicle routing problem with time windows

Author

Listed:
  • Kritikos, Manolis N.
  • Ioannou, George

Abstract

This paper addresses a variant of the vehicle routing problem with time windows (VRPTW) that targets the balancing of the load carried by each active vehicle (balanced cargo VRPTW or BCVRPTW). A new approach, based on the free disposal hull (FDH) method of data envelopment analysis, is proposed; it consists of an initial, feasible route generation procedure that employs an effective heuristic for the VRPTW, followed by an iterative method for selecting routes on the efficiency frontier, according to the criteria of the BCVRPTW and the notion of non-dominated solutions embedded within FDH. This new approach produces, according to our computational evaluation, very good results for the BCVRPTW, and can serve as the basis for solving real-life vehicle routing problems.

Suggested Citation

  • Kritikos, Manolis N. & Ioannou, George, 2010. "The balanced cargo vehicle routing problem with time windows," International Journal of Production Economics, Elsevier, vol. 123(1), pages 42-51, January.
    • Handle: RePEc:eee:proeco:v:123:y:2010:i:1:p:42-51
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0925-5273(09)00264-3
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. G Ioannou & M Kritikos & G Prastacos, 2001. "A greedy look-ahead heuristic for the vehicle routing problem with time windows," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 52(5), pages 523-537, May.
    2. Henry Tulkens, 2006. "On FDH Efficiency Analysis: Some Methodological Issues and Applications to Retail Banking, Courts and Urban Transit," Springer Books, in: Parkash Chander & Jacques Drèze & C. Knox Lovell & Jack Mintz (ed.), Public goods, environmental externalities and fiscal competition, chapter 0, pages 311-342, Springer.
    3. Olli Bräysy & Michel Gendreau, 2005. "Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms," Transportation Science, INFORMS, vol. 39(1), pages 104-118, February.
    4. D Bouyssou, 1999. "Using DEA as a tool for MCDM: some remarks," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 50(9), pages 974-978, September.
    5. Charnes, A. & Cooper, W. W. & Rhodes, E., 1978. "Measuring the efficiency of decision making units," European Journal of Operational Research, Elsevier, vol. 2(6), pages 429-444, November.
    6. Coslovich, Luca & Pesenti, Raffaele & Ukovich, Walter, 2006. "Minimizing fleet operating costs for a container transportation company," European Journal of Operational Research, Elsevier, vol. 171(3), pages 776-786, June.
    7. Olli Bräysy & Michel Gendreau, 2005. "Vehicle Routing Problem with Time Windows, Part II: Metaheuristics," Transportation Science, INFORMS, vol. 39(1), pages 119-139, February.
    8. Marius M. Solomon, 1987. "Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints," Operations Research, INFORMS, vol. 35(2), pages 254-265, April.
    9. Dominique Deprins & Léopold Simar & Henry Tulkens, 2006. "Measuring Labor-Efficiency in Post Offices," Springer Books, in: Parkash Chander & Jacques Drèze & C. Knox Lovell & Jack Mintz (ed.), Public goods, environmental externalities and fiscal competition, chapter 0, pages 285-309, Springer.
    10. Jin, Mingzhou & Liu, Kai & Bowden, Royce O., 2007. "A two-stage algorithm with valid inequalities for the split delivery vehicle routing problem," International Journal of Production Economics, Elsevier, vol. 105(1), pages 228-242, January.
    11. A. W. J. Kolen & A. H. G. Rinnooy Kan & H. W. J. M. Trienekens, 1987. "Vehicle Routing with Time Windows," Operations Research, INFORMS, vol. 35(2), pages 266-273, April.
    12. Laporte, Gilbert, 1992. "The vehicle routing problem: An overview of exact and approximate algorithms," European Journal of Operational Research, Elsevier, vol. 59(3), pages 345-358, June.
    13. G. B. Dantzig & J. H. Ramser, 1959. "The Truck Dispatching Problem," Management Science, INFORMS, vol. 6(1), pages 80-91, October.
    14. Bruno De Borger & Kristiaan Kerstens & Álvaro Costa, 2002. "Public transit performance: What does one learn from frontier studies?," Transport Reviews, Taylor & Francis Journals, vol. 22(1), pages 1-38, January.
    15. G. Clarke & J. W. Wright, 1964. "Scheduling of Vehicles from a Central Depot to a Number of Delivery Points," Operations Research, INFORMS, vol. 12(4), pages 568-581, August.
    16. Zäpfel, Günther & Bögl, Michael, 2008. "Multi-period vehicle routing and crew scheduling with outsourcing options," International Journal of Production Economics, Elsevier, vol. 113(2), pages 980-996, June.
    17. Chiou, Yu-Chiun & Chen, Yen-Heng, 2006. "Route-based performance evaluation of Taiwanese domestic airlines using data envelopment analysis," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 42(2), pages 116-127, March.
    18. Eliiyi, Deniz Türsel & Ornek, Arslan & Karakütük, SadIk Serhat, 2009. "A vehicle scheduling problem with fixed trips and time limitations," International Journal of Production Economics, Elsevier, vol. 117(1), pages 150-161, January.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Martínez-Salazar, Iris Abril & Molina, Julian & Ángel-Bello, Francisco & Gómez, Trinidad & Caballero, Rafael, 2014. "Solving a bi-objective Transportation Location Routing Problem by metaheuristic algorithms," European Journal of Operational Research, Elsevier, vol. 234(1), pages 25-36.
    2. Antonio Martinez‐Sykora & Tolga Bektaş, 2015. "Transformations of node‐balanced routing problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 62(5), pages 370-387, August.
    3. Mancini, Simona & Gansterer, Margaretha & Hartl, Richard F., 2021. "The collaborative consistent vehicle routing problem with workload balance," European Journal of Operational Research, Elsevier, vol. 293(3), pages 955-965.
    4. Babagolzadeh, Mahla & Zhang, Yahua & Abbasi, Babak & Shrestha, Anup & Zhang, Anming, 2022. "Promoting Australian regional airports with subsidy schemes: Optimised downstream logistics using vehicle routing problem," Transport Policy, Elsevier, vol. 128(C), pages 38-51.
    5. Loske, Dominic & Klumpp, Matthias, 2021. "Human-AI collaboration in route planning: An empirical efficiency-based analysis in retail logistics," International Journal of Production Economics, Elsevier, vol. 241(C).
    6. Rodrigo Linfati & Fernando Yáñez-Concha & John Willmer Escobar, 2022. "Mathematical Models for the Vehicle Routing Problem by Considering Balancing Load and Customer Compactness," Sustainability, MDPI, vol. 14(19), pages 1-20, October.
    7. Said El Noshokaty, 2021. "Shipping optimization systems (SOS) for tramp: stochastic cargo soft time windows," Journal of Shipping and Trade, Springer, vol. 6(1), pages 1-19, December.
    8. Margaretha Gansterer & Richard F. Hartl & Sarah Wieser, 2021. "Assignment constraints in shared transportation services," Annals of Operations Research, Springer, vol. 305(1), pages 513-539, October.
    9. Carlos A. Vega-Mejía & Jairo R. Montoya-Torres & Sardar M. N. Islam, 2019. "Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review," Annals of Operations Research, Springer, vol. 273(1), pages 311-375, February.
    10. Soriano, Adria & Gansterer, Margaretha & Hartl, Richard F., 2023. "The multi-depot vehicle routing problem with profit fairness," International Journal of Production Economics, Elsevier, vol. 255(C).
    11. Soriano, Adria & Gansterer, Margaretha & Hartl, Richard F., 2022. "Reprint of: The multi-depot vehicle routing problem with profit fairness," International Journal of Production Economics, Elsevier, vol. 250(C).
    12. P. Matl & R. F. Hartl & T. Vidal, 2018. "Workload Equity in Vehicle Routing Problems: A Survey and Analysis," Transportation Science, INFORMS, vol. 52(2), pages 239-260, March.
    13. Naji-Azimi, Zahra & Salari, Majid & Renaud, Jacques & Ruiz, Angel, 2016. "A practical vehicle routing problem with desynchronized arrivals to depot," European Journal of Operational Research, Elsevier, vol. 255(1), pages 58-67.
    14. Pang, King-Wah & Xu, Zhou & Li, Chung-Lun, 2011. "Ship routing problem with berthing time clash avoidance constraints," International Journal of Production Economics, Elsevier, vol. 131(2), pages 752-762, June.
    15. Kuo, Tsai Chi & Chen, Gary Yu-Hsin & Wang, Miao Ling & Ho, Ming Way, 2014. "Carbon footprint inventory route planning and selection of hot spot suppliers," International Journal of Production Economics, Elsevier, vol. 150(C), pages 125-139.
    16. Kritikos, Manolis N. & Ioannou, George, 2013. "The heterogeneous fleet vehicle routing problem with overloads and time windows," International Journal of Production Economics, Elsevier, vol. 144(1), pages 68-75.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Xiao, Yiyong & Konak, Abdullah, 2016. "The heterogeneous green vehicle routing and scheduling problem with time-varying traffic congestion," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 88(C), pages 146-166.
    2. Liu, Ran & Jiang, Zhibin, 2012. "The close–open mixed vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 220(2), pages 349-360.
    3. Qi, Mingyao & Lin, Wei-Hua & Li, Nan & Miao, Lixin, 2012. "A spatiotemporal partitioning approach for large-scale vehicle routing problems with time windows," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 48(1), pages 248-257.
    4. Jeffrey W. Ohlmann & Michael J. Fry & Barrett W. Thomas, 2008. "Route Design for Lean Production Systems," Transportation Science, INFORMS, vol. 42(3), pages 352-370, August.
    5. Loske, Dominic & Klumpp, Matthias, 2021. "Human-AI collaboration in route planning: An empirical efficiency-based analysis in retail logistics," International Journal of Production Economics, Elsevier, vol. 241(C).
    6. Mohamed Cissé & Semih Yalçindag & Yannick Kergosien & Evren Sahin & Christophe Lenté & Andrea Matta, 2017. "OR problems related to Home Health Care: A review of relevant routing and scheduling problems," Post-Print hal-01736714, HAL.
    7. Vidal, Thibaut & Crainic, Teodor Gabriel & Gendreau, Michel & Prins, Christian, 2013. "Heuristics for multi-attribute vehicle routing problems: A survey and synthesis," European Journal of Operational Research, Elsevier, vol. 231(1), pages 1-21.
    8. Hideki Hashimoto & Mutsunori Yagiura & Shinji Imahori & Toshihide Ibaraki, 2013. "Recent progress of local search in handling the time window constraints of the vehicle routing problem," Annals of Operations Research, Springer, vol. 204(1), pages 171-187, April.
    9. Li, Xiangyong & Tian, Peng & Leung, Stephen C.H., 2010. "Vehicle routing problems with time windows and stochastic travel and service times: Models and algorithm," International Journal of Production Economics, Elsevier, vol. 125(1), pages 137-145, May.
    10. Brandstätter, Christian & Reimann, Marc, 2018. "The Line-haul Feeder Vehicle Routing Problem: Mathematical model formulation and heuristic approaches," European Journal of Operational Research, Elsevier, vol. 270(1), pages 157-170.
    11. Macedo, Rita & Alves, Cláudio & Valério de Carvalho, J.M. & Clautiaux, François & Hanafi, Saïd, 2011. "Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model," European Journal of Operational Research, Elsevier, vol. 214(3), pages 536-545, November.
    12. Schneider, Kellie & Nurre, Sarah G., 2019. "A multi-criteria vehicle routing approach to improve the compliance audit schedule for food banks," Omega, Elsevier, vol. 84(C), pages 127-140.
    13. Lai, David S.W. & Caliskan Demirag, Ozgun & Leung, Janny M.Y., 2016. "A tabu search heuristic for the heterogeneous vehicle routing problem on a multigraph," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 86(C), pages 32-52.
    14. Francesco P. Deflorio & Jesus Gonzalez-Feliu & Roberto Tadei & Simone Amico, 2009. "Service quality planning for freight distribution with time windows in large networks," Working Papers halshs-01056187, HAL.
    15. Nicolas Rincon-Garcia & Ben J. Waterson & Tom J. Cherrett, 2018. "Requirements from vehicle routing software: perspectives from literature, developers and the freight industry," Transport Reviews, Taylor & Francis Journals, vol. 38(1), pages 117-138, January.
    16. Zäpfel, Günther & Bögl, Michael, 2008. "Multi-period vehicle routing and crew scheduling with outsourcing options," International Journal of Production Economics, Elsevier, vol. 113(2), pages 980-996, June.
    17. Zhiping Zuo & Yanhui Li & Jing Fu & Jianlin Wu, 2019. "Human Resource Scheduling Model and Algorithm with Time Windows and Multi-Skill Constraints," Mathematics, MDPI, vol. 7(7), pages 1-18, July.
    18. Baals, Julian & Emde, Simon & Turkensteen, Marcel, 2023. "Minimizing earliness-tardiness costs in supplier networks—A just-in-time truck routing problem," European Journal of Operational Research, Elsevier, vol. 306(2), pages 707-741.
    19. Müller, Juliane, 2010. "Approximative solutions to the bicriterion Vehicle Routing Problem with Time Windows," European Journal of Operational Research, Elsevier, vol. 202(1), pages 223-231, April.
    20. Taş, D. & Gendreau, M. & Dellaert, N. & van Woensel, T. & de Kok, A.G., 2014. "Vehicle routing with soft time windows and stochastic travel times: A column generation and branch-and-price solution approach," European Journal of Operational Research, Elsevier, vol. 236(3), pages 789-799.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:proeco:v:123:y:2010:i:1:p:42-51. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/ijpe .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.