A Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem
From MaRDI portal
Publication:4411206
Recommendations
- A variable neighborhood search for the capacitated arc routing problem with intermediate facilities
- A variable neighborhood search algorithm for the capacitated vehicle routing problem
- An approximation algorithm for the capacitated arc routing problem
- Variants of the capacitated arc routing problem
- The capacitated arc routing problem: exact algorithms
- An optimization-based heuristic for the multi-objective undirected capacitated arc routing problem
- Approximate solutions for the capacitated arc routing problem
- Improved lower bounds and exact algorithm for the capacitated arc routing problem
Cited in
(33)- Variable neighbourhood search: Methods and applications
- Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics
- Combinatorial optimization and green logistics
- The multiobjective traveling salesman-repairman problem with profits: design and implementation of a variable neighborhood descent algorithm for a real scenario
- Variable neighbourhood search: methods and applications
- A deterministic tabu search algorithm for the capacitated arc routing problem
- An optimization-based heuristic for the multi-objective undirected capacitated arc routing problem
- Iterated local search and column generation to solve arc-routing as a permutation set-covering problem
- A genetic algorithm for a bi-objective capacitated arc routing problem
- A variable neighborhood search for the capacitated arc routing problem with intermediate facilities
- Evolutionary algorithms for periodic arc routing problems
- A guided local search heuristic for the capacitated arc routing problem
- A variable neighborhood descent algorithm for a real waste collection problem with mobile depots
- The undirected capacitated arc routing problem with profits
- Crossover iterated local search for SDCARP
- Ant colony optimization for the arc routing problem with intermediate facilities under capacity and length restrictions
- A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems
- The open capacitated arc routing problem
- A guided local search procedure for the multi-compartment capacitated arc routing problem
- A decade of capacitated arc routing
- Model and methods to address urban road network problems with disruptions
- Two phased hybrid local search for the periodic capacitated arc routing problem
- Recent results on arc routing problems: an annotated bibliography
- Two-phase heuristic algorithms for full truckloads multi-depot capacitated vehicle routing problem in carrier collaboration
- Local search for the undirected capacitated arc routing problem with profits
- Methods for solving road network problems with disruptions
- A hybrid metaheuristic approach for the capacitated arc routing problem
- Combinatorial optimization and green logistics
- A multi-population cooperative coevolutionary algorithm for multi-objective capacitated arc routing problem
- GRASP with evolutionary path-relinking for the capacitated arc routing problem
- A tabu search algorithm for the Min-Max \(k\)-Chinese postman problem
- 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
This page was built for publication: A Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4411206)
