Communications - Scientific Letters of the University of Zilina 2009, 11(4):38-42 | DOI: 10.26552/com.C.2009.4.38-42

Ant Colony Optimization Method and Split-Delivery Vehicle Routing Problem

Andrej Chu1
1 Faculty of Informatics and Statistics, University of Economics, Czech Republic

This paper deals with a split delivery vehicle routing problem, which is a modification of a vehicle routing problem. It consists in delivery routes optimization in communications network containing initial city of all routes and a given number of places, which is necessary to include in delivery routes, where a customer can be served by more than one vehicle. The objective is to find a set of vehicle routes that serve all the customers and the total distance traveled is minimized. The split delivery vehicle routing problem is NP hard, therefore we present a solution approach by three heuristics, and a metaheuristics called Ant colony optimization (ACO).

Keywords: split delivery vehicle routing problem, integer programming, ant colony optimization, metaheuristics

Published: December 31, 2009  Show citation

ACS AIP APA ASA Harvard Chicago Chicago Notes IEEE ISO690 MLA NLM Turabian Vancouver
Chu, A. (2009). Ant Colony Optimization Method and Split-Delivery Vehicle Routing Problem. Communications - Scientific Letters of the University of Zilina, 11(4), 38-42. doi: 10.26552/com.C.2009.4.38-42
Share...
Download citation
  • BibTeX (.bib)
  • Bookends (.ris)
  • EasyBib (.ris)
  • EndNote (.enw)
  • EndNote 8 (.xml)
  • ISI WoS (.isi)
  • Medlars (.medlars)
  • Mendeley (.ris)
  • MODS (.xml)
  • Papers (.ris)
  • RefWorks (.txt)
  • RefManager (.ris)
  • RIS (.ris)
  • MS Word (.xml)
  • Zotero (.ris)
    • Open full article

    References

    1. BODIN, L., GOLDEN, B.: Classification in Vehicle Routing and Scheduling. Networks, Vol. 11, 1981 Go to original source...
    2. DANTZIG, G.B.; RAMSER, J. H.: The Truck Dispatching Problem. Management Science 6 (1): 80-91, 1959 Go to original source...
    3. DORIGO, M., SCHÜTZLE, T.: Ant Colony Optimization. MIT Press, 2004, ISBN 0-262-04219-3 Go to original source...
    4. DROR, M., TRUDEAU, P.: Split Delivery Routing. Naval Reasearch Logistics, 1990 Go to original source...
    5. EVANS J. R., MINIEKA E.: Optimization Algorithms for Networks and Graphs. Marcel Dekker, Inc., New York, 1992
    6. FABRY, J.: Dynamic Round and Cartage Problems (in Czech), Dissertation thesis. Praha: VSE-FIS, 2006
    7. GUTIN, G., PUNNEN, A. P.: The traveling salesman problem and its variations. Kluver 2002. ISBN 1-4020-0664-0
    8. JANACEK, J.: Mathematical Programming (in Czech), EDIS ZU, Zilina, 1999, ISBN 80-7100-573-8
    9. JANACEK, J.: Optimalization in Transport Networks (in Czech), EDIS ZU, Zilina, 2003, ISBN 80-8070-031-1
    10. PELIKAN, J.: Discreet Models in Operating Research (in Czech), Professional Publishing, 2001, ISBN 80-86419-17-7.

    This is an open access article distributed under the terms of the Creative Commons Attribution 4.0 International License (CC BY 4.0), which permits use, distribution, and reproduction in any medium, provided the original publication is properly cited. No use, distribution or reproduction is permitted which does not comply with these terms.


    Return to the content