A matheuristic for the distance-constrained close-enough arc routing problem

DOI10.1007/s11750-019-00507-3zbMath1418.90052OpenAlexW2920904606MaRDI QIDQ2001874

Isaac Plana, Miguel Reula, Angel Corberán, José María Sanchis

Publication date: 11 July 2019

Published in: Top (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10251/160765

zbMATH Keywords

multi-startmatheuristicdistance constraintsclose-enough arc routing problemgeneralized directed rural postman problem

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Related Items (7)

A strategic oscillation simheuristic for the time capacitated arc routing problem with stochastic demands ⋮ The profitable close-enough arc routing problem ⋮ An improved multi-objective framework for the rich arc routing problem ⋮ Arc routing problems: A review of the past, present, and future ⋮ On the distance-constrained close enough arc routing problem ⋮ Spatial coverage in routing and path planning problems ⋮ The min-max close-enough arc routing problem

Cites Work

• The generalized arc routing problem
• Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem
• Optimization and decision science: methodologies and applications. ODS, Sorrento, Italy, September 4--7, 2017
• Solving the close-enough arc routing problem
• Advances in Meter Reading: Heuristic Solution of the Close Enough Traveling Salesman Problem over a Street Network
• The Covering Tour Problem
• The stochastic close-enough arc routing problem
• Arc Routing
• A branch & cut algorithm for the windy general routing problem and special cases

This page was built for publication: A matheuristic for the distance-constrained close-enough arc routing problem