GRASP with evolutionary path-relinking for the capacitated arc routing problem
type: Item
instance of: scholarly article
title: GRASP with evolutionary path-relinking for the capacitated arc routing problem
zbMATH Open document ID: 1348.90158
author: P. M. França
author: André Luiz Morelato França
author: Fábio Luiz Usberti
published in: Computers \& Operations Research
publication date: 2016-11-10T00:00:00Z
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90-04
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6650553
zbMATH Keywords: arc routing
zbMATH Keywords: metaheuristics
zbMATH Keywords: evolutionary path-relinking
zbMATH Keywords: GRASP filtering
zbMATH Keywords: reactive parameters
zbMATH Keywords: infeasible solution space search
MaRDI profile type: Publication
full work available at URL: j.cor.2011.10.014
OpenAlex ID: W2088003110
cites work: Capacitated arc routing problems
cites work: Arc Routing Problems, Part II: The Rural Postman Problem
cites work: Q5687196
cites work: The open capacitated arc routing problem
cites work: Heuristics for a dynamic rural postman problem
cites work: Q5287166
cites work: Solving capacitated arc routing problems using a transformation to the CVRP
cites work: An Approximation Algorithm for the Capacitated Arc Routing Problem
cites work: The Capacitated Chinese Postman Problem: Lower Bounds and Solvable Cases
cites work: Lower-bounding and heuristic methods for a refuse collection vehicle routing problem
cites work: New lower bounds 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: New lower bound for the capacitated arc routing problem
cites work: Lower and upper bounds for the mixed capacitated arc routing problem
cites work: Lower bounds for the mixed capacitated arc routing problem
cites work: An improved heuristic for the capacitated arc routing problem
cites work: Augment-insert algorithms for the capacitated arc routing problem
cites work: Q4350080
cites work: A Tabu Search Heuristic for the Capacitated arc Routing Problem
cites work: A deterministic tabu search algorithm for the capacitated arc routing problem
cites work: Competitive memetic algorithms for arc routing problems
cites work: A guided local search heuristic for the capacitated arc routing problem
cites work: A Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem
cites work: A variable neighborhood search for the capacitated arc routing problem with intermediate facilities
cites work: Algorithms for Large Directed Capacitated Arc Routing Problem Instances
cites work: Q3374251
cites work: A Decade of Capacitated Arc Routing
cites work: Recent results on Arc Routing Problems: An annotated bibliography
cites work: Greedy randomized adaptive search procedures
cites work: A GRASP with evolutionary path relinking for the truck and trailer routing problem
cites work: Approximate solutions for the capacitated arc routing problem
cites work: Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment
cites work: Infeasible/feasible search trajectories and directional rounding in integer programming
cites work: A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
cites work: Q4352217
cites work: A hybrid heuristic for the \(p\)-median problem
cites work: GRASP and path relinking for the max-min diversity problem
DOI: 10.1016/J.COR.2011.10.014
description: scientific article; zbMATH DE number 6650553