An exact algorithm and a metaheuristic for the multi-vehicle covering tour problem with a constraint on the number of vertices - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue European Journal of Operational Research Année : 2013

An exact algorithm and a metaheuristic for the multi-vehicle covering tour problem with a constraint on the number of vertices

Résumé

The multi-vehicle covering tour (m-CTP) involves finding a minimum-length set of vehicle routes passing through a subset of vertices, subject to capacity constraints on the length of each route and the number of vertices that it contains, such that each vertex not included in any route lies within a given distance of a route. This paper tackles a particular case of m-CTP where only the restriction on the number of vertices is considered, i.e., the constraint on the length is relaxed. The problem is solved by a branch-and-cut algorithm and a metaheuristic. To develop the branch-and-cut algorithm, we use a new integer programming formulation based on a two-commodity flow model. The metaheuristic is based on the evolutionary local search (ELS) method proposed in [20]. Computational results are reported for a set of test problems derived from the TSPLIB.

Dates et versions

hal-00816026 , version 1 (19-04-2013)

Identifiants

Citer

Minh Hoang Ha, Nathalie Bostel, André Langevin, Louis-Martin Rousseau. 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, 2013, 226 (2), pp.211-221. ⟨10.1016/j.ejor.2012.11.012⟩. ⟨hal-00816026⟩
93 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More