On the distance-constrained close enough arc routing problem

DOI10.1016/j.ejor.2020.09.012zbMath1487.90547OpenAlexW3087264509MaRDI QIDQ2029943

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

Publication date: 4 June 2021

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2020.09.012

zbMATH Keywords

branch and cutroutingdistance constraintsrural postmanclose-enough

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)

Related Items (6)

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 ⋮ Spatial coverage in routing and path planning problems ⋮ Local-ideal-points based autonomous space decomposition framework for the multi-objective periodic generalized directed rural postman problem under length restrictions with intermediate facilities ⋮ The min-max close-enough arc routing problem

Uses Software

• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• New inequalities for the general routing problem
• A polyhedral approach to the rural postman problem
• The mixed general routing polyhedron
• A novel discretization scheme for the close enough traveling salesman problem
• The generalized arc routing problem
• Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem
• A matheuristic for the distance-constrained close-enough arc routing problem
• Optimization and decision science: methodologies and applications. ODS, Sorrento, Italy, September 4--7, 2017
• Solving the close-enough arc routing problem
• An Integer-Programming-Based Approach to the Close-Enough Traveling Salesman Problem
• A Branch-and-Bound Algorithm for the Close-Enough Traveling Salesman Problem
• Heuristic Approaches for a TSP Variant: The Automatic Meter Reading Shortest Tour Problem
• Advances in Meter Reading: Heuristic Solution of the Close Enough Traveling Salesman Problem over a Street Network
• The traveling salesman problem on a graph and some related integer polyhedra
• The Covering Tour Problem
• The stochastic close-enough arc routing problem
• Arc Routing
• A cutting plane algorithm for the general routing problem
• Benchmarking optimization software with performance profiles.

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