Category: <span>Papers</span>

Shortest Fuzzy Hamiltonian Cycle on Transportation Network Using Minimum Vertex Degree and Time-dependent Dijkstra’s Algorithm

© 2021 The Authors.Determining the shortest travel time on transportation is affected by many logistics parameters such as cost, quality, speed and satisfaction. This study proposes a new hybrid time-dependent Dijkstra’s and minimum vertex degree algorithm on a spherical bipolar …

Properties and Bounds for the Single-vehicle Capacitated Routing Problem with Time-dependent Travel Times and Multiple Trips:

This paper deals with a problem where the same vehicle performs several routes to serve a set of customers and arc traversal times vary along the planning horizon. The relationship with its time-invariant counterpart is investigated and a procedure to …

Heuristic Route Adjustment for Balanced Working Time in Urban Logistics with Driver Experience and Time-Dependent Traffic Information

This article proposes a method to reduce working time violations of a real-world courier service in the urban logistics with time-dependent traffic information. The challenge is to reduce working time violation without creating significant changes to the urban logistics plan …

On the impact of spatio-temporal granularity of traffic conditions on the quality of pickup and delivery optimal tours

© 2020 Elsevier LtdOptimizing the duration of delivery tours is a crucial issue in urban logistics. In most cases, travel times between locations are considered as constant for the whole optimization horizon. Making these travel times time-dependent is particularly relevant …

Time-Dependent Electric Vehicle Routing Problem with Time Windows and Path Flexibility

With energy and environmental issues becoming increasingly prominent, electric vehicles (EVs) have become the important transportation means in the logistics distribution. In the real-world urban road network, there often exist multiple paths between any two locations (depot, customer, and charging …

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