IDEAS home Printed from https://ideas.repec.org/a/spr/joheur/v22y2016i4d10.1007_s10732-014-9264-z.html
   My bibliography  Save this article

New variable depth local search for multiple depot vehicle scheduling problems

Author

Listed:
  • Tomoshi Otsuki

    (Toshiba Corporation
    The University of Tokyo)

  • Kazuyuki Aihara

    (The University of Tokyo)

Abstract

The multiple depot vehicle scheduling problem (MDVSP) is a well-known and important NP-hard problem in transport scheduling. In this study, we first provide an original interpretation of the search space of the MDVSP. Next, we present a local search algorithm which utilizes pruning and deepening techniques in the variable depth search framework. Computational results using well-known test cases show that our method achieves better results than the second-best local search based method does by 8.6–30.1 %, and exhibits the best short-term performance among the state-of-the-art methods.

Suggested Citation

  • Tomoshi Otsuki & Kazuyuki Aihara, 2016. "New variable depth local search for multiple depot vehicle scheduling problems," Journal of Heuristics, Springer, vol. 22(4), pages 567-585, August.
    • Handle: RePEc:spr:joheur:v:22:y:2016:i:4:d:10.1007_s10732-014-9264-z
    DOI: 10.1007/s10732-014-9264-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10732-014-9264-z
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10732-014-9264-z?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
    ---><---

    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. Forbes, M. A. & Holt, J. N. & Watts, A. M., 1994. "An exact algorithm for multiple depot bus scheduling," European Journal of Operational Research, Elsevier, vol. 72(1), pages 115-124, January.
    2. Richard Freling & Albert P. M. Wagelmans & José M. Pinto Paixão, 2001. "Models and Algorithms for Single-Depot Vehicle Scheduling," Transportation Science, INFORMS, vol. 35(2), pages 165-180, May.
    3. Pepin, A.S. & Desaulniers, G. & Hertz, A. & Huisman, D., 2006. "Comparison of heuristic approaches for the multiple depot vehicle scheduling problem," Econometric Institute Research Papers EI 2006-34, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    4. Ahmed Hadjar & Odile Marcotte & François Soumis, 2006. "A Branch-and-Cut Algorithm for the Multiple Depot Vehicle Scheduling Problem," Operations Research, INFORMS, vol. 54(1), pages 130-149, February.
    5. S. Lin & B. W. Kernighan, 1973. "An Effective Heuristic Algorithm for the Traveling-Salesman Problem," Operations Research, INFORMS, vol. 21(2), pages 498-516, April.
    6. Kliewer, Natalia & Mellouli, Taieb & Suhl, Leena, 2006. "A time-space network based exact optimization model for multi-depot bus scheduling," European Journal of Operational Research, Elsevier, vol. 175(3), pages 1616-1627, December.
    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. Guedes, Pablo C. & Borenstein, Denis, 2018. "Real-time multi-depot vehicle type rescheduling problem," Transportation Research Part B: Methodological, Elsevier, vol. 108(C), pages 217-234.
    2. Kulkarni, Sarang & Krishnamoorthy, Mohan & Ranade, Abhiram & Ernst, Andreas T. & Patil, Rahul, 2018. "A new formulation and a column generation-based heuristic for the multiple depot vehicle scheduling problem," Transportation Research Part B: Methodological, Elsevier, vol. 118(C), pages 457-487.

    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. Perumal, Shyam S.G. & Lusby, Richard M. & Larsen, Jesper, 2022. "Electric bus planning & scheduling: A review of related problems and methodologies," European Journal of Operational Research, Elsevier, vol. 301(2), pages 395-413.
    2. Jing-Quan Li, 2014. "Transit Bus Scheduling with Limited Energy," Transportation Science, INFORMS, vol. 48(4), pages 521-539, November.
    3. Kulkarni, Sarang & Krishnamoorthy, Mohan & Ranade, Abhiram & Ernst, Andreas T. & Patil, Rahul, 2018. "A new formulation and a column generation-based heuristic for the multiple depot vehicle scheduling problem," Transportation Research Part B: Methodological, Elsevier, vol. 118(C), pages 457-487.
    4. Markó Horváth & Tamás Kis, 2019. "Computing strong lower and upper bounds for the integrated multiple-depot vehicle and crew scheduling problem with branch-and-price," 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. 27(1), pages 39-67, March.
    5. Bixuan Sun & Jeffrey Apland, 2019. "Operational planning of public transit with economic and environmental goals: application to the Minneapolis–St. Paul bus system," Public Transport, Springer, vol. 11(2), pages 237-267, August.
    6. Hanne L. Petersen & Allan Larsen & Oli B. G. Madsen & Bjørn Petersen & Stefan Ropke, 2013. "The Simultaneous Vehicle Scheduling and Passenger Service Problem," Transportation Science, INFORMS, vol. 47(4), pages 603-616, November.
    7. Uçar, Ezgi & İlker Birbil, Ş. & Muter, İbrahim, 2017. "Managing disruptions in the multi-depot vehicle scheduling problem," Transportation Research Part B: Methodological, Elsevier, vol. 105(C), pages 249-269.
    8. Benchimol, Pascal & Desaulniers, Guy & Desrosiers, Jacques, 2012. "Stabilized dynamic constraint aggregation for solving set partitioning problems," European Journal of Operational Research, Elsevier, vol. 223(2), pages 360-371.
    9. Ingmar Steinzen & Vitali Gintner & Leena Suhl & Natalia Kliewer, 2010. "A Time-Space Network Approach for the Integrated Vehicle- and Crew-Scheduling Problem with Multiple Depots," Transportation Science, INFORMS, vol. 44(3), pages 367-382, August.
    10. Ibarra-Rojas, O.J. & Delgado, F. & Giesen, R. & Muñoz, J.C., 2015. "Planning, operation, and control of bus transport systems: A literature review," Transportation Research Part B: Methodological, Elsevier, vol. 77(C), pages 38-75.
    11. Shen, Yindong & Xu, Jia & Li, Jingpeng, 2016. "A probabilistic model for vehicle scheduling based on stochastic trip times," Transportation Research Part B: Methodological, Elsevier, vol. 85(C), pages 19-31.
    12. Ciancio, Claudio & Laganà, Demetrio & Musmanno, Roberto & Santoro, Francesco, 2018. "An integrated algorithm for shift scheduling problems for local public transport companies," Omega, Elsevier, vol. 75(C), pages 139-153.
    13. J Faulin & A García del Valle, 2008. "Solving the capacitated vehicle routing problem using the ALGELECT electrostatic algorithm," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(12), pages 1685-1695, December.
    14. Hassold, Stephan & Ceder, Avishai (Avi), 2014. "Public transport vehicle scheduling featuring multiple vehicle types," Transportation Research Part B: Methodological, Elsevier, vol. 67(C), pages 129-143.
    15. Gkiotsalitis, K. & Iliopoulou, C. & Kepaptsoglou, K., 2023. "An exact approach for the multi-depot electric bus scheduling problem with time windows," European Journal of Operational Research, Elsevier, vol. 306(1), pages 189-206.
    16. Niu, Huimin & Zhou, Xuesong & Tian, Xiaopeng, 2018. "Coordinating assignment and routing decisions in transit vehicle schedules: A variable-splitting Lagrangian decomposition approach for solution symmetry breaking," Transportation Research Part B: Methodological, Elsevier, vol. 107(C), pages 70-101.
    17. Fonseca, João Paiva & van der Hurk, Evelien & Roberti, Roberto & Larsen, Allan, 2018. "A matheuristic for transfer synchronization through integrated timetabling and vehicle scheduling," Transportation Research Part B: Methodological, Elsevier, vol. 109(C), pages 128-149.
    18. Ahmed Kheiri & Alina G. Dragomir & David Mueller & Joaquim Gromicho & Caroline Jagtenberg & Jelke J. Hoorn, 2019. "Tackling a VRP challenge to redistribute scarce equipment within time windows using metaheuristic algorithms," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 8(5), pages 561-595, December.
    19. Anurag Agarwal, 2009. "Theoretical insights into the augmented-neural-network approach for combinatorial optimization," Annals of Operations Research, Springer, vol. 168(1), pages 101-117, April.
    20. Wu, Weitiao & Lin, Yue & Liu, Ronghui & Jin, Wenzhou, 2022. "The multi-depot electric vehicle scheduling problem with power grid characteristics," Transportation Research Part B: Methodological, Elsevier, vol. 155(C), pages 322-347.

    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:spr:joheur:v:22:y:2016:i:4:d:10.1007_s10732-014-9264-z. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.