Time-dependent routing problems: A review
Time-dependent routing amounts to design “best” routes in a graph in which arc traversal
times may vary over the planning horizon. In the last decade, a number of technological …
times may vary over the planning horizon. In the last decade, a number of technological …
The role of operational research in green freight transportation
Recent years have witnessed an increased awareness of the negative external impacts of
freight transportation. The field of Operational Research (OR) has, particularly in the recent …
freight transportation. The field of Operational Research (OR) has, particularly in the recent …
Vehicle routing to minimize time-dependent emissions in urban areas
This paper focuses on the problem of minimizing CO 2 emissions in the routing of vehicles in
urban areas. While many authors have realized the importance of speed in minimizing …
urban areas. While many authors have realized the importance of speed in minimizing …
Optimizing for total costs in vehicle routing in urban areas
Minimizing cost is one of the most important objectives for logistics service providers, and it
is not clear how an emphasis on minimizing emissions impacts costs. Most methodologies …
is not clear how an emphasis on minimizing emissions impacts costs. Most methodologies …
Vehicle routing problems with road‐network information: State of the art
Vehicle routing problems have drawn researchers' attention for more than 50 years. Most
approaches found in the literature address these problems using the so‐called customer …
approaches found in the literature address these problems using the so‐called customer …
Optimal route algorithm considering traffic light and energy consumption
Vehicle speed trajectory and traffic signals significantly impact vehicle's fuel consumption
and travel time in the urban road network. In this paper, we proposed an optimal vehicle …
and travel time in the urban road network. In this paper, we proposed an optimal vehicle …
CostMAP: an open-source software package for develo** cost surfaces using a multi-scale search kernel
Cost surfaces are a crucial aspect of route optimization and least cost path (LCP)
calculations and are used in awide range of disciplines including computer science …
calculations and are used in awide range of disciplines including computer science …
Optimization of cold chain distribution path of fresh agricultural products under carbon tax mechanism: A case study in China
T Ning, L An, X Duan - Journal of Intelligent & Fuzzy Systems, 2021 - content.iospress.com
According to the problem of large amount of carbon emissions during the cold chain
distribution process, a cold chain distribution route optimization method for fresh agricultural …
distribution process, a cold chain distribution route optimization method for fresh agricultural …
Minimum cost VRP with time-dependent speed data and congestion charge
L Wen, R Eglese - Computers & Operations Research, 2015 - Elsevier
A heuristic algorithm, called LANCOST, is introduced for vehicle routing and scheduling
problems to minimize the total travel cost, where the total travel cost includes fuel cost, driver …
problems to minimize the total travel cost, where the total travel cost includes fuel cost, driver …
A memetic approach to vehicle routing problem with dynamic requests
The paper presents an effective algorithm for solving Vehicle Routing Problem with Dynamic
Requests based on memetic algorithms. The proposed method is applied to a widely-used …
Requests based on memetic algorithms. The proposed method is applied to a widely-used …