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

DOI10.1016/j.cor.2011.10.014zbMath1348.90158OpenAlexW2088003110MaRDI QIDQ336740

André Luiz Morelato França, Paulo 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

metaheuristicsarc routingevolutionary path-relinkingGRASP filteringinfeasible solution space searchreactive parameters

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) Deterministic network models in operations research (90B10) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)

Related Items (11)

An efficiency-based path-scanning heuristic for the capacitated arc routing problem ⋮ A hybrid metaheuristic approach 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 ⋮ Constructive heuristics for the mixed capacity arc routing problem under time restrictions with intermediate facilities ⋮ The commodity-split multi-compartment capacitated arc routing problem ⋮ The Capacitated and Economic Districting Problem ⋮ Fast upper and lower bounds for a large‐scale real‐world 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 ⋮ Shipper collaboration in forward and reverse logistics

Cites Work

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

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