© 2021 Elsevier LtdThis paper studies the Aquaculture Service Vessel Routing Problem (ASVRP), which is an important planning problem arising in sea-based fish farming. In the ASVRP, there is a set of fish farms located in the sea, where each …
Traveling Salesman Problem (TSP) is a well-known NP-hard combinatorial optimization problem. Recently, many researchers have used deep reinforcement learning to solve it. However, traffic factors are rarely considered in their works, in which the traveling time between customer locations is …
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 …
© 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 …
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 LtdElectric vehicles are environmental transportation modes that are widely applied in green logistics systems. To guarantee the energy efficiency, the impacts of customer service modes and recharging strategies need to be integrated into the optimization of electric …
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 …
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 …
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 …
A new mixed-integer nonlinear programming model is presented for the time-dependent vehicle routing problem with time windows and intelligent travel times. The aim is to minimize fixed and variable costs, with the assumption that the travel time between any two …