6533b836fe1ef96bd12a01be

RESEARCH PRODUCT

Lower bounds and heuristics for the Windy Rural Postman Problem

Alessandro CarrottaDaniele VigoJosé M. SanchisÁNgel CorberánEnrique Benavent

subject

Mathematical optimizationInformation Systems and ManagementGeneral Computer ScienceHeuristic (computer science)Management Science and Operations ResearchUpper and lower boundsIndustrial and Manufacturing EngineeringWindy Rural Postman ProblemModeling and SimulationCutting planesHeuristicsRouting (electronic design automation)HeuristicsMATEMATICA APLICADAAlgorithmArc routingCutting-plane methodMathematicsRouting

description

[EN] In this paper we present several heuristic algorithms and a cutting-plane algorithm for the Windy Rural Postman Problem. This problem contains several important Arc Routing Problems as special cases and has very interesting real-life applications. Extensive computational experiments over different sets of instances are also presented.

yearjournalcountryeditionlanguage
2020-01-16
10.1016/j.ejor.2005.09.021https://doi.org/10.1016/j.ejor.2005.09.021