The multi-vehicle cumulative covering tour problem.

*(English)*Zbl 1381.90019Summary: This paper introduces the multi-vehicle cumulative covering tour problem whose motivation arises from humanitarian logistics. The objective is to determine a set of tours that must be followed by a fleet of vehicles in order to minimize the sum of arrival times (latency) at each visited location. There are three types of locations: mandatory, optional, and unreachable. Each mandatory location must be visited, and optional locations are visited in order to cover the unreachable locations. To guarantee the vehicle autonomy, the duration of each tour should not exceed a given time limit. A mixed integer linear formulation and a greedy randomized adaptive search procedure are proposed for this problem. The performance of the algorithm is assessed over a large set of instances adapted from the literature. Computational results confirm the efficiency of the proposed algorithm.

Reviewer: Reviewer (Berlin)

##### MSC:

90B06 | Transportation, logistics and supply chain management |

90C05 | Linear programming |

90C11 | Mixed integer programming |

##### Keywords:

cumulative vehicle routing problem; multi-vehicle covering tour problem; minimum latency problem; humanitarian logistics##### Software:

GRASP
PDF
BibTeX
XML
Cite

\textit{D. A. Flores-Garza} et al., Ann. Oper. Res. 258, No. 2, 761--780 (2017; Zbl 1381.90019)

Full Text:
DOI

##### References:

[1] | Altay, N; Green, W, OR/MS research in disaster operations management, European Journal of Operational Research, 175, 475-493, (2006) · Zbl 1137.90574 |

[2] | Anaya-Arenas, A; Renaud, J; Ruiz, A, Relief distribution networks: A systematic review, Annals of Operations Research, 223, 53-79, (2014) · Zbl 1306.90021 |

[3] | Archer, A., & Blasiak, A. (2010). Improved approximation algorithms for the minimum latency problem via prize-collecting strolls. In Proceedings of the twenty-first annual ACM-SIAM symposium on discrete algorithms (SODA), Philadelphia, USA, pp. 429-447. · Zbl 1288.68100 |

[4] | Blum, A., Chalasani, P., Coppersmith, D., Pulleyblank, B., Raghavan, P., & Sudan, M. (1994). The minimum latency problem. In Proceedings of the twenty-sixth annual ACM symposium on theory of computing (STOC), Montreal, Canada, pp. 163-171. · Zbl 1345.90073 |

[5] | Campbell, AM; Vandenbussche, D; Hermann, W, Routing for relief efforts, Transportation Science, 42, 127-145, (2008) |

[6] | Chen, P; Dong, X; Niu, Y, An iterated local search algorithm for the cumulative capacitated vehicle routing problem, Technology for Education and Learning, Advances in Intelligent Systems and Computing, 136, 575-581, (2012) |

[7] | Davoudpour, H; Ashrafi, M, Solving multi-objective SDST flexible flow shop using GRASP algorithm, The International Journal of Advanced Manufacturing Technology, 44, 737-747, (2009) |

[8] | Torre, LE; Dolinskaya, IS; Smilowitz, KR, Disaster relief routing: integrating research and practice, Socio-Economic Planning Sciences, Special Issue: Disaster Planning and Logistics: Part 1, 46, 88-97, (2012) |

[9] | Ezzine, IO; Elloumi, S, Polynomial formulation and heuristic based approach for the \(k\)-travelling repairman problem, International Journal of Mathematics in Operational Research, 4, 503-514, (2012) · Zbl 1390.90580 |

[10] | Fakcharoenphol, J; Harrelson, C; Rao, S, The \(k\)-traveling repairmen problem, ACM Transactions on Algorithms, 3, 40:1-40:16, (2007) · Zbl 1446.90133 |

[11] | Festa, P; Resende, MGC, An annotated bibliography of GRASP—part II: applications, International Transactions in Operational Research, 16, 131-172, (2009) · Zbl 1168.90582 |

[12] | Galindo, G; Batta, R, Review of recent developments in OR/MS research in disaster operations management, European Journal of Operational Research, 230, 201-211, (2013) |

[13] | Gendreau, M; Laporte, G; Semet, F, The covering tour problem, Operations Research, 45, 568-576, (1997) · Zbl 0887.90122 |

