A genetic algorithm for a bi-objective capacitated arc routing problem
From MaRDI portal
Publication:2496047
DOI10.1016/j.cor.2005.02.017zbMath1094.90054MaRDI 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
90C29: Multi-objective and goal programming
90B06: Transportation, logistics and supply chain management
90C59: Approximation methods and heuristics in mathematical programming
Related Items
An improved multi-objective framework for the rich arc routing problem, Using an exact bi-objective decoder in a memetic algorithm for arc-routing (and other decoder-expressible) problems, 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, Crossover iterated local search for SDCARP, A multi-population cooperative coevolutionary algorithm for multi-objective capacitated arc routing problem, Efficient frameworks for greedy split and new depth first search split procedures for routing problems, Uncertain multi-objective Chinese postman problem, New multi-objective method to solve reentrant hybrid flow shop scheduling problem, The bi-objective insular traveling salesman problem with maritime and ground transportation costs, An optimization-based heuristic for the multi-objective undirected capacitated arc routing problem, Workload equity in vehicle routing: the impact of alternative workload resources, Bicriteria vehicle routing problem with preferences and timing constraints in home health care services, Objectives and methods in multi-objective routing problems: a survey and classification scheme, Local-ideal-points based autonomous space decomposition framework for the multi-objective periodic generalized directed rural postman problem under length restrictions with intermediate facilities, The dynamic multi-period vehicle routing problem, A time-dependent hierarchical Chinese postman problem, Multi-objective vehicle routing problems, Solving the bi-objective Robust Vehicle Routing Problem with uncertain costs and demands, A heuristic two-phase solution approach for the multi-objective dial-a-ride problem, Recent results on Arc Routing Problems: An annotated bibliography, A Decade of Capacitated Arc Routing, From Single-Objective to Multi-Objective Vehicle Routing Problems: Motivations, Case Studies, and Methods
Cites Work
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
