D-Ants: Savings Based Ants divide and conquer the vehicle routing problem.
From MaRDI portal
Publication:1427099
DOI10.1016/S0305-0548(03)00014-5zbMath1061.90024OpenAlexW2029970827WikidataQ59389804 ScholiaQ59389804MaRDI QIDQ1427099
Marc Reimann, Richard F. Hartl, Karl F. Doerner
Publication date: 14 March 2004
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0305-0548(03)00014-5
Approximation methods and heuristics in mathematical programming (90C59) Traffic problems in operations research (90B20) Decomposition methods (49M27)
Related Items (49)
A hybrid genetic algorithm for the vehicle routing problem with three-dimensional loading constraints ⋮ An ant colony system (ACS) for vehicle routing problem with simultaneous delivery and pickup ⋮ Evaluating two new heuristics for constructing customer clusters in a VRPTW with multiple service workers ⋮ Vehicle routing problems with time windows and multiple service workers: a systematic comparison between ACO and GRASP ⋮ Smart stacking for import containers using customer information at automated container terminals ⋮ Multi-ant colony system (MACS) for a vehicle routing problem with backhauls ⋮ An ant colony system for responsive dynamic vehicle routing ⋮ Heuristic approaches for solving transit vehicle scheduling problem with route and fueling time constraints ⋮ A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows ⋮ A general heuristic for vehicle routing problems ⋮ An efficient variable neighborhood search heuristic for very large scale vehicle routing problems ⋮ Active-guided evolution strategies for large-scale capacitated vehicle routing problems ⋮ DVRP: a hard dynamic combinatorial optimisation problem tackled by an evolutionary hyper-heuristic ⋮ A hybrid ant colony optimization-variable neighborhood descent approach for the cumulative capacitated vehicle routing problem ⋮ The close-open mixed vehicle routing problem ⋮ Routing problems with loading constraints ⋮ Decomposition techniques with mixed integer programming and heuristics for home healthcare planning ⋮ Optimised crossover genetic algorithm for capacitated vehicle routing problem ⋮ An Investigation of Heuristic Decomposition to Tackle Workforce Scheduling and Routing with Time-Dependent Activities Constraints ⋮ Deriving Convergence of Vehicle Routing Problems using a Fictitious Play Approach ⋮ Route stability in vehicle routing decisions: a bi-objective approach using metaheuristics ⋮ Synchronized routing of seasonal products through a production/distribution network ⋮ Heuristic algorithms for the single allocation \(p\)-hub center problem with routing considerations ⋮ Ant colony optimization with clustering for solving the dynamic location routing problem ⋮ Heuristics for the lexicographic Max-ordering vehicle routing problem ⋮ A new bilevel formulation for the vehicle routing problem and a solution method using a genetic algorithm ⋮ Parallel Solution Methods for Vehicle Routing Problems ⋮ An Integer Linear Programming Local Search for Capacitated Vehicle Routing Problems ⋮ EVE-OPT: a hybrid algorithm for the capacitated vehicle routing problem ⋮ Ant colony optimization for the two-dimensional loading vehicle routing problem ⋮ Exact and heuristic algorithms for the vehicle routing problem with multiple interdependent time windows ⋮ A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery ⋮ Honey bees mating optimization algorithm for large scale vehicle routing problems ⋮ Active guided evolution strategies for large-scale vehicle routing problems with time windows ⋮ Path relinking for the vehicle routing problem ⋮ Solving the vehicle routing problem with adaptive memory programming methodology ⋮ Ant colony optimization for continuous domains ⋮ Edge assembly-based memetic algorithm for the capacitated vehicle routing problem ⋮ A metaheuristic algorithm and structured analysis for the Line-haul Feeder vehicle routing problem with time windows ⋮ An interactive simulation and analysis software for solving TSP using ant colony optimization algorithms ⋮ Stochastic single vehicle routing with a predefined customer sequence and multiple depot returns ⋮ A TWO-STATE ANT COLONY ALGORITHM FOR SOLVING THE MINIMUM GRAPH BISECTION PROBLEM ⋮ Metaheuristics for vehicle routing problems with three-dimensional loading constraints ⋮ A hybrid optimization approach for multi-level capacitated lot-sizing problems ⋮ Ant colony optimization theory: a survey ⋮ Savings based ant colony optimization for the capacitated minimum spanning tree problem ⋮ A new ILP-based refinement heuristic for vehicle routing problems ⋮ A bio-inspired distributed algorithm to improve scheduling performance of multi-broker grids ⋮ Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Models, relaxations and exact approaches for the capacitated vehicle routing problem
- ACO algorithms with guaranteed convergence to the optimal solution
- A new rank based version of the ant system. -- A computational study
- An improved ant system algorithm for the vehicle routing problem
- A simple and effective evolutionary algorithm for the vehicle routing problem
- Probabilistic diversification and intensification in local search for vehicle routing
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
- A Subpath Ejection Method for the Vehicle Routing Problem
- The Granular Tabu Search and Its Application to the Vehicle-Routing Problem
- Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
- Parallel iterative search methods for vehicle routing problems
- A guide to vehicle routing heuristics
- A Tabu Search Heuristic for the Vehicle Routing Problem
- A Heuristic Algorithm for the Vehicle-Dispatch Problem
- A Method for Solving Traveling-Salesman Problems
This page was built for publication: D-Ants: Savings Based Ants divide and conquer the vehicle routing problem.
