VEHICLE ROUTING PROBLEM WITH TIME WINDOWS
Keywords:
transportation problem, vehicle routing problem, time windowsAbstract
This paper is focus on solve the Vehicle Routing Problem with Time Windows. The each customer determine the number of requirements and the time of visit of vehicle in this contribution. The mathematical model for solve this problem was published by prof. RNDr. Jaroslav Janacek, CSc. and there is used in this contribution. The real problem of distribution of beer was solving through this mathematical model.
Downloads
Download data is not yet available.
References
(1) JANÁČEK, J. Optimalizace na dopravních sítích. Žilina: Žilinská univerzita v Žilině,
2003. 248 s. ISBN 80-8070-031-1.
(2) BODIN, L., GOLDEN, B., ASSAD, A. Routing and scheduling of vehicles and crews –
the state of art. Comput. Ops. Res., Vol. 10, No 2, 1983, s. 63 – 221.
(3) DESROCHERS, M., DESROSIERS, J., SOLOMON, M. A New Optimization Algorithm
for the Vehicle Routing Problem with Time Windows. Operations Research, Vol. 40, No 2,
March-April 1992, s. 342-354.
(4) XPRESS-MP Manual “Getting Started”. Dash Associates, Blisworth, UK, 2005, p. 105.
(5) XPRESS-Mosel “User guide”. Dash Associates, Blisworth, 2005, UK, p. 99.
2003. 248 s. ISBN 80-8070-031-1.
(2) BODIN, L., GOLDEN, B., ASSAD, A. Routing and scheduling of vehicles and crews –
the state of art. Comput. Ops. Res., Vol. 10, No 2, 1983, s. 63 – 221.
(3) DESROCHERS, M., DESROSIERS, J., SOLOMON, M. A New Optimization Algorithm
for the Vehicle Routing Problem with Time Windows. Operations Research, Vol. 40, No 2,
March-April 1992, s. 342-354.
(4) XPRESS-MP Manual “Getting Started”. Dash Associates, Blisworth, UK, 2005, p. 105.
(5) XPRESS-Mosel “User guide”. Dash Associates, Blisworth, 2005, UK, p. 99.
Downloads
Published
2011-11-11
How to Cite
Kozel, P. (2011). VEHICLE ROUTING PROBLEM WITH TIME WINDOWS. Perner’s Contacts, 6(3), 160–167. Retrieved from https://pernerscontacts.upce.cz/index.php/perner/article/view/861
Issue
Section
Articles
License
Copyright (c) 2020 Petr Kozel
This work is licensed under a Creative Commons Attribution 4.0 International License.
