Loading...
Please wait, while we are loading the content...
Similar Documents
An Ant Colony heuristic for the Time Dependent Vehicle Routing Problem with Time Windows
| Content Provider | Semantic Scholar |
|---|---|
| Author | Balseiro, Santiago R. Loiseau, Irene Ramonet, J. |
| Copyright Year | 2008 |
| Abstract | This paper presents an Ant Colony heuristic for the Time Dependent Vehicle Routing Problem with Time Windows (TDVRPTW). The TDVRPTW involves finding the best routes for a fleet of vehicles that must deliver goods to a set of customers. Besides, the time window constraints of the customers must be respected and the fact that the travel time between to points depends on the time of departure has to be taken into account. The latter assumption is particularly important in an urban context where the traffic plays a significant role. The heuristic was enhanced through a local search with numerous neighborhood operators and an aggressive insertion heuristic relying on the minimum delay technique. The algorithm developed turned out to be competitive when tested with Solomon’s benchmark instances. Nomenclature n number of clients B big number κ number of available vehicles si service time of node i Ck capacity of vehicle k [ai,bi] time window of node i N {1...n}: clients di demand of node i D0 {1κ... 0}: origin deposits Tm end time of slice m DE {n+1... n+κ}: end deposits G (V, A) directed graph where V is the set of vertices and A the set of arcs. M {1...n}: time intervals ∆(i) forward star, sets of vertices j such that (i, j) ε A ∆(j) backward star, sets of vertices i such that (i, j) ε A |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://itech.com.ar/balseiro/abstract.pdf |
| Alternate Webpage(s) | http://citeseer.ist.psu.edu/viewdoc/download;jsessionid=08D0681AD209EDD01B2E80A454DA40E1?doi=10.1.1.84.462&rep=rep1&type=pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
