An efficiency-based path-scanning heuristic for the capacitated arc routing problem

DOI10.1016/j.cor.2018.11.018zbMath1458.90601OpenAlexW2903469954WikidataQ128861304 ScholiaQ128861304MaRDI QIDQ1634089

Fábio Luiz Usberti, Rafael Kendy Arakaki

Publication date: 17 December 2018

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

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

zbMATH Keywords

capacitated arc routing problemconstructive heuristicpath-scanning

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (2)

Arc-routing for winter road maintenance ⋮ Arc routing for parking enforcement officers: exact and heuristic solutions

Uses Software

• LEMON
• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The shortest-path problem with resource constraints with \((k, 2)\)-loop elimination and its application to the capacitated arc-routing problem
• A hybrid metaheuristic approach for the capacitated arc routing problem
• GRASP with evolutionary path-relinking for the capacitated arc routing problem
• Modeling and solving the mixed capacitated general routing problem
• Competitive memetic algorithms for arc routing problems
• The open capacitated arc routing problem
• A parallel insert method for the capacitated arc routing problem
• A deterministic tabu search algorithm for the capacitated arc routing problem
• A variable neighborhood search for the capacitated arc routing problem with intermediate facilities
• Solving the mobile mapping van problem: a hybrid metaheuristic for capacitated arc routing with soft time windows
• An improved heuristic for the capacitated arc routing problem
• The fleet size and mix problem for capacitated arc routing
• Approximate solutions for the capacitated arc routing problem
• Hybrid genetic algorithm for the open capacitated arc routing problem
• An optimization-based heuristic for the multi-objective undirected capacitated arc routing problem
• A guided local search heuristic for the capacitated arc routing problem
• Augment-insert algorithms for the capacitated arc routing problem
• Lower and upper bounds for the mixed capacitated arc routing problem
• A Branch-and-Price Algorithm for Capacitated Arc Routing Problem with Flexible Time Windows
• Vehicle Routing
• Tour splitting algorithms for vehicle routing problems
• Capacitated arc routing problems
• The Capacitated Arc Routing Problem: Lower bounds
• Benchmarking optimization software with performance profiles.

This page was built for publication: An efficiency-based path-scanning heuristic for the capacitated arc routing problem