6533b7d8fe1ef96bd126988a

RESEARCH PRODUCT

New facets and an enhanced branch-and-cut for the min-max K -vehicles windy rural postman problem

José M. SanchisIsaac PlanaEnrique BenaventÁNgel Corberán

subject

Postman problemsMathematical optimizationComputer Networks and CommunicationsFacetsWindy postman problemSet (abstract data type)Rural postman problemWindy rural postman problemsHardware and ArchitectureLarge set (Ramsey theory)Multi-vehiclesWindy rural postman problemMATEMATICA APLICADABranch and cutMetaheuristicAlgorithmsSoftwareMultivehicleInformation SystemsMathematics

description

[EN] The min-max windy rural postman problem is a multiple vehicle version of the windy rural postman problem, WRPP, which consists of minimizing the length of the longest route to find a set of balanced routes for the vehicles. In a previous paper, an ILP formulation and a partial polyhedral study were presented, and a preliminary branch-and-cut algorithm that produced some promising computational results was implemented. In this article, we present further results for this problem. We describe several new facet-inducing inequalities obtained from the WRPP, as well as some inequalities that have to be satisfied by any optimal solution. We present an enhanced branch-and-cut algorithm that takes advantage of both these new inequalities and high quality min-max K-WRPP feasible solutions obtained by a metaheuristic. Computational results on a large set of instances are also reported. © 2011 Wiley Periodicals, Inc.

yearjournalcountryeditionlanguage
2011-09-30Networks
https://doi.org/10.1002/net.20469