Loading...
Please wait, while we are loading the content...
Similar Documents
Route Elimination Heuristic for Vehicle Routing Problem with Time Windows
| Content Provider | Semantic Scholar |
|---|---|
| Author | Csiszár, Sándor |
| Copyright Year | 2005 |
| Abstract | The paper deals with the design of a route elimination (RE) algorithm for the vehicle routing problem with time windows (VRPTW). The problem has two objectives, one of them is the minimal number of routes the other is the minimal cost. To cope with these objectives effectively two-phase solutions are often suggested in the relevant literature. In the first phase the main focus is the route elimination, in the second one it is the cost reduction. The algorithm described here is a part of a complete VRPWT study. The method was developed by studying the graph behaviour during the route elimination. For this purpose a model -called "Magic Bricks" was developed. The computation results on the Solomon problem set show that the developed algorithm is competitive with the best ones. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | https://uni-obuda.hu/journal/Csiszar_4.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
