© 2013 IEEE.This article introduces, models, and solves the time-dependent in-building delivery problem in last-mile logistics. It determines efficient travel sequences for a worker (e.g., delivery person, deliveryman, mailman, agent) who delivers goods or provides services directly to customers located …
© 2023 Elsevier LtdAs an emerging and sustainable technology, electric vehicles (EVs) are becoming increasingly popular in the transportation system. However, they still have limitations in terms of energy capacity and high consumption. By implementing flexible scheduling for EV routings, …
© 2023 The Author(s)Fisheries face challenges in improving efficiency and reducing their emission footprint and operating costs. Decision support systems offer an opportunity to tackle such challenges. This study focuses on the dynamic fishing routing problem (DFRP) of a tuna …
Abstract To address the realistic problem of seriously reducing distribution efficiency and increasing distribution cost caused by road traffic congestion, this paper constructs a time-dependent speed describing vehicle travel speed and road traffic flow by simulating the change of urban …
© 2023 Elsevier LtdThis work presents a bi-objective time-dependent vehicle routing problem with delivery failure probabilities (TDVRPDFP). Two objectives are jointly minimized: operational costs and delivery failure rates. Both travel times and costs, as well as the probabilities of delivery …
© 2023 Elsevier LtdThe time-dependent pollution routing problem (TDPRP) extends the pollution routing problem (PRP) cause it captures traffic congestion at peak periods in urban transportation. It concerns planning a fleet of homogeneous vehicles to serve all customers, jointly deciding …
This article introduces a new algorithm for finding feasible or makespan-optimal solutions of Traveling Salesman Problems with Time Windows (TSPTWs) and Time-Dependent TSPTWs (TDTSPTWs). The algorithm starts from a sequence of visits of the customers involved in the problem, uses …
One of the standard approaches for solving discrete optimization problems which include the aspect of time, such as the traveling salesman problem with time windows or the shortest path problem with time windows is to derive a so-called time-indexed formulation. …
This paper considers an extension of classical distribution problems and introduces the time-dependent fleet size and mix multi-depot vehicle routing problem. This important class of problems finds applications in urban logistics and service design. The solution to this problem impacts …
Motivated by rising concerns regarding global warming and traffic congestion effects, we study the time-dependent green vehicle routing problem with time windows (TDGVRPTW), aiming to minimize carbon emissions. The TDGVRPTW is a variant of the time-dependent vehicle routing problem (TDVRP) …