On the distance-constrained close enough arc routing problem

DOI10.1016/J.EJOR.2020.09.012MaRDI QIDQ2029943zbMATH OpenOpenAlexFDO

Authors Isaac Plana, Miguel Reula, Ángel Corberán, José M. 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 cutclose-enoughdistance constraintsroutingrural postman

Mathematics Subject Classification ID

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

Recommendations

• A matheuristic for the distance-constrained close-enough arc routing problem
• Solving the close-enough arc routing problem
• The min-max close-enough arc routing problem
• Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem
• The profitable close-enough arc routing problem

Cites work

• A branch-and-bound algorithm for the close-enough traveling salesman problem
• A cutting plane algorithm for the general routing problem
• A matheuristic for the distance-constrained close-enough arc routing problem
• A novel discretization scheme for the close enough traveling salesman problem
• A polyhedral approach to the rural postman problem
• Advances in meter Reading: heuristic solution of the close enough traveling salesman problem over a street network
• An Integer-Programming-Based Approach to the Close-Enough Traveling Salesman Problem
• Arc Routing
• Benchmarking optimization software with performance profiles.
• Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem
• Heuristic Approaches for a TSP Variant: The Automatic Meter Reading Shortest Tour Problem
• scientific article; zbMATH DE number 6741970 (Why is no real title available?)
• New inequalities for the general routing problem
• Optimization and decision science: methodologies and applications. ODS, Sorrento, Italy, September 4--7, 2017
• Solving the close-enough arc routing problem
• The close enough traveling salesman problem: a discussion of several heuristics
• The Covering Tour Problem
• The generalized arc routing problem
• The mixed general routing polyhedron
• The Stochastic Close-Enough Arc Routing Problem
• The traveling salesman problem on a graph and some related integer polyhedra

Cited in

(16)

• Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem
• A matheuristic for the distance-constrained close-enough arc routing problem
• 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
• The profitable close-enough arc routing problem
• Solving the close-enough arc routing problem
• The close enough traveling salesman problem: a discussion of several heuristics
• Advances in meter Reading: heuristic solution of the close enough traveling salesman problem over a street network
• The Stochastic 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
• Exploring roadside management optimisation opportunities: a systematic review on arc routing problems applications and modelling
• New models for close enough facility location problems
• Beyond fifty years of vehicle routing: insights into the history and the future
• The covering tour problem with path upgrades

Describes a project that uses

Uses Software

• VRP

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2029943)