Memetic algorithm based on extension step and statistical filtering for large-scale capacitated arc routing problems
From MaRDI portal
Publication:6062003
Cites work
- scientific article; zbMATH DE number 1703887 (Why is no real title available?)
- scientific article; zbMATH DE number 2134188 (Why is no real title available?)
- scientific article; zbMATH DE number 1256737 (Why is no real title available?)
- scientific article; zbMATH DE number 1568944 (Why is no real title available?)
- A Tabu Search Heuristic for the Capacitated arc Routing Problem
- A Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem
- A cutting plane algorithm for the capacitated arc routing problem
- A deterministic tabu search algorithm for the capacitated arc routing problem
- A genetic algorithm for a bi-objective capacitated arc routing problem
- A guided local search heuristic for the capacitated arc routing problem
- A multi-population cooperative coevolutionary algorithm for multi-objective capacitated arc routing problem
- A survey on metaheuristics for stochastic combinatorial optimization
- An improved heuristic for the capacitated arc routing problem
- Capacitated arc routing problems
- Combining simulated annealing with Lagrangian relaxation and weighted Dantzig-Wolfe decomposition for integrated design decisions in wireless sensor networks
- Competitive memetic algorithms for arc routing problems
- Districting for salt spreading operations
- Exact methods based on node-routing formulations for undirected arc-routing problems
- Heuristic methods for the sectoring arc routing problem
- Honey bees mating optimization algorithm for large scale vehicle routing problems
- Immune clonal coevolutionary algorithm for dynamic multiobjective optimization
- Multi-objective memetic algorithms
- Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment
- Solving capacitated arc routing problems using a transformation to the CVRP
- Solving school bus routing problems through integer programming
- The Capacitated Arc Routing Problem: Lower bounds
- The capacitated arc routing problem. A heuristic algorithm
- The fleet size and mix problem for capacitated arc routing
This page was built for publication: Memetic algorithm based on extension step and statistical filtering for large-scale capacitated arc routing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6062003)