Research Output

Improving vehicle routing using a customer waiting time colony.

  In the vehicle routing problem with time windows (VRPTW), there are two main objectives. The primary objective is to reduce the number of vehicles, the secondary one is to minimise the total distance travelled by all vehicles. This paper describes some experiments with multiple ant colony systems, in particular a Triple Ant Colony System TACS, in which one colony (VMIN) tries to minimise the number of vehicles, one (DMIN) tries to minimise the total distance and a third (CWTsMAX) tries to maximise customer waiting time. The inclusion of this third colony improves the results very significantly, compared to not using it and to a range of other options. Experiments are conducted on Solomons 56 benchmark problems. The results are comparable to those obtained by other state-of-the-art approaches.

  • Date:

    29 February 2004

  • Publication Status:

    Published

  • Publisher

    Springer-Verlag

  • DOI:

    10.1007/978-3-540-24652-7_19

  • Library of Congress:

    QA75 Electronic computers. Computer science

Citation

Sa'adah, S., Ross, P. & Paechter, B. (2004). Improving vehicle routing using a customer waiting time colony. In Gottlieb, J. & Raidl, G. (Eds.). Evolutionary Computation in Combinatorial Optimization, 188-198. doi:10.1007/978-3-540-24652-7_19. ISBN 978-3-540-21367-3

Authors

Keywords

vehicle routing; time windows; triple ant colony systems; customer waiting time;

Available Documents