IDEAS home Printed from https://ideas.repec.org/a/bla/popmgt/v29y2020i8p1937-1955.html
   My bibliography  Save this article

Consistent Routing and Scheduling with Simultaneous Pickups and Deliveries

Author

Listed:
  • Mohsen Emadikhiav
  • David Bergman
  • Robert Day

Abstract

We study the planning and scheduling of order shipments among laboratories of an instrument‐calibration company. To address a generic version of the company’s combined routing and scheduling problem, we introduce a model variant with simultaneous pickups and deliveries in which consistency of site visits is also desired. We provide alternative formulations of the problem and propose branch‐and‐check and branch‐and‐price implementations, with an analysis of the instance characteristics for which each of these algorithms outperforms the other. Using the data collected from the company, our results indicate that the proposed framework can help the company to significantly reduce transportation costs and shipment times. We also investigate the influence of consistency and tardiness bounds on transportation costs, showing that while tardiness bounds significantly increase transportation costs, the enforcement of consistency requirements results in more consistent solutions at only slightly higher cost. The impact of enforcing consistency requirements increases when tighter tardiness bounds are imposed.

Suggested Citation

  • Mohsen Emadikhiav & David Bergman & Robert Day, 2020. "Consistent Routing and Scheduling with Simultaneous Pickups and Deliveries," Production and Operations Management, Production and Operations Management Society, vol. 29(8), pages 1937-1955, August.
    • Handle: RePEc:bla:popmgt:v:29:y:2020:i:8:p:1937-1955
    DOI: 10.1111/poms.13200
    as

    Download full text from publisher

    File URL: https://doi.org/10.1111/poms.13200
    Download Restriction: no
    File URL: https://libkey.io/10.1111/poms.13200?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Gendreau, Michel & Laporte, Gilbert & Seguin, Rene, 1996. "Stochastic vehicle routing," European Journal of Operational Research, Elsevier, vol. 88(1), pages 3-12, January.
    2. Dumas, Yvan & Desrosiers, Jacques & Soumis, Francois, 1991. "The pickup and delivery problem with time windows," European Journal of Operational Research, Elsevier, vol. 54(1), pages 7-22, September.
    3. Michael Drexl, 2012. "Synchronization in Vehicle Routing---A Survey of VRPs with Multiple Synchronization Constraints," Transportation Science, INFORMS, vol. 46(3), pages 297-316, August.
    4. Karen Smilowitz & Maciek Nowak & Tingting Jiang, 2013. "Workforce Management in Periodic Delivery Operations," Transportation Science, INFORMS, vol. 47(2), pages 214-230, May.
    5. G. B. Dantzig & J. H. Ramser, 1959. "The Truck Dispatching Problem," Management Science, INFORMS, vol. 6(1), pages 80-91, October.
    6. Goetschalckx, Marc & Jacobs-Blecha, Charlotte, 1989. "The vehicle routing problem with backhauls," European Journal of Operational Research, Elsevier, vol. 42(1), pages 39-51, September.
    7. Dominik Goeke & Roberto Roberti & Michael Schneider, 2019. "Exact and Heuristic Solution of the Consistent Vehicle-Routing Problem," Transportation Science, INFORMS, vol. 53(4), pages 1023-1042, July.
    8. Campelo, Pedro & Neves-Moreira, Fábio & Amorim, Pedro & Almada-Lobo, Bernardo, 2019. "Consistent vehicle routing problem with service level agreements: A case study in the pharmaceutical distribution sector," European Journal of Operational Research, Elsevier, vol. 273(1), pages 131-145.
    9. 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.
    10. E. L. Lawler & D. E. Wood, 1966. "Branch-and-Bound Methods: A Survey," Operations Research, INFORMS, vol. 14(4), pages 699-719, August.
    11. P. C. Gilmore & R. E. Gomory, 1961. "A Linear Programming Approach to the Cutting-Stock Problem," Operations Research, INFORMS, vol. 9(6), pages 849-859, December.
    12. Spliet, Remy & Desaulniers, Guy, 2015. "The discrete time window assignment vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 244(2), pages 379-391.
    13. Kunlei Lian & Ashlea Bennett Milburn & Ronald L. Rardin, 2016. "An improved multi-directional local search algorithm for the multi-objective consistent vehicle routing problem," IISE Transactions, Taylor & Francis Journals, vol. 48(10), pages 975-992, October.
    14. Chryssi Malandraki & Mark S. Daskin, 1992. "Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms," Transportation Science, INFORMS, vol. 26(3), pages 185-200, August.
    15. Stavropoulou, F. & Repoussis, P.P. & Tarantilis, C.D., 2019. "The Vehicle Routing Problem with Profits and consistency constraints," European Journal of Operational Research, Elsevier, vol. 274(1), pages 340-356.
    16. Liu, Ran & Xie, Xiaolan & Augusto, Vincent & Rodriguez, Carlos, 2013. "Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care," European Journal of Operational Research, Elsevier, vol. 230(3), pages 475-486.
    17. Attila A. Kovacs & Bruce L. Golden & Richard F. Hartl & Sophie N. Parragh, 2015. "The Generalized Consistent Vehicle Routing Problem," Transportation Science, INFORMS, vol. 49(4), pages 796-816, November.
    18. Delorme, Maxence & Iori, Manuel & Martello, Silvano, 2016. "Bin packing and cutting stock problems: Mathematical models and exact algorithms," European Journal of Operational Research, Elsevier, vol. 255(1), pages 1-20.
    19. The Jin Ai & Voratas Kachitvichyanukul, 2009. "A Particle Swarm Optimisation for Vehicle Routing Problem with Time Windows," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 6(4), pages 519-537.
    20. Chris Groër & Bruce Golden & Edward Wasil, 2009. "The Consistent Vehicle Routing Problem," Manufacturing & Service Operations Management, INFORMS, vol. 11(4), pages 630-643, February.
    21. Nagy, Gabor & Salhi, Said, 2005. "Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries," European Journal of Operational Research, Elsevier, vol. 162(1), pages 126-141, April.
    22. Mauro Dell’Amico & Giovanni Righini & Matteo Salani, 2006. "A Branch-and-Price Approach to the Vehicle Routing Problem with Simultaneous Distribution and Collection," Transportation Science, INFORMS, vol. 40(2), pages 235-247, May.
    23. J-F Chen & T-H Wu, 2006. "Vehicle routing problem with simultaneous deliveries and pickups," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(5), pages 579-587, May.
    24. M. W. P. Savelsbergh & M. Sol, 1995. "The General Pickup and Delivery Problem," Transportation Science, INFORMS, vol. 29(1), pages 17-29, February.
    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. Niels Agatz & Yingjie Fan & Daan Stam, 2021. "The Impact of Green Labels on Time Slot Choice and Operational Sustainability," Production and Operations Management, Production and Operations Management Society, vol. 30(7), pages 2285-2303, July.
    2. Yang, Meng & Ni, Yaodong & Song, Qinyu, 2022. "Optimizing driver consistency in the vehicle routing problem under uncertain environment," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 164(C).
    3. Agatz, N.A.H. & Fan, Y. & Stam, D.A., 2020. "Going green: the effect of green labels on delivery time slot choices," ERIM Report Series Research in Management ERS-2020-009-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.

    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. Yang, Meng & Ni, Yaodong & Song, Qinyu, 2022. "Optimizing driver consistency in the vehicle routing problem under uncertain environment," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 164(C).
    2. Yao, Yu & Van Woensel, Tom & Veelenturf, Lucas P. & Mo, Pengli, 2021. "The consistent vehicle routing problem considering path consistency in a road network," Transportation Research Part B: Methodological, Elsevier, vol. 153(C), pages 21-44.
    3. Daniel Y. Mo & H. Y. Lam & Weikun Xu & G. T. S. Ho, 2020. "Design of Flexible Vehicle Scheduling Systems for Sustainable Paratransit Services," Sustainability, MDPI, vol. 12(14), pages 1-18, July.
    4. Luciano Costa & Claudio Contardo & Guy Desaulniers, 2019. "Exact Branch-Price-and-Cut Algorithms for Vehicle Routing," Transportation Science, INFORMS, vol. 53(4), pages 946-985, July.
    5. Quirion-Blais, Olivier & Chen, Lu, 2021. "A case-based reasoning approach to solve the vehicle routing problem with time windows and drivers’ experience," Omega, Elsevier, vol. 102(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. Liu, Ran & Xie, Xiaolan & Augusto, Vincent & Rodriguez, Carlos, 2013. "Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care," European Journal of Operational Research, Elsevier, vol. 230(3), pages 475-486.
    8. 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.
    9. Jost, Christian & Jungwirth, Alexander & Kolisch, Rainer & Schiffels, Sebastian, 2022. "Consistent vehicle routing with pickup decisions - Insights from sport academy training transfers," European Journal of Operational Research, Elsevier, vol. 298(1), pages 337-350.
    10. Nolz, Pamela C. & Absi, Nabil & Feillet, Dominique & Seragiotto, Clóvis, 2022. "The consistent electric-Vehicle routing problem with backhauls and charging management," European Journal of Operational Research, Elsevier, vol. 302(2), pages 700-716.
    11. Anirudh Subramanyam & Chrysanthos E. Gounaris, 2018. "A Decomposition Algorithm for the Consistent Traveling Salesman Problem with Vehicle Idling," Transportation Science, INFORMS, vol. 52(2), pages 386-401, March.
    12. Rodríguez-Martín, Inmaculada & Yaman, Hande, 2022. "Periodic Vehicle Routing Problem with Driver Consistency and service time optimization," Transportation Research Part B: Methodological, Elsevier, vol. 166(C), pages 468-484.
    13. Martins, Sara & Ostermeier, Manuel & Amorim, Pedro & Hübner, Alexander & Almada-Lobo, Bernardo, 2019. "Product-oriented time window assignment for a multi-compartment vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 276(3), pages 893-909.
    14. Maria João Santos & Pedro Amorim & Alexandra Marques & Ana Carvalho & Ana Póvoa, 2020. "The vehicle routing problem with backhauls towards a sustainability perspective: a review," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 28(2), pages 358-401, July.
    15. Zhou, Lin & Zhen, Lu & Baldacci, Roberto & Boschetti, Marco & Dai, Ying & Lim, Andrew, 2021. "A Heuristic Algorithm for solving a large-scale real-world territory design problem," Omega, Elsevier, vol. 103(C).
    16. 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.
    17. Phuong Khanh Nguyen & Teodor Gabriel Crainic & Michel Toulouse, 2017. "Multi-trip pickup and delivery problem with time windows and synchronization," Annals of Operations Research, Springer, vol. 253(2), pages 899-934, June.
    18. Braekers, Kris & Kovacs, Attila A., 2016. "A multi-period dial-a-ride problem with driver consistency," Transportation Research Part B: Methodological, Elsevier, vol. 94(C), pages 355-377.
    19. M. Alinaghian & M. Ghazanfari & N. Norouzi & H. Nouralizadeh, 2017. "A Novel Model for the Time Dependent Competitive Vehicle Routing Problem: Modified Random Topology Particle Swarm Optimization," Networks and Spatial Economics, Springer, vol. 17(4), pages 1185-1211, December.
    20. Ulmer, Marlin & Nowak, Maciek & Mattfeld, Dirk & Kaminski, Bogumił, 2020. "Binary driver-customer familiarity in service routing," European Journal of Operational Research, Elsevier, vol. 286(2), pages 477-493.

    More about this item

    Statistics

    Access and download statistics

    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:bla:popmgt:v:29:y:2020:i:8:p:1937-1955. 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: Wiley Content Delivery (email available below). General contact details of provider: http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1937-5956 .

    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.