Solution of real-world postman problems
The paper presents the results of a study performed by the Deutsche post endowed chair of optimization of distribution networks in collaboration with Deutsche Post World Net with the aim of improving the planning of letter mail delivery. Modelling and solution methods for real-world postman problems are presented which extend one of the most general postman problems studied in the literature, the windy rural postman problem, with regard to several aspects. The discussed extensions include turn and street crossing restrictions, cluster constraints, the option to have alternative service modes (including 'zigzag deliveries'), and the use of public transport to reach the postal district. The solution method is based on a transformation to the asymmetric TSP and uses non-standard neighbourhood search techniques. Extensive computational experiments show that the solution method clearly and consistently outperforms standard TSP heuristics on real-world instances.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Hansen, Pierre & Mladenovic, Nenad, 2001. "Variable neighborhood search: Principles and applications," European Journal of Operational Research, Elsevier, vol. 130(3), pages 449-467, May.
- Glover, Fred & Gutin, Gregory & Yeo, Anders & Zverovich, Alexey, 2001. "Construction heuristics for the asymmetric TSP," European Journal of Operational Research, Elsevier, vol. 129(3), pages 555-568, March.
- Edward Minieka, 1979. "The Chinese Postman Problem for Mixed Networks," Management Science, INFORMS, vol. 25(7), pages 643-648, July.
- Corberan, A. & Marti, R. & Sanchis, J. M., 2002. "A GRASP heuristic for the mixed Chinese postman problem," European Journal of Operational Research, Elsevier, vol. 142(1), pages 70-80, October.
When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:190:y:2008:i:1:p:52-67. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Dana Niculescu)
If references are entirely missing, you can add them using this form.