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.
Highlights
Vehicle route planning is an inherent part of the decision making process of the all subjects providing a transport network service
We have introduced the mathematical model with constraints corresponding to the requirements of a real traffic
The constrains are the existence of a mixed transport network that contains one-way roads and the existence of a wider transport network, in which the only selected edges are used with possibility of effective passages
Summary
Vehicle route planning is an inherent part of the decision making process of the all subjects providing a transport network service (such as cleaning and maintenance of roads, municipal waste collection, separated municipal waste collection etc.). The disadvantage of this approach is the necessity to design some substitute transport network, in which the duplicate edges can be identified by using the minimum matching principle. In this respect, we consider more appropriate procedure for identifying duplicate edges by determining the number of passages through each edge of the transport network [5]. Information in the matrix of distances lij corresponding with the default network N is included in the mathematical model This matrix contains only values corresponding to the vertices that are connected by the edge.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Communications - Scientific letters of the University of Zilina
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
