Loading...
Please wait, while we are loading the content...
Similar Documents
An improved route minimization algorithm for the vehicle routing problem with time Windows
| Content Provider | Semantic Scholar |
|---|---|
| Author | Blocho, Miroslaw Czech, Zbigniew J. |
| Copyright Year | 2011 |
| Abstract | A route minimization algorithm for the vehicle routing problem with time windows is presented. It was elaborated as an improvement of the algorithm proposed by Nagata and Braysy (A powerful route minimization heuristic for the vehicle routing problem with time windows, Operations Research Letters 27, 2009, 333-338). By making use of the improved algorithm the two new-best solutions for Gehring and Homberger’s (GH) benchmarks were found. The experiments showed that the algorithm constructs the world-best solutions with the minimum route numbers for the GH tests in a short time. |
| Starting Page | 5 |
| Ending Page | 19 |
| Page Count | 15 |
| File Format | PDF HTM / HTML |
| DOI | 10.21936/si2011_v32.n3B.218 |
| Volume Number | 32 |
| Alternate Webpage(s) | http://studiainformatica.polsl.pl/index.php/SI/article/download/218/215 |
| Alternate Webpage(s) | https://doi.org/10.21936/si2011_v32.n3B.218 |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |