Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/2566| Title: | New heuristics for the fleet size and mix vehicle routing problem with time windows | Authors: | Dullaert, W JANSSENS, Gerrit K. Sorensen, K Vernimmen, B |
Issue Date: | 2002 | Publisher: | PALGRAVE PUBLISHERS LTD | Source: | JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 53(11). p. 1232-1238 | Abstract: | In the Fleet Size and Mix Vehicle Routing Problem with Time Windows (FSMVRPTW) customers need to be serviced in their time windows at minimal costs by a heterogeneous fleet. In this paper new heuristics for the FSMVRPTW are developed. The performance of the heuristics is shown to be significantly higher than that of any previous heuristic approach and therefore likely to achieve better solutions to practical routing problems. | Notes: | Univ Antwerp, Ufsia Ruca Fac Appl Econ, B-2000 Antwerp, Belgium. Limburgs Univ Centrum, Diepenbeek, Belgium.Dullaert, W, Univ Antwerp, Ufsia Ruca Fac Appl Econ, Prinsstr 13, B-2000 Antwerp, Belgium. | Keywords: | vehicle routing; heuristics; time windows; heterogeneous fleet | Document URI: | http://hdl.handle.net/1942/2566 | ISSN: | 0160-5682 | e-ISSN: | 1476-9360 | DOI: | 10.1057/palgrave.jors.2601422 | ISI #: | 000178867800007 | Category: | A1 | Type: | Journal Contribution | Validations: | ecoom 2003 |
| Appears in Collections: | Research publications |
Show full item record
SCOPUSTM
Citations
41
checked on Sep 5, 2020
WEB OF SCIENCETM
Citations
40
checked on May 18, 2024
Page view(s)
56
checked on May 30, 2023
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.