Category: <span>Additions3</span>

Synchronizing train, aircraft, shuttle, and passenger flows in intermodal timetabling: A time–space network-based formulation and a decomposition algorithm using Alternating Direction method of multipliers

© 2023 Elsevier LtdThe design of synchronized services is of great significance to the development of intermodal transportation. In the planning of Air and High-Speed Railway (HSR) integration services (AHIS), the operators aim to synchronize flight and train schedules and …

A branch-cut-and-price algorithm for the time-dependent electric vehicle routing problem with time windows

© 2023 Elsevier B.V.The adoption of electric vehicles (EVs) within last-mile deliveries is considered one of the key transformations towards more sustainable logistics. The inclusion of EVs introduces new operational constraints to the models such as a restricted driving range …

A fishing route optimization decision support system: The case of the tuna purse seiner

© 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 …

A MILP model and heuristic method for the time-dependent electric vehicle routing and scheduling problem with time windows

© 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, …

Modeling and Solving the Time-Dependent in-Building Delivery Problem in Last-Mile Logistics

© 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 …

A Deep Reinforcement Learning-Based Adaptive Search for Solving Time-Dependent Green Vehicle Routing Problem

© 2013 IEEE.The time-dependent green vehicle routing problem with time windows is a further deepening of the research on vehicle routing problems with time windows. Its simultaneous consideration of vehicle transportation time, carbon emissions, and customer satisfaction under time-dependent variables …

Hyper-heuristic algorithm for traffic flow-based vehicle routing problem with simultaneous delivery and pickup

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 …

A branch-and-price-and-cut algorithm for time-dependent pollution routing problem

© 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 …

A bi-objective time-dependent vehicle routing problem with delivery failure probabilities

© 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 …

Iterated Maximum Large Neighborhood Search for the Traveling Salesman Problem with Time Windows and its Time-dependent Version

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 …

x
This site uses cookies to make navigation simple and efficient. By continuing you declare that you want to automatically accept the privacy policy. More. Close