Category: <span>Papers</span>

Optimization of single-line bus timetables considering time-dependent travel times: A case study of Beijing, China

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 …

Optimizing electric vehicle routing problems with mixed backhauls and recharging strategies in multi-dimensional representation network

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

On scenario construction for stochastic shortest path problems in real road networks

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 …

Time-dependent stochastic vehicle routing problem with random requests: Application to online police patrol management in Brussels

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 …

A model for the time dependent vehicle routing problem with time windows under traffic conditions with intelligent travel times

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 …

Planning of Garbage Collection Service: An Arc-Routing Problem With Time-Dependent Penalty Cost

© 2000-2011 IEEE.This paper presents an arc-routing problem with time-dependent penalty cost (ARPTPC), which arises from a practical application in garbage collection service. ARPTPC considers the minimization of service cost, traveling cost and penalty cost. While the first two parts …

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