Communications - Scientific Letters of the University of Zilina 2018, 20(3):88-92 | DOI: 10.26552/com.C.2018.3.88-92

The Modified Rural Postman Problem in Vehicle Route Optimization

Petr Kozel1, Lucie Orlikova1, Sarka Michalcova1
1 Department of Mathematical Methods in Economics, Faculty of Economics, Technical University of Ostrava, Czech Republic

The submitted paper deals with designing routes of the vehicles, which provide the transport network services. We limit our focus to such tasks, where the priority is the edge service in the transport network and the initial problem is finding an Eulerian path. Regarding to real-life problems, this contribution presents such procedure of solving, which takes into account both the existence of a mixed transport network containing one-way roads and the existence of a wider transport network. In this network, there are only selected edges with possibility of the effective passages. This problem can be solved by the modified Rural Postman Problem assuming the strongly connected network. Linear programming is a suitable tool for designing optimal routes of service vehicles.

Keywords: linear programming; Eulerian path; vehicle routing tasks; the Rural Postman Problem; municipal waste collection

Received: April 27, 2018; Accepted: June 6, 2018; Published: September 30, 2018  Show citation

ACS AIP APA ASA Harvard Chicago Chicago Notes IEEE ISO690 MLA NLM Turabian Vancouver
Kozel, P., Orlikova, L., & Michalcova, S. (2018). The Modified Rural Postman Problem in Vehicle Route Optimization. Communications - Scientific Letters of the University of Zilina, 20(3), 88-92. doi: 10.26552/com.C.2018.3.88-92
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. BORCINOVA, Z., PESKO, S.: New Exact Iterative Method for the Capacitated Vehicle Routing Problem. Communications - Scientific Letters of the University of Zilina, 18(3), 19-21, 2016. Go to original source...
    2. SIMCHI-LEVI, D., CHEN, X., BRAMEL, J.: The Logic of Logistics: Theory, Algorithms and Applications for Logistics Management. Springer, New York, 2014. Go to original source...
    3. SKIENA, S., PEMMARAJU, S.: Computational Discrete Mathematics. Cambridge University Press, New York, 2003. Go to original source...
    4. BONDY, A., MURTY, U.: Graph Theory. Springer, San Francisco, 2008. Go to original source...
    5. PELIKAN, J.: The Discrete Models in Operations Research. Professional Publishing, 2001.
    6. KOZEL, P., MICHALCOVA, S.: The Using of Linear Programming for Solving the Municipal Waste Collection Problem. Proceedings of 32nd International Conference Mathematical Methods in Economics, Czech Republic, 483-486, 2014.
    7. EISELT, H. A., GENDREAU, M., LAPORTE, G.: Arc Routing Problems, Part II: The Rural Postman Problem. Operational Research, 43(3), 399-414, 1995. https://doi.org/10.1287/opre.43.3.399 Go to original source...
    8. KOZEL, P., MICHALCOVA, S.: The Use of Linear Programming to Solve Routing Tasks in Practice. Proceedings of 33rd International Conference Mathematical Methods in Economics, Czech Republic, 395-400, 2015.
    9. GUERET, CH., PRINS, CH., SEVAUX, M., HEIPCKE, S.: Applications of Optimization with Xpress-MP. Blisworth: Dash Associates, United Kingdom, 2002.
    10. XPRESS-Mosel "User guide". Blisworth: Dash Associates, United Kingdom, 2005.
    11. SOBEK, M.: Municipal Waste Collection Routes Optimization. Bachelor thesis (in Czech). VSB - TU Ostrava, Ostrava, 2018.
    12. SPACEK, F.: Mathematical Programming Application in Routing Problems Solving (in Czech). Master thesis. VSB - TU Ostrava, Ostrava, 2018.
    13. FRIEDRICH, V.: Mathematica for non-mathematician (in Czech). VSB - TU Ostrava, Ostrava, 2013.
    14. WOLFRAM, S.: The Mathematica Book. Cambridge University Press, New York, 1999.

    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