An efficiency-based path-scanning heuristic for the capacitated arc routing problem
type: Item
instance of: scholarly article
title: An efficiency-based path-scanning heuristic for the capacitated arc routing problem
zbMATH Open document ID: 1458.90601
author: Rafael Kendy Arakaki
author: Fábio Luiz Usberti
published in: Computers \& Operations Research
publication date: 2018-12-17T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6994283
zbMATH Keywords: capacitated arc routing problem
zbMATH Keywords: constructive heuristic
zbMATH Keywords: path-scanning
describes a project that uses: LEMON
describes a project that uses: VRP
MaRDI profile type: Publication
full work available at URL: j.cor.2018.11.018
OpenAlex ID: W2903469954
cites work: A branch-and-price algorithm for capacitated arc routing problem with flexible time windows
cites work: Hybrid genetic algorithm for the open capacitated arc routing problem
cites work: Q5271456
cites work: Lower and upper bounds for the mixed capacitated arc routing problem
cites work: The Capacitated Arc Routing Problem: Lower bounds
cites work: A guided local search heuristic for the capacitated arc routing problem
cites work: The shortest-path problem with resource constraints with \((k, 2)\)-loop elimination and its application to the capacitated arc-routing problem
cites work: Modeling and solving the mixed capacitated general routing problem
cites work: A deterministic tabu search algorithm for the capacitated arc routing problem
cites work: A parallel insert method for the capacitated arc routing problem
cites work: A hybrid metaheuristic approach for the capacitated arc routing problem
cites work: Benchmarking optimization software with performance profiles.
cites work: Q5271460
cites work: Q5271463
cites work: Capacitated arc routing problems
cites work: An optimization-based heuristic for the multi-objective undirected capacitated arc routing problem
cites work: Competitive memetic algorithms for arc routing problems
cites work: Q5271457
cites work: Approximate solutions for the capacitated arc routing problem
cites work: Augment-insert algorithms for the capacitated arc routing problem
cites work: A variable neighborhood search for the capacitated arc routing problem with intermediate facilities
cites work: Q5271454
cites work: Tour splitting algorithms for vehicle routing problems
cites work: An improved heuristic for the capacitated arc routing problem
cites work: Vehicle Routing
cites work: The fleet size and mix problem for capacitated arc routing
cites work: The open capacitated arc routing problem
cites work: GRASP with evolutionary path-relinking for the capacitated arc routing problem
cites work: Solving the mobile mapping van problem: a hybrid metaheuristic for capacitated arc routing with soft time windows
Wikidata QID: Q128861304
DOI: 10.1016/J.COR.2018.11.018
description: scientific article; zbMATH DE number 6994283