© 2021 Elsevier LtdIn this paper we study a property of time-dependent graphs, dubbed “path ranking invariance”. Broadly speaking, a time-dependent graph is “path ranking invariant” if the ordering of its paths (w.r.t. travel time) is independent of the start …
Geographic information systems, global positioning systems, traffic flow sensors and cellular phones are sources of real-time traffic data in road networks. However, many vehicle routing algorithms do not account for this real-time information. In this paper, we consider the problem …
Abstract The aim of the bi-objective multimodal car-sharing problem (BiO-MMCP) is to determine the optimal mode of transport assignment for trips and to schedule the routes of available cars and users whilst minimizing cost and maximizing user satisfaction. We investigate …
The Cash-in-Transit (CIT) deals with the transportation of banknotes, coins, and other valuable items. Due to the high-value density of these products, incorporating security strategies in the carrier operations is crucial. This paper proposes new CIT models involving deterministic and …
© 2021 Elsevier B.V.In this paper, we consider a variant of the Inventory Routing Problem (IRP), the Time-Dependent IRP (TD-IRP). The TD-IRP extends the routing component of the IRP by making the travelling time between two locations no longer constant …
Bus timetables play an important role in improving the level of service and reducing operations costs of a bus transit system. Without dedicated bus lanes, bus travel times, which are important input data for bus timetabling, are usually time-dependent due …
Stochastic shortest path (SSP) computations are often performed under very strict time constraints, so computational efficiency is critical. A major determinant for the CPU time is the number of scenarios used. We demonstrate that by carefully picking the right scenario …
The Static and Stochastic Vehicle Routing Problem with Random Requests (SS-VRP-R) describes realistic operational contexts in which a fleet of vehicles has to serve customer requests appearing dynamically. Based on a probabilistic knowledge about the appearance of requests, the SS-VRP-R …
This paper addresses the transportation of valuable goods in which security carriers are interested to optimize the operating costs and the vehicle routes’ security. In real operations, route planning and scheduling are normally performed manually based on individual experience. Hereupon, …
In this study, we investigate a routing problem in urban transportation which considers time-dependent travel time, multiple trips per vehicle, and loading time at the depot simultaneously. Its objective is to minimize the total travel distance while satisfying the time …