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

DOI10.1016/J.COR.2011.10.014zbMATH Open1348.90158OpenAlexW2088003110MaRDI QIDQ336740FDOQ336740

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

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

zbMATH Keywords

metaheuristicsarc routingevolutionary path-relinkingGRASP filteringinfeasible solution space searchreactive parameters

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) 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) Transportation, logistics and supply chain management (90B06)

Cites Work

• A decade of capacitated arc routing
• A hybrid heuristic for the \(p\)-median problem
• A GRASP with evolutionary path relinking for the truck and trailer routing problem
• A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
• Greedy randomized adaptive search procedures
• A guided local search heuristic for the capacitated arc routing problem
• Recent results on arc routing problems: an annotated bibliography
• Capacitated arc routing problems
• The Capacitated Arc Routing Problem: Lower bounds
• Arc Routing Problems, Part II: The Rural Postman Problem
• Lower bounds for the mixed capacitated arc routing problem
• Approximate solutions for the capacitated arc routing problem
• A cutting plane algorithm for the capacitated arc routing problem
• Lower and upper bounds for the mixed capacitated arc routing problem
• Solving capacitated arc routing problems using a transformation to the CVRP
• An Approximation Algorithm for the Capacitated Arc Routing Problem
• Recent trends in arc routing
• Title not available (Why is that?)
• A Tabu Search Heuristic for the Capacitated arc Routing Problem
• Title not available (Why is that?)
• The open capacitated arc routing problem
• GRASP and path relinking for the max-min diversity problem
• A Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem
• Competitive memetic algorithms for arc routing problems
• 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
• Lower-bounding and heuristic methods for a refuse collection vehicle routing problem
• Augment-insert algorithms for the capacitated arc routing problem
• New lower bound for the capacitated arc routing problem
• 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
• Title not available (Why is that?)
• Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment
• Title not available (Why is that?)
• Heuristics for a dynamic rural postman problem
• Infeasible/feasible search trajectories and directional rounding in integer programming

Cited In (16)

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

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)