IDEAS home Printed from https://ideas.repec.org/p/hal/wpaper/hal-00644133.html
   My bibliography  Save this paper

The Relationship between Vehicle Routing & Scheduling and Green Logistics - A Literature Survey

Author

Listed:
  • Abdelkader Sbihi

    (LUMS - Department of Management Science [Lancaster] - LUMS - Lancaster University Management School - Lancaster University)

  • Richard W. Eglese

    (LUMS - Department of Management Science [Lancaster] - LUMS - Lancaster University Management School - Lancaster University)

Abstract

The basic Vehicle Routing and Scheduling Problem (VRSP) is described followed by an outline of solution approaches. Different variations of the basic VRSP are examined that involve the consideration of additional constraints or other changes in the structure of the appropriate model. An introduction is provided to Green Logistics issues that are relevant to vehicle routing and scheduling including discussion of the environmental objectives that should be considered. Particular consideration is given to VRSP models that relate to environmental issues including the timedependent VRSP, the transportation of hazardous materials and dynamic VRSP models. Finally some conclusions are drawn about further research needs in this area and the relation to road pricing.

Suggested Citation

  • Abdelkader Sbihi & Richard W. Eglese, 2007. "The Relationship between Vehicle Routing & Scheduling and Green Logistics - A Literature Survey," Working Papers hal-00644133, HAL.
    • Handle: RePEc:hal:wpaper:hal-00644133
    Note: View the original document on HAL open archive server: https://hal.science/hal-00644133
    as

    Download full text from publisher

    File URL: https://hal.science/hal-00644133/document
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Harilaos N. Psaraftis, 1980. "A Dynamic Programming Solution to the Single Vehicle Many-to-Many Immediate Request Dial-a-Ride Problem," Transportation Science, INFORMS, vol. 14(2), pages 130-154, May.
    2. Gilbert Laporte & François Louveaux & Hélène Mercure, 1992. "The Vehicle Routing Problem with Stochastic Travel Times," Transportation Science, INFORMS, vol. 26(3), pages 161-170, August.
    3. G. B. Dantzig & J. H. Ramser, 1959. "The Truck Dispatching Problem," Management Science, INFORMS, vol. 6(1), pages 80-91, October.
    4. Liping Fu & L. R. Rilett, 2000. "Estimation of time-dependent, stochastic route travel times using artificial neural networks," Transportation Planning and Technology, Taylor & Francis Journals, vol. 24(1), pages 25-48, May.
    5. Letchford, Adam N. & Lysgaard, Jens & Eglese, Richard W., 2006. "A Branch-and-Cut Algorithm for the Capacitated Open Vehicle Routing Problem," CORAL Working Papers L-2006-06, University of Aarhus, Aarhus School of Business, Department of Business Studies.
    6. Brandao, Jose, 2004. "A tabu search algorithm for the open vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 157(3), pages 552-564, September.
    7. Potvin, Jean-Yves & Rousseau, Jean-Marc, 1993. "A parallel route building algorithm for the vehicle routing and scheduling problem with time windows," European Journal of Operational Research, Elsevier, vol. 66(3), pages 331-340, May.
    8. 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.
    9. Z Fu & R Eglese & L Y O Li, 2005. "A new tabu search heuristic for the open vehicle routing problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(3), pages 267-274, March.
    10. Erhan Erkut & Vedat Verter, 1998. "Modeling of Transport Risk for Hazardous Materials," Operations Research, INFORMS, vol. 46(5), pages 625-642, October.
    11. Papastavrou, Jason D., 1996. "A stochastic and dynamic routing policy using branching processes with state dependent immigration," European Journal of Operational Research, Elsevier, vol. 95(1), pages 167-177, November.
    12. George F. List & Pitu B. Mirchandani & Mark A. Turnquist & Konstantinos G. Zografos, 1991. "Modeling and Analysis for Hazardous Materials Transportation: Risk Analysis, Routing/Scheduling and Facility Location," Transportation Science, INFORMS, vol. 25(2), pages 100-114, May.
    13. Stewart, William R. & Golden, Bruce L., 1983. "Stochastic vehicle routing: A comprehensive approach," European Journal of Operational Research, Elsevier, vol. 14(4), pages 371-385, December.
    14. Nicola Secomandi, 2001. "A Rollout Policy for the Vehicle Routing Problem with Stochastic Demands," Operations Research, INFORMS, vol. 49(5), pages 796-802, October.
    15. 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.
    16. Karkazis, J. & Boffey, T. B., 1995. "Optimal location of routes for vehicles transporting hazardous materials," European Journal of Operational Research, Elsevier, vol. 86(2), pages 201-215, October.
    17. R. Montemanni & L. M. Gambardella & A. E. Rizzoli & A. V. Donati, 2005. "Ant Colony System for a Dynamic Vehicle Routing Problem," Journal of Combinatorial Optimization, Springer, vol. 10(4), pages 327-343, December.
    18. Lau, Hoong Chuin & Sim, Melvyn & Teo, Kwong Meng, 2003. "Vehicle routing problem with time windows and a limited number of vehicles," European Journal of Operational Research, Elsevier, vol. 148(3), pages 559-569, August.
    19. S. Anily & A. Federgruen, 1990. "One Warehouse Multiple Retailer Systems with Vehicle Routing Costs," Management Science, INFORMS, vol. 36(1), pages 92-114, January.
    20. José Magalhães & Jorge Sousa, 2006. "Dynamic VRP in pharmaceutical distribution—a case study," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 14(2), pages 177-192, June.
    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. Lahyani, Rahma & Khemakhem, Mahdi & Semet, Frédéric, 2015. "Rich vehicle routing problems: From a taxonomy to a definition," European Journal of Operational Research, Elsevier, vol. 241(1), pages 1-14.
    2. Demir, Emrah & Bektaş, Tolga & Laporte, Gilbert, 2014. "A review of recent research on green road freight transportation," European Journal of Operational Research, Elsevier, vol. 237(3), pages 775-793.
    3. Nasreddine Ouertani & Hajer Ben-Romdhane & Saoussen Krichen & Issam Nouaouri, 2022. "A vector evaluated evolutionary algorithm with exploitation reinforcement for the dynamic pollution routing problem," Journal of Combinatorial Optimization, Springer, vol. 44(2), pages 1011-1038, September.
    4. Emna Marrekchi & Walid Besbes & Diala Dhouib & Emrah Demir, 2021. "A review of recent advances in the operations research literature on the green routing problem and its variants," Annals of Operations Research, Springer, vol. 304(1), pages 529-574, September.
    5. Zhou, Yizi & Mandania, Rupal & Liu, Jiyin, 2022. "Green vehicle routing and dynamic pricing for scheduling on-site services," International Journal of Production Economics, Elsevier, vol. 254(C).
    6. Anuj Mittal & Caroline C. Krejci & Teri J. Craven, 2018. "Logistics Best Practices for Regional Food Systems: A Review," Sustainability, MDPI, vol. 10(1), pages 1-44, January.

    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. Pillac, Victor & Gendreau, Michel & Guéret, Christelle & Medaglia, Andrés L., 2013. "A review of dynamic vehicle routing problems," European Journal of Operational Research, Elsevier, vol. 225(1), pages 1-11.
    2. Guodong Yu & Yu Yang, 2019. "Dynamic routing with real-time traffic information," Operational Research, Springer, vol. 19(4), pages 1033-1058, December.
    3. 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.
    4. Chiang, Wen-Chyuan & Russell, Robert & Xu, Xiaojing & Zepeda, David, 2009. "A simulation/metaheuristic approach to newspaper production and distribution supply chain problems," International Journal of Production Economics, Elsevier, vol. 121(2), pages 752-767, October.
    5. Jinil Han & Chungmok Lee & Sungsoo Park, 2014. "A Robust Scenario Approach for the Vehicle Routing Problem with Uncertain Travel Times," Transportation Science, INFORMS, vol. 48(3), pages 373-390, August.
    6. Ji, Chenlu & Mandania, Rupal & Liu, Jiyin & Liret, Anne, 2022. "Scheduling on-site service deliveries to minimise the risk of missing appointment times," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 158(C).
    7. Hernan Caceres & Rajan Batta & Qing He, 2017. "School Bus Routing with Stochastic Demand and Duration Constraints," Transportation Science, INFORMS, vol. 51(4), pages 1349-1364, November.
    8. Diana, Marco & Dessouky, Maged M., 2004. "A new regret insertion heuristic for solving large-scale dial-a-ride problems with time windows," Transportation Research Part B: Methodological, Elsevier, vol. 38(6), pages 539-557, July.
    9. Cristián E. Cortés & Doris Sáez & Alfredo Núñez & Diego Muñoz-Carpintero, 2009. "Hybrid Adaptive Predictive Control for a Dynamic Pickup and Delivery Problem," Transportation Science, INFORMS, vol. 43(1), pages 27-42, February.
    10. Amirsaman Kheirkhah & HamidReza Navidi & Masume Messi Bidgoli, 2016. "A bi-level network interdiction model for solving the hazmat routing problem," International Journal of Production Research, Taylor & Francis Journals, vol. 54(2), pages 459-471, January.
    11. Abdelkader Sbihi & Richard Eglese, 2010. "Combinatorial optimization and Green Logistics," Annals of Operations Research, Springer, vol. 175(1), pages 159-175, March.
    12. Shubhechyya Ghosal & Wolfram Wiesemann, 2020. "The Distributionally Robust Chance-Constrained Vehicle Routing Problem," Operations Research, INFORMS, vol. 68(3), pages 716-732, May.
    13. Prasanna Balaprakash & Mauro Birattari & Thomas Stützle & Marco Dorigo, 2015. "Estimation-based metaheuristics for the single vehicle routing problem with stochastic demands and customers," Computational Optimization and Applications, Springer, vol. 61(2), pages 463-487, June.
    14. Chen, Lijian & Chiang, Wen-Chyuan & Russell, Robert & Chen, Jun & Sun, Dengfeng, 2018. "The probabilistic vehicle routing problem with service guarantees," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 111(C), pages 149-164.
    15. Fu, Liping, 2002. "Scheduling dial-a-ride paratransit under time-varying, stochastic congestion," Transportation Research Part B: Methodological, Elsevier, vol. 36(6), pages 485-506, July.
    16. Miguel Andres Figliozzi & Hani S. Mahmassani & Patrick Jaillet, 2007. "Pricing in Dynamic Vehicle Routing Problems," Transportation Science, INFORMS, vol. 41(3), pages 302-318, August.
    17. Krishna Chepuri & Tito Homem-de-Mello, 2005. "Solving the Vehicle Routing Problem with Stochastic Demands using the Cross-Entropy Method," Annals of Operations Research, Springer, vol. 134(1), pages 153-181, February.
    18. Briseida Sarasola & Karl Doerner & Verena Schmid & Enrique Alba, 2016. "Variable neighborhood search for the stochastic and dynamic vehicle routing problem," Annals of Operations Research, Springer, vol. 236(2), pages 425-461, January.
    19. 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.
    20. 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.

    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:hal:wpaper:hal-00644133. 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: CCSD (email available below). General contact details of provider: https://hal.archives-ouvertes.fr/ .

    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.