6533b834fe1ef96bd129e0bb
RESEARCH PRODUCT
A Branch-Price-and-Cut Algorithm for the Min-Max k -Vehicle Windy Rural Postman Problem
Guy DesaulniersÁNgel CorberánEnrique BenaventJosé M. SanchisIsaac PlanaFrançois Lessardsubject
Difficult problemService (systems architecture)Mathematical optimizationComputer Networks and CommunicationsBranch and priceColumn generationSet (abstract data type)Rural postman problemHardware and ArchitectureCutting planesGraph (abstract data type)Branch-and-priceColumn generationWindy rural postman problemMATEMATICA APLICADAAlgorithmSoftwareInformation SystemsMathematicsMultivehicledescription
[EN] The min-max k -vehicles windy rural postman problem consists of minimizing the maximal distance traveled by a vehicle to find a set of balanced routes that jointly service all the required edges in a windy graph. This is a very difficult problem, for which a branch-and-cut algorithm has already been proposed, providing good results when the number of vehicles is small. In this article, we present a branch-price-and-cut method capable of obtaining optimal solutions for this problem when the number of vehicles is larger for the same set of required edges. Extensive computational results on instances from the literature are presented.
| year | journal | country | edition | language |
|---|---|---|---|---|
| 2013-10-05 |