This paper is motivated by a non-emergency ambulance transportation service provider that picks up and drops off patients while considering both the time window for medical appointments and the maximum ride-time constraint for each patient. Varying travel times based on …
Aiming at the time-dependent green vehicle routing problem with fuzzy demand, this paper comprehensively considers the dispatch costs, time window penalty costs, fuel costs, and the effects of vehicle travel speed, road gradient, and vehicle load on fuel consumption, a …
Motivated by some practical applications of post-disaster supply delivery, we study a multi-trip time-dependent vehicle routing problem with split delivery (MTTDVRP-SD) with an unmanned aerial vehicle (UAV). This is a variant of the VRP that allows the UAV to travel …
Recently Green Location-Routing Problem (GLRP) has been considered by many researchers. The GLRP includes location for depots and routing the vehicles simultaneously by considering environmental aspects. In this work an extension of GLRP in the presence of traffic congestion and …
In this paper we study the problem of scheduling a given sequence of activities where each activity consumes a resource with limited availability. Activity durations as well as resource consumptions are assumed to be time-dependent. Because of the interaction of …
This paper deals with a multi-period extension of the p-center problem, in which arc traversal times vary over time, and facilities are mobile units that can be relocated multiple times during the planning horizon. The problem arises in several applications, …
© 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 …
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 …
© 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 …