Communications - Scientific Letters of the University of Zilina 2007, 9(4):66-69 | DOI: 10.26552/com.C.2007.4.66-69
A Dynamic Messenger Problem
- 1 Department of Econometrics, University of Economics Prague, Czech Republi
Messenger services provide customers to deliver their package from a specific origin to a specific destination. Real situations require the fast messenger's reaction to the on-line customer's request. While it is not possible to change the planned route in static distribution problems, a dynamic version enables a dispatcher the integration of a new request to existing route for optimization. The mathematical models proposed in the paper are based on the Miller-Tucker-Zemlin's formulation of Traveling Salesman Problem. Because of NP hardness of the problem it is impossible for most real problems to find the optimal solution in acceptable time. Heuristic algorithms represent the important alternative to solving real dynamic problems. Basic formulation of the messenger problem can be extended to problems with time windows. Limited capacity of the vehicle and multiple vehicles can be also considered.
Keywords: no keywords
Published: December 31, 2007 Show citation
References
- CORDEAU, J.-F.: A Branch-and-Cut Algorithm for the Dial-a-Ride Problem, Operations Research 54, 2006, pp. 573-586.
Go to original source... - FABRY, J.: Dynamic Vehicle Routing Problems (in Czech), Dissertation thesis, VSE-FIS, Praha 2006, p. 141.
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.