A hybrid metaheuristic approach for the capacitated arc routing problem

DOI10.1016/j.ejor.2016.02.015zbMath1346.90087MaRDI QIDQ323105

Yuning Chen, Jin-Kao Hao, Fred Glover

Publication date: 7 October 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2016.02.015

zbMATH Keywords

capacitated arc routing problemmemetic searchtabu thresholding

Mathematics Subject Classification ID

90B06: Transportation, logistics and supply chain management

90C59: Approximation methods and heuristics in mathematical programming

90B10: Deterministic network models in operations research

90C27: Combinatorial optimization

Related Items

Fast upper and lower bounds for a large‐scale real‐world arc routing problem, Scheduling of maintenance work of a large-scale tramway network, Heuristic search to the capacitated clustering problem, A population algorithm based on randomized tabu thresholding for the multi-commodity pickup-and-delivery traveling salesman problem, An efficiency-based path-scanning heuristic for the capacitated arc routing problem, A hybrid dynamic programming and memetic algorithm to the traveling salesman problem with hotel selection, Multi-restart iterative search for the pickup and delivery traveling salesman problem with FIFO loading, Two phased hybrid local search for the periodic capacitated arc routing problem, Efficient local search strategies for the mixed capacitated arc routing problems under time restrictions with intermediate facilities, Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics, A memetic algorithm for the orienteering problem with mandatory visits and exclusionary constraints, Adaptive feasible and infeasible tabu search for weighted vertex coloring, Hybrid evolutionary search for the traveling repairman problem with profits, The commodity-split multi-compartment capacitated arc routing problem, A hybrid iterated local search heuristic for the traveling salesperson problem with hotel selection

Uses Software

• irace
• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improved bounds for large scale capacitated arc routing problem
• GRASP with evolutionary path-relinking for the capacitated arc routing problem
• The case for strategic oscillation
• 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
• The fleet size and mix problem for capacitated arc routing
• Routeing winter gritting vehicles
• A guided local search heuristic for the capacitated arc routing problem
• Improved lower bounds and exact algorithm for the capacitated arc routing problem
• Exact methods based on node-routing formulations for undirected arc-routing problems
• Capacitated arc routing problems
• The Capacitated Arc Routing Problem: Lower bounds
• A Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem
• A Gentle Introduction to Memetic Algorithms
• A Tabu Search Heuristic for the Capacitated arc Routing Problem
• Tabu Thresholding: Improved Search by Nonmonotonic Trajectories
• Cut-First Branch-and-Price-Second for the Capacitated Arc-Routing Problem
• The Vehicle Routing Problem with Time Windows Part II: Genetic Search
• Handbook of metaheuristics