An improved heuristic for the capacitated arc routing problem
type: Item
instance of: scholarly article
title: An improved heuristic for the capacitated arc routing problem
zbMATH Open document ID: 1179.90038
author: J. Martínez
published in: Computers \& Operations Research
publication date: 2009-04-03T00:00:00Z
full work available at URL: http://hdl.handle.net/10316/9989
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5539862
zbMATH Keywords: vehicle routing
zbMATH Keywords: capacitated arc routing problem
zbMATH Keywords: heuristics
MaRDI profile type: Publication
OpenAlex ID: W2055882545
cites work: Q5687196
cites work: Q4510100
cites work: Capacitated arc routing problems
cites work: Q5287166
cites work: Solving capacitated arc routing problems using a transformation to the CVRP
cites work: Approximate solutions for the capacitated arc routing problem
cites work: The Capacitated Arc Routing Problem: Lower bounds
cites work: A cutting plane algorithm for the capacitated arc routing problem
cites work: Q4289893
cites work: A Tabu Search Heuristic for the Capacitated arc Routing Problem
cites work: Competitive memetic algorithms for arc routing problems
cites work: Lower and upper bounds for the mixed capacitated arc routing problem
cites work: Q4836312
cites work: Geometric Approaches to Solving the Traveling Salesman Problem
DOI: 10.1016/J.COR.2008.11.005
description: scientific article; zbMATH DE number 5539862