344
Views
16
CrossRef citations to date
0
Altmetric
General Paper

The min-max multi-depot vehicle routing problem: heuristics and computational results

, &
Pages 1430-1441 | Received 21 Jan 2014, Accepted 01 Oct 2014, Published online: 21 Dec 2017

Keep up to date with the latest research on this topic with citation updates for this article.

Read on this site (1)

Moshe Eben Chaime, Boaz Shneider, Dani Gilad & Ilan Halachmi. (2016) Flexible work planning of service agents with load balancing. Production Planning & Control 27:12, pages 1027-1038.
Read now

Articles from other publishers (15)

Deepak Prakash Kumar, Sivakumar Rathinam, Swaroop Darbha & Trevor Bihl. (2024) Heuristic for Min-Max Heterogeneous Multi-Vehicle Multi-Depot Traveling Salesman Problem. Heuristic for Min-Max Heterogeneous Multi-Vehicle Multi-Depot Traveling Salesman Problem.
Abhishek Nayak & Sivakumar Rathinam. (2023) Heuristics and Learning Models for Dubins MinMax Traveling Salesman Problem. Sensors 23:14, pages 6432.
Crossref
Pengfei He & Jin-Kao Hao. (2023) Memetic search for the minmax multiple traveling salesman problem with single and multiple depots. European Journal of Operational Research 307:3, pages 1055-1070.
Crossref
Iurii Bakach, Ann Melissa Campbell, Jan Fabian Ehmke & Timothy L. Urban. (2021) Solving vehicle routing problems with stochastic and correlated travel times and makespan objectives. EURO Journal on Transportation and Logistics 10, pages 100029.
Crossref
Baiming Tong, QingBao Liu & Chaofan Dai. (2020) A Decentralized Hybrid Method for Goal Assignment in Multi-Robot Exploration. A Decentralized Hybrid Method for Goal Assignment in Multi-Robot Exploration.
Hongguang Zhang, Zan Wang, Mengzhen Tang, Xiusha Lv, Han Luo & Yuanan Liu. (2020) Dynamic Memory Memetic Algorithm for VRPPD With Multiple Arrival Time and Traffic Congestion Constraints. IEEE Access 8, pages 167537-167554.
Crossref
Zhaoxia Guo, Stein W. Wallace & Michal Kaut. (2019) Vehicle Routing with Space- and Time-Correlated Stochastic Travel Times: Evaluating the Objective Function. INFORMS Journal on Computing 31:4, pages 654-670.
Crossref
Sarah Barlow, Youngjun Choi, Simon Briceno & Dimitri N. Mavris. (2019) A Multi-UAS Trajectory optimization Methodology for Complex Enclosed Environments. A Multi-UAS Trajectory optimization Methodology for Complex Enclosed Environments.
Jungyun Bae & Woojin Chung. (2019) Heuristics for Two Depot Heterogeneous Unmanned Vehicle Path Planning to Minimize Maximum Travel Cost. Sensors 19:11, pages 2461.
Crossref
Lin Huang, Wenya Lv, Qian Sun & Chengle Ma. (2019) Discrete Optimization Model and Algorithm for Driver Planning in Periodic Driver Routing Problem. Discrete Dynamics in Nature and Society 2019, pages 1-10.
Crossref
John Silberholz, Bruce Golden, Swati Gupta & Xingyin Wang. 2019. Handbook of Metaheuristics. Handbook of Metaheuristics 581 604 .
Sandeep Banik, Sivakumar Rathinam & P.B. Sujit. (2018) Min-Max Path Planning Algorithms for Heterogeneous, Autonomous Underwater Vehicles. Min-Max Path Planning Algorithms for Heterogeneous, Autonomous Underwater Vehicles.
Petr Stodola. (2018) Using Metaheuristics on the Multi-Depot Vehicle Routing Problem with Modified Optimization Criterion. Algorithms 11:5, pages 74.
Crossref
P. Matl, R. F. Hartl & T. Vidal. (2018) Workload Equity in Vehicle Routing Problems: A Survey and Analysis. Transportation Science 52:2, pages 239-260.
Crossref
Xingyin Wang, Bruce Golden, Edward Wasil & Rui Zhang. (2016) The min–max split delivery multi-depot vehicle routing problem with minimum service time requirement. Computers & Operations Research 71, pages 110-126.
Crossref

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.