A genetic algorithm for a bi-objective capacitated arc routing problem

DOI10.1016/J.COR.2005.02.017zbMath1094.90054OpenAlexW2082809580MaRDI QIDQ2496047

Christian Prins, Marc Sevaux, Philippe Lacomme

Publication date: 30 June 2006

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

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

zbMATH Keywords

multi-objective optimizationgenetic algorithmmetaheuristiccapacitated arc routing problem

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (25)

The bi-objective mixed capacitated general routing problem with different route balance criteria ⋮ Approximation schemes for bi-objective combinatorial optimization and their application to the TSP with profits ⋮ The bi-objective insular traveling salesman problem with maritime and ground transportation costs ⋮ Efficient frameworks for greedy split and new depth first search split procedures for routing problems ⋮ An improved multi-objective framework for the rich arc routing problem ⋮ Memetic algorithm based on extension step and statistical filtering for large-scale capacitated arc routing problems ⋮ Solving the bi-objective Robust Vehicle Routing Problem with uncertain costs and demands ⋮ Arc routing problems: A review of the past, present, and future ⋮ Using an exact bi-objective decoder in a memetic algorithm for arc-routing (and other decoder-expressible) problems ⋮ Crossover iterated local search for SDCARP ⋮ A multi-population cooperative coevolutionary algorithm for multi-objective capacitated arc routing problem ⋮ A Decade of Capacitated Arc Routing ⋮ From Single-Objective to Multi-Objective Vehicle Routing Problems: Motivations, Case Studies, and Methods ⋮ Multi-objective vehicle routing problems ⋮ Workload equity in vehicle routing: the impact of alternative workload resources ⋮ An optimization-based heuristic for the multi-objective undirected capacitated arc routing problem ⋮ Bicriteria vehicle routing problem with preferences and timing constraints in home health care services ⋮ The dynamic multi-period vehicle routing problem ⋮ A heuristic two-phase solution approach for the multi-objective dial-a-ride problem ⋮ Recent results on Arc Routing Problems: An annotated bibliography ⋮ Objectives and methods in multi-objective routing problems: a survey and classification scheme ⋮ A time-dependent hierarchical Chinese postman problem ⋮ Uncertain multi-objective Chinese postman problem ⋮ New multi-objective method to solve reentrant hybrid flow shop scheduling problem ⋮ Local-ideal-points based autonomous space decomposition framework for the multi-objective periodic generalized directed rural postman problem under length restrictions with intermediate facilities

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Competitive memetic algorithms for arc routing problems
• The fleet size and mix problem for capacitated arc routing
• A cutting plane algorithm for the capacitated arc routing problem
• A guided local search heuristic for the capacitated arc routing problem
• Capacitated arc routing problems
• A Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem
• A Tabu Search Heuristic for the Capacitated arc Routing Problem
• Genetic local search for multi-objective combinatorial optimization

This page was built for publication: A genetic algorithm for a bi-objective capacitated arc routing problem