IDEAS home Printed from https://ideas.repec.org/a/ist/ekoist/v0y2024i41p54-81.html
   My bibliography  Save this article

Operational Implications of Time Window Relaxation in Vehicle Routing Problems

Author

Listed:
  • Ahmet ÇaÄŸlar Saygılı

    (İstanbul University, Faculty of Economics, Department of Business Administration, İstanbul, Türkiye)

  • Halim Kazan

    (İstanbul University, Faculty of Economics, Department of Business Administration, İstanbul, Türkiye)

Abstract

The Vehicle Routing Problem with Time Windows (VRPTW) poses a significant challenge in logistics, requiring vehicles to meet the objective of minimising costs—such as distance travelled and total travel time—while adhering to specified delivery time constraints and vehicle capacities. This study investigates the implications of relaxing time window constraints by transitioning from VRPTWinstancestostandard Vehicle Routing Problem (VRP) instances. Our findings highlight notable differences between VRP and VRPTW configurations, particularly in total route length and consistency of route metrics. Removal of time window constraints generally resulted in shorter and more uniform route lengths, indicating operational benefits under certain conditions. However,ourcomparisonsalsorevealedsubstantialvariability inroutestructures across datasets, emphasising the cost implications of adhering to strict time windows. This study underscores the critical balance logistics firms must strike between operational efficiency and customer satisfaction when navigating the complexities of VRPTW. This research provides a foundation for future investigations into optimizing route planning under varying logistical constraints, with potential implications for enhanced f lexibility and reduced operational costs despite dynamic delivery requirements. We used a state-of-the-art heuristic solver to solve instances from standard benchmark datasets heavily used for VRPTW literature.

Suggested Citation

  • Ahmet ÇaÄŸlar Saygılı & Halim Kazan, 2024. "Operational Implications of Time Window Relaxation in Vehicle Routing Problems," EKOIST Journal of Econometrics and Statistics, Istanbul University, Faculty of Economics, vol. 0(41), pages 54-81, December.
  • Handle: RePEc:ist:ekoist:v:0:y:2024:i:41:p:54-81
    DOI: 10.26650/ekoist.2024.41.1490601
    as

    Download full text from publisher

    File URL: https://cdn.istanbul.edu.tr/file/JTA6CLJ8T5/3381A15AD27D4D54841774A0EECD7143
    Download Restriction: no

    File URL: https://iupress.istanbul.edu.tr/tr/journal/ekoist/article/operational-implications-of-time-window-relaxation-in-vehicle-routing-problems
    Download Restriction: no

    File URL: https://libkey.io/10.26650/ekoist.2024.41.1490601?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. Olli Bräysy & Michel Gendreau, 2002. "Tabu Search heuristics for the Vehicle Routing Problem with Time Windows," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 10(2), pages 211-237, December.
    Full references (including those not matched with items on IDEAS)

    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. Sebastian Twaróg & Krzysztof Szwarc & Martyna Wronka-Pośpiech & Małgorzata Dobrowolska & Anna Urbanek, 2021. "Multiple probabilistic traveling salesman problem in the coordination of drug transportation—In the context of sustainability goals and Industry 4.0," PLOS ONE, Public Library of Science, vol. 16(3), pages 1-19, March.
    2. Jeng-Shyang Pan & Qing-yong Yang & Shu-Chuan Chu & Kuo-Chi Chang, 2021. "Compact Sine Cosine Algorithm applied in vehicle routing problem with time window," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 78(4), pages 609-628, December.
    3. Satici, Ozgur & Dayarian, Iman, 2024. "Tactical and operational planning of express intra-city package services," Omega, Elsevier, vol. 122(C).
    4. Wout Dullaert & Olli Bräysy, 2003. "Routing relatively few customers per route," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 11(2), pages 325-336, December.
    5. van Duin, J.H.R. & Tavasszy, L.A. & Taniguchi, E., 2007. "Real time simulation of auctioning and re-scheduling processes in hybrid freight markets," Transportation Research Part B: Methodological, Elsevier, vol. 41(9), pages 1050-1066, November.
    6. Michel Gendreau & Jean-Yves Potvin, 2005. "Metaheuristics in Combinatorial Optimization," Annals of Operations Research, Springer, vol. 140(1), pages 189-213, November.
    7. Nickel, Stefan & Schröder, Michael & Steeg, Jörg, 2012. "Mid-term and short-term planning support for home health care services," European Journal of Operational Research, Elsevier, vol. 219(3), pages 574-587.

    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:ist:ekoist:v:0:y:2024:i:41:p:54-81. 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: Istanbul University Press Operational Team (Ertuğrul YAŞAR) (email available below). General contact details of provider: https://edirc.repec.org/data/ifisttr.html .

    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.