[14] | Há, MH; Bostel, N; Langevin, A; Rousseau, LM, An exact algorithm and a metaheuristic for the multi-vehicle covering tour problem with a constraint on the number of vertices, European Journal of Operational Research, 226, 211-220, (2013) · Zbl 1292.90050 |

[15] | Hachicha, M; Hodgson, MJ; Laporte, G; Semet, F, Heuristics for the multi-vehicle covering tour problem, Computers & Operations Research, 27, 29-42, (2000) · Zbl 0973.90019 |

[16] | Hmayer, A., & Ezzine, I. (2013). CLARANS heuristic based approch for the \(k\)-traveling repairman problem. In International conference on advanced logistics and transport (ICALT), Sousse, Tunisie, pp. 535-538. |

[17] | Hodgson, MJ; Laporte, G; Semet, F, A covering tour model for planning mobile health care facilities in suhum district, ghana, Journal of Regional Science, 38, 621-638, (1998) |

[18] | Jozefowiez, N. (2011). A column generation approach for the multi-vehicle covering tour problem. In ROADEF 2011, March 2-4, Saint-Etienne, France. · Zbl 1304.90004 |

[19] | Jozefowiez, N, A branch-and-price algorithm for the multivehicle covering tour problem, Networks, 64, 160-168, (2014) |

[20] | Kammoun, M; Derbel, H; Ratli, M; Jarboui, B, A variable neighborhood search for solving the multi-vehicle covering tour problem, Electronic Notes in Discrete Mathematics, 47, 285-292, (2015) · Zbl 1362.90090 |

[21] | Ke, L; Feng, Z, A two-phase metaheuristic for the cumulative capacitated vehicle routing problem, Computers & Operations Research, 40, 633-638, (2013) · Zbl 1349.90859 |

[22] | Lopes, R; Souza, VA; Cunha, AS, A branch-and-price algorithm for the multi-vehicle covering tour problem, Electronic Notes in Discrete Mathematics, 44, 61-66, (2013) |

[23] | Luo, Z; Qin, H; Lim, A, Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints, European Journal of Operational Research, 234, 49-60, (2014) · Zbl 1305.90408 |

[24] | Lysgaard, J; Wøhlk, S, A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem, European Journal of Operational Research, 236, 800-810, (2014) · Zbl 1304.90038 |

[25] | Murakami, K. (2014). A column generation approach for the multi-vehicle covering tour problem. In IEEE international conference on automation science and engineering (CASE), New Taipei, Taiwan, pp. 1063-1068). |

[26] | Naji-Azimi, Z; Renaud, J; Ruiz, A; Salari, M, A covering tour approach to the location of satellite distribution centers to supply Humanitarian aid, European Journal of Operational Research, 222, 596-605, (2012) |

[27] | Ngueveu, SU; Prins, C; Wolfler Calvo, R, An effective memetic algorithm for the cumulative capacitated vehicle routing problem, Computers & Operations Research, 37, 1877-1885, (2010) · Zbl 1188.90037 |

[28] | Oliveira, W. A., Mello, M. P., Moretti, A. C., & Reis, E. F. (2013). The multi-vehicle covering tour problem: Building routes for urban patrolling. arXiv:1309.5502. |

[29] | Ozsoydan, FB; Sipahioglu, A, Heuristic solution approaches for the cumulative capacitated vehicle routing problem, Optimization, 62, 1321-1340, (2013) · Zbl 1360.90036 |

[30] | Ribeiro, GM; Laporte, G, An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem, Computers & Operations Research, 39, 728-735, (2012) · Zbl 1251.90057 |

[31] | Sahni, S., & Gonzales, T. (1974). P-complete problems and approximate solutions. In IEEE conference record of 15th annual symposium on switching and automata theory, New York, USA, pp. 28-32. · Zbl 1137.90574 |

[32] | Salazar-Aguilar, MA; Ríos-Mercado, RZ; González-Velarde, JL, GRASP strategies for a bi-objective commercial territory design problem, Journal of Heuristics, 19, 179-200, (2013) |

[33] | Sitters, R. (2014). Polynomial time approximation schemes for the traveling repairman and other minimum latency problems, Portland, USA, pp. 604-616. doi:10.1137/1.9781611973402.46. |

[34] | Vidal, T; Crainic, TG; Gendreau, M; Prins, C, A unified solution framework for multi-attribute vehicle routing problems, European Journal of Operational Research, 234, 658-673, (2014) · Zbl 1304.90004 |

This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.