A matheuristic for the distance-constrained close-enough arc routing problem
type: Item
instance of: scholarly article
title: A matheuristic for the distance-constrained close-enough arc routing problem
zbMATH Open document ID: 1418.90052
author: Isaac Plana
author: Miguel Reula
author: Ángel Corberán
author: José M. Sanchis
published in: Top
publication date: 2019-07-11T00:00:00Z
full work available at URL: http://hdl.handle.net/10251/160765
Mathematics Subject Classification ID: 90B10
zbMATH DE Number: 7079040
zbMATH Keywords: close-enough arc routing problem
zbMATH Keywords: generalized directed rural postman problem
zbMATH Keywords: distance constraints
zbMATH Keywords: matheuristic
zbMATH Keywords: multi-start
MaRDI profile type: Publication
OpenAlex ID: W2920904606
cites work: The generalized arc routing problem
cites work: Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem
cites work: Optimization and decision science: methodologies and applications. ODS, Sorrento, Italy, September 4--7, 2017
cites work: Arc Routing
cites work: A branch & cut algorithm for the windy general routing problem and special cases
cites work: The Covering Tour Problem
cites work: Solving the close-enough arc routing problem
cites work: The stochastic close-enough arc routing problem
cites work: Advances in Meter Reading: Heuristic Solution of the Close Enough Traveling Salesman Problem over a Street Network
DOI: 10.1007/S11750-019-00507-3
description: scientific article; zbMATH DE number 7079040