SavingsAnts for the Vehicle Routing Problem

Authors:
Karl Doerner;Manfred Gronalt;Richard F. Hartl;Marc Reimann;Christine Strauss;Michael Stummer
Affiliations:
-;-;-;-;-;-
Venue:
Proceedings of the Applications of Evolutionary Computing on EvoWorkshops 2002: EvoCOP, EvoIASP, EvoSTIM/EvoPLAN
Year:
2002

Citing 7
Cited 12

Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem

Annals of Operations Research - Special issue on Tabu search
A tabu search heuristic for the vehicle routing problem

Management Science
ACO algorithms for the quadratic assignment problem

New ideas in optimization
MACS-VRPTW: a multiple ant colony system for vehicle routing problems with time windows

New ideas in optimization
A Graph-based Ant system and its convergence

Future Generation Computer Systems
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Ant colony system: a cooperative learning approach to the traveling salesman problem

IEEE Transactions on Evolutionary Computation

D-Ants: savings based ants divide and conquer the vehicle routing problem

Computers and Operations Research
Two composite methods for soft drink distribution problem

Advances in Engineering Software
Particle swarm optimization and two solution representations for solving the capacitated vehicle routing problem

Computers and Industrial Engineering
SR-1: a simulation-based algorithm for the capacitated vehicle routing problem

Proceedings of the 40th Conference on Winter Simulation
Evolutionary Freight Transportation Planning

EvoWorkshops '09 Proceedings of the EvoWorkshops 2009 on Applications of Evolutionary Computing: EvoCOMNET, EvoENVIRONMENT, EvoFIN, EvoGAMES, EvoHOT, EvoIASP, EvoINTERACTION, EvoMUSART, EvoNUM, EvoSTOC, EvoTRANSLOG
An ant colony system (ACS) for vehicle routing problem with simultaneous delivery and pickup

Computers and Operations Research
Ant colony optimization for the arc routing problem with intermediate facilities under capacity and length restrictions

Journal of Heuristics
A population-based local search for solving a bi-objective vehicle routing problem

EvoCOP'07 Proceedings of the 7th European conference on Evolutionary computation in combinatorial optimization
Solving a bi-objective vehicle routing problem by Pareto-ant colony optimization

SLS'07 Proceedings of the 2007 international conference on Engineering stochastic local search algorithms: designing, implementing and analyzing effective heuristics
A new saving-based ant algorithm for the Vehicle Routing Problem with Simultaneous Pickup and Delivery

Expert Systems with Applications: An International Journal
Solving a bi-objective flowshop scheduling problem by pareto-ant colony optimization

ANTS'06 Proceedings of the 5th international conference on Ant Colony Optimization and Swarm Intelligence
Metaheuristic Approaches for Vehicle Routing Problems

International Journal of Information Systems and Supply Chain Management

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we propose a hybrid approach for solving vehicle routing problems. The main idea is to combine an Ant System (AS) with a problem specific constructive heuristic, namely the well known Savings algorithm. This differs from previous approaches, where the subordinate heuristic was the Nearest Neighbor algorithm initially proposed for the TSP. We compare our approach with some other classic, powerful meta-heuristics and showthat our results are competitive.