(Smart CPS) Multiobjective dynamic routing with predefined stops for automated vehicles. Issue 4 (4th May 2019)

• Record Type: Journal Article
• Authors: Horváth, Márton Tamás; Tettamanti, Tamás; Varga, István
• Is Part Of: International journal of computer integrated manufacturing. Volume 32:Issue 4/5(2019)
• Page Start: 396
• Page End: 405
• Publication Date: 2019-05-04
• Subjects: Multiobjective routing -- dynamic routing -- multiple edge-cost -- public transport; Computer integrated manufacturing systems -- Periodicals; 670.427
• DOI: 10.1080/0951192X.2018.1535197
• Languages: English
• ISSNs: 0951-192X

Abstract

ABSTRACT: Nowadays transportation represents an important field for CPS applications due to the rapid development of highly automated or autonomous vehicles, e.g. warehouse vehicles, airport people movers, public transport, etc. These vehicles are usually designed to circulate on fixed routes independently of the actual state of the network in order to fulfil a given criterion, such as traveling on the shortest path or including scheduled stops. This paper introduces a routing approach that allows automated vehicles to travel on different paths between given points, minimising the generalised cost of the route. Between fixed points, which can be either different storage points in a warehouse or simply public transport stops, possible routes are modelled as a continuously updated weighted directed graph. The weights represent relevant parameters of links, collected from surrounding sensors and monitoring systems of the network. Route optimisation is done by Yen's algorithm depending on the timetable: if the vehicle will reach the next stop on time, the alternative with the lowest generalised cost is chosen; else the fastest route is followed. The method is introduced specifically via the problem of traffic congestion on public transport paths, but can be generalised, e.g. any transport system within factories or warehouses.