GRASP with evolutionary path-relinking for the capacitated arc routing problem

DOI10.1016/J.COR.2011.10.014MaRDI QIDQ336740zbMATH OpenOpenAlexFDO

Authors P. M. França, André Luiz Morelato França, Fábio Luiz Usberti

Publication date 10 November 2016

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

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

zbMATH Keywords

arc routingevolutionary path-relinkingGRASP filteringinfeasible solution space searchmetaheuristicsreactive parameters

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• An efficiency-based path-scanning heuristic for the capacitated arc routing problem
• A deterministic tabu search algorithm for the capacitated arc routing problem
• A hybrid metaheuristic approach for the capacitated arc routing problem
• The open capacitated arc routing problem
• Competitive memetic algorithms for arc routing problems

Cites work

• A cutting plane algorithm for the capacitated arc routing problem
• A decade of capacitated arc routing
• A deterministic tabu search algorithm for the capacitated arc routing problem
• A GRASP with evolutionary path relinking for the truck and trailer routing problem
• A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
• A guided local search heuristic for the capacitated arc routing problem
• A hybrid heuristic for the \(p\)-median problem
• A Tabu Search Heuristic for the Capacitated arc Routing Problem
• A Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem
• A variable neighborhood search for the capacitated arc routing problem with intermediate facilities
• Algorithms for Large Directed Capacitated Arc Routing Problem Instances
• An approximation algorithm for the capacitated arc routing problem
• An improved heuristic for the capacitated arc routing problem
• Approximate solutions for the capacitated arc routing problem
• Arc Routing Problems, Part II: The Rural Postman Problem
• Augment-insert algorithms for the capacitated arc routing problem
• Capacitated arc routing problems
• Competitive memetic algorithms for arc routing problems
• GRASP and path relinking for the max-min diversity problem
• Greedy randomized adaptive search procedures
• Heuristics for a dynamic rural postman problem
• scientific article; zbMATH DE number 1054960 (Why is no real title available?)
• scientific article; zbMATH DE number 1054674 (Why is no real title available?)
• scientific article; zbMATH DE number 232390 (Why is no real title available?)
• scientific article; zbMATH DE number 956790 (Why is no real title available?)
• Infeasible/feasible search trajectories and directional rounding in integer programming
• Lower and upper bounds for the mixed capacitated arc routing problem
• Lower bounds for the mixed capacitated arc routing problem
• Lower-bounding and heuristic methods for a refuse collection vehicle routing problem
• New lower bound for the capacitated arc routing problem
• New lower bounds for the Capacitated Arc Routing Problem
• Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment
• Recent results on arc routing problems: an annotated bibliography
• Recent trends in arc routing
• Solving capacitated arc routing problems using a transformation to the CVRP
• The Capacitated Arc Routing Problem: Lower bounds
• The Capacitated Chinese Postman Problem: Lower Bounds and Solvable Cases
• The open capacitated arc routing problem

Cited in

(19)

• An efficiency-based path-scanning heuristic for the capacitated arc routing problem
• An iterated ``hyperplane exploration approach for the quadratic knapsack problem
• Hybrid genetic algorithm for the open capacitated arc routing problem
• Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics
• A hybrid evolutionary search for the generalized quadratic multiple knapsack problem
• A new ant colony optimization algorithm to solve the periodic capacitated arc routing problem with continuous moves
• A GRASP and path relinking heuristic for rural road network development
• The commodity-split multi-compartment capacitated arc routing problem
• A hybrid metaheuristic approach for the capacitated arc routing problem
• Constructive heuristics for the mixed capacity arc routing problem under time restrictions with intermediate facilities
• Algorithms for Large Directed Capacitated Arc Routing Problem Instances
• Open capacitated ARC routing problem by hybridized ant colony algorithm
• The Capacitated and Economic Districting Problem
• Fast upper and lower bounds for a large‐scale real‐world arc routing problem
• A parameterized lower bounding method for the open capacitated arc routing problem
• An updated annotated bibliography on arc routing problems
• Greedy randomized adaptive search procedures with path relinking. An analytical review of designs and implementations
• The open capacitated arc routing problem
• Shipper collaboration in forward and reverse logistics

This page was built for publication: GRASP with evolutionary path-relinking for the capacitated arc routing problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q336740)