Competitive memetic algorithms for arc routing problems
From MaRDI portal
Recommendations
- Evolutionary algorithms for periodic arc routing problems
- A memetic algorithm for the multi trip vehicle routing problem
- Memetic algorithm based on extension step and statistical filtering for large-scale capacitated arc routing problems
- An effective memetic algorithm for the cumulative capacitated vehicle routing problem
- A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem
- A bi-level model and memetic algorithm for arc interdiction location-routing problem
- A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands
- A memetic algorithm for a vehicle routing problem with backhauls
- scientific article; zbMATH DE number 1703887
- scientific article; zbMATH DE number 5582828
Cited in
(56)- An improved heuristic for the capacitated arc routing problem
- Heuristic methods for the sectoring arc routing problem
- A branch-and-price algorithm for the capacitated arc routing problem with stochastic demands
- Two-phase heuristic algorithms for full truckloads multi-depot capacitated vehicle routing problem in carrier collaboration
- An efficiency-based path-scanning heuristic for the capacitated arc routing problem
- Two phased hybrid local search for the periodic capacitated arc routing problem
- The dynamic bowser 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
- Iterated local search and column generation to solve arc-routing as a permutation set-covering problem
- Splitting procedures for the mixed capacitated arc routing problem under time restrictions with intermediate facilities
- An optimization-based heuristic for the multi-objective undirected capacitated arc routing problem
- Capacitated arc routing problem with deadheading demands
- Evolutionary algorithms for periodic arc routing problems
- Divide-and-conquer large scale capacitated arc routing problems with route cutting off decomposition
- Integration of routing into a resource-constrained project scheduling problem
- A guided local search procedure for the multi-compartment capacitated arc routing problem
- A memetic algorithm with dynamic population management for an integrated production-distribution problem
- Lower and upper bounds for the mixed capacitated arc routing problem
- A tabu search algorithm for the Min-Max \(k\)-Chinese postman problem
- A genetic algorithm for a bi-objective capacitated arc routing problem
- A scatter search for the periodic capacitated arc routing problem
- The commodity-split multi-compartment capacitated arc routing problem
- A strategic oscillation simheuristic for the time capacitated arc routing problem with stochastic demands
- scientific article; zbMATH DE number 1703887 (Why is no real title available?)
- A quasi-polynomial time approximation scheme for Euclidean CVRPTW
- Recent results on arc routing problems: an annotated bibliography
- Tour splitting algorithms for vehicle routing problems
- A hybrid metaheuristic approach for the capacitated arc routing problem
- Local search heuristics for sectoring routing in a household waste collection context
- GRASP with evolutionary path-relinking for the capacitated arc routing problem
- Constructive heuristics for the mixed capacity arc routing problem under time restrictions with intermediate facilities
- Approximation schemes for Euclidean vehicle routing problems with time windows
- A decade of capacitated arc routing
- Algorithms for Large Directed Capacitated Arc Routing Problem Instances
- scientific article; zbMATH DE number 1975105 (Why is no real title available?)
- Crossover iterated local search for SDCARP
- A multi-population cooperative coevolutionary algorithm for multi-objective capacitated arc routing problem
- New notation and classification scheme for vehicle routing problems
- A variable neighborhood descent algorithm for a real waste collection problem with mobile depots
- Combinatorial optimization and green logistics
- Combinatorial optimization and green logistics
- Memetic algorithm based on extension step and statistical filtering for large-scale capacitated arc routing problems
- A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem
- Efficient frameworks for greedy split and new depth first search split procedures for routing problems
- Fast upper and lower bounds for a large‐scale real‐world arc routing problem
- Solving the large-scale min-max k-rural postman problem for snow plowing
- PTAS for Euclidean travelling salesman problem with soft time windows
- Divide-and-conquer initialization and mutation operators for the large-scale mixed capacitated arc routing problem
- An extension of the relaxation algorithm for solving a special case of capacitated 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
- Ant colony optimization for the arc routing problem with intermediate facilities under capacity and length restrictions
- A memetic algorithm for the team orienteering problem
- A GRASP\(\times \)ELS approach for the capacitated location-routing problem
- A metaheuristic for the min-max windy rural postman problem with K vehicles
This page was built for publication: Competitive memetic algorithms for arc routing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q702720)
