D-Ants: Savings Based Ants divide and conquer the vehicle routing problem

By Marc Reimann, Karl F. Doerner, Richard F. Hartl. Computers & Operations Research, 2004

434 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computer Vision and Pattern Recognition, Industrial and Manufacturing Engineering

View Paper: https://www.semanticscholar.org/paper/13ee0e1e4581c52d094196b4c446c835d2a727e4

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

In Computer Vision and Pattern Recognition

In Industrial and Manufacturing Engineering

Citations in the corpus

New Heuristics for the Vehicle Routing Problem (2005, methodology): “Mester and Br¨aysy (2004) Mester and Br¨aysy (2004) Reimann et al. (2004)”
What you should know about the vehicle routing problem (2007, background): “[49] is probably the best example of ant colony optimization applied to the VRP.”
Heuristics for multi-attribute vehicle routing problems: A survey and synthesis (2013, methodology): “Furthermore, exploiting the spatial decomposition of Reimann et al. (2004) in a parallel context leads to increased speed-ups.”
A Tabu Search Algorithm for a Routing and Container Loading Problem (2006, methodology): “Among very recent papers on the CVRP we mention an ant colony optimization heuristic ( Reimann, Doerner, and Hartl 2004 ) and an exact algorithm obtained by combining branch-and-cut and branch-and-price (Fukasawa et al. 2004).”
Ant colony optimization (2006, neutral): “2004 [49] SEQUENTIAL ORDERING GAMBARDELLA & DORIGO 2000 [50] ASSIGNMENT QUADRATIC ASSIGNMENT STÜTZLE & HOOS 2000 [15] MANIEZZO 1999 [18] COURSE TIMETABLING SOCHA ET AL.”
Ant colony optimization: Introduction and recent trends (2005, background): “Vehicle routing problems Gambardella, Taillard, and Agazzi [42] Reimann, Doerner, and Hartl [82]”
Ant colony optimization theory: A survey (2005, background): “5 Examples are the applications to assignment problems [14,47,46,63,66], scheduling problems [11,17,27,51,64], and vehicle routing problems [29,59].”
An artificial bee colony algorithm for the capacitated vehicle routing problem (2011, methodology): “…and Barkaoui, 2003; Prins, 2004; Mester and Bräysy, 2007; Prins, 2009; Nagata and Bräysy, 2009), ant colony optimization (Bullnheimer et al., 1999; Reimann et al., 2004; Yu et al., 2009), simulated annealing (Osman, 1993; Lin et al., 2009), tabu search (Taillard, 1993; Gendreau et al., 1994; Rego…”
Routing problems with loading constraints (2010, methodology): “The algorithm is based on the ACO approach developed by Reimann, Doerner and Hartl [80] for the CVRP, modified and extended through the addition of loading techniques.”
A new mathematical modeling and a genetic algorithm search for milk run problem (an auto industry supply chain case study) (2009, background): “Reimann et al. [ 8 ] propose an Ant colony to find a near optimal solution for vehicle routing problem.”