6533b831fe1ef96bd129910c

RESEARCH PRODUCT

A New Branch-and-Cut Algorithm for the Generalized Directed Rural Postman Problem

Thais ÁVilaIsaac PlanaJosé M. SanchisÁNgel Corberán

subject

050210 logistics & transportationMathematical optimization021103 operations research05 social sciences0211 other engineering and technologiesTransportation02 engineering and technologyTravelling salesman problemClose-enough arc routing problemBranch-and-cut0502 economics and businessGeneralized rural postman problemRouting (electronic design automation)MATEMATICA APLICADABranch and cutArc routingAlgorithmAutomatic meter readingCivil and Structural EngineeringMathematics

description

The generalized directed rural postman problem, also known as the close-enough arc routing problem, is an arc routing problem with some interesting real-life applications, such as routing for meter reading. In this article we introduce two new formulations for this problem as well as various families of new valid inequalities that are used to design and implement a branch-and-cut algorithm. The computational results obtained on test bed instances from the literature show that this algorithm outperforms the existing exact methods

yearjournalcountryeditionlanguage
2016-05-01
10.13039/501100003359http://hdl.handle.net/10251/84205