The profitable close-enough arc routing problem

DOI10.1016/J.COR.2021.105653OpenAlexW4200368289MaRDI QIDQ2669779FDOQ2669779

Authors: Isaac Plana, Miguel Reula, Nicola Bianchessi, Ángel Corberán, José M. Sanchis 

Publication date: 9 March 2022

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2021.105653

Recommendations

• The min-max close-enough arc routing problem
• On the distance-constrained close enough arc routing problem
• scientific article; zbMATH DE number 6741969
• Solving the close-enough arc routing problem
• The undirected capacitated arc routing problem with profits

zbMATH Keywords

polyhedraarc routingbranch and cutprofitsclose-enough

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• The orienteering problem: a survey
• Solving the prize-collecting rural postman problem
• The maximum benefit Chinese postman problem and the maximum benefit traveling salesman problem
• Privatized rural postman problems
• New results for the directed profitable rural postman problem
• An ILP-refined tabu search for the directed profitable rural postman problem
• The Covering Tour Problem
• A polyhedral approach to the rural postman problem
• Profitable mixed capacitated arc routing and related problems
• Vehicle Routing
• Arc Routing
• Title not available (Why is that?)
• A branch-and-cut algorithm for the profitable windy rural postman problem
• A branch-and-cut algorithm for the maximum benefit Chinese postman problem
• Approximate solutions for the maximum benefit chinese postman problem
• The stacker crane problem and the directed general routing problem
• The generalized arc routing problem
• A novel discretization scheme for the close enough traveling salesman problem
• 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
• The close enough traveling salesman problem: a discussion of several heuristics
• Optimization and decision science: methodologies and applications. ODS, Sorrento, Italy, September 4--7, 2017
• Advances in meter Reading: heuristic solution of the close enough traveling salesman problem over a street network
• Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem
• A matheuristic for the distance-constrained close-enough arc routing problem
• The Stochastic Close-Enough Arc Routing Problem
• On the distance-constrained close enough arc routing problem

Cited In (4)

• The Stochastic Close-Enough Arc Routing Problem
• The min-max close-enough arc routing problem
• On the distance-constrained close enough arc routing problem
• Title not available (Why is that?)

Uses Software

• VRP

This page was built for publication: The profitable close-enough arc routing problem

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