A branch-and-price algorithm for the multivehicle covering tour problem - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Networks Année : 2014

A branch-and-price algorithm for the multivehicle covering tour problem

Résumé

This article proposes a mathematical model and a branch‐and‐price algorithm for the multivehicle covering tour problem. This problem consists in finding a set of routes on a weighted graph such that a set of nodes that cannot be visited is covered. A node is covered if it lies within a predefined distance of a visited node. The subproblem encountered during the column generation is a variant of the profitable tour problem. It is reduced to a ring star problem and a branch‐and‐cut algorithm is developed. Computational results are reported on randomly generated instances

Dates et versions

hal-01913508 , version 1 (06-11-2018)

Identifiants

Citer

Nicolas Jozefowiez. A branch-and-price algorithm for the multivehicle covering tour problem. Networks, 2014, 64 (3), pp.160 - 168. ⟨10.1002/net.21564⟩. ⟨hal-01913508⟩
18 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More