The Modified Rural Postman Problem in Vehicle Route Optimization

https://doi.org/10.26552/com.C.2018.3.88-92

  • Petr Kozel
  • Lucie Orlikova
  • Sarka Michalcova
Keywords: linear programming, Eulerian path, vehicle routing tasks, the Rural Postman Problem, municipal waste collection

Abstract

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.

Author Biographies

Petr Kozel

Department of Mathematical Methods in Economics, Faculty of Economics, Technical University of Ostrava, Czech Republic

Lucie Orlikova

Department of Mathematical Methods in Economics, Faculty of Economics, Technical University of Ostrava, Czech Republic

Sarka Michalcova

Department of Mathematical Methods in Economics, Faculty of Economics, Technical University of Ostrava, Czech Republic

Published
2018-09-30
How to Cite
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. https://doi.org/10.26552/com.C.2018.3.88-92
Section
Management Science and Informatics in Transport