scholarly journals ABM-GIS simulation for urban freight distribution of perishable food

2018 ◽  
Vol 200 ◽  
pp. 00006 ◽  
Author(s):  
Hanane El Raoui ◽  
Mustapha Oudani ◽  
Ahmed El Hilali Alaoui
Keyword(s):  
Traffic Congestion ◽  
Urban Areas ◽  
Scheduling Algorithm ◽  
Time Windows ◽  
Freight Transport ◽  
Time Dependent ◽  
Traffic Condition ◽  
Routing Problem ◽  
Urban Freight ◽  
The Impact

Freight transport is essential to modern urban civilization. No urban area could exist without a powerful freight transport system. However, the distribution of perishable foods in urban areas is seen as a source of problems, due to traffic congestion, time pressures, and environmental impact. In this paper, an Agent-Based Model integrated with Geographic Information Systems (ABM-GIS) is designed for a time-dependent vehicle routing problem with time windows. This simulation model consists of determining the quickest routes to transport fresh products, estimating Vehicle kilometer traveled VKT and vehicle hour traveled VHT where speeds and travel times depend on the time of the day. Based on a case study, analyses of changes on traffic condition were conducted to get an insight into the impact of these changes on cost, service quality represented by the respect of time windows, and carbon emissions. The results reveal that traffic jams and restrictive time windows lead to additional cost, cause delays, and increase co2 emission. As for a short-term planning, time-dependent scheduling algorithm was proposed and assessed while extending time windows. Results have proved the potential saving in cost, travel time, and carbon emission.

scholarly journals Mathematical Formulation and Comparison of Solution Approaches for the Vehicle Routing Problem with Access Time Windows

Complexity ◽  
2018 ◽  
Vol 2018 ◽  
pp. 1-10 ◽  
Author(s):  
Rafael Grosso ◽  
Jesús Muñuzuri ◽  
Alejandro Escudero-Santana ◽  
Elena Barbadilla-Martín
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Urban Areas ◽  
Time Windows ◽  
Mathematical Formulation ◽  
Access Time ◽  
Routing Problem ◽  
Urban Freight ◽  
Additional Costs ◽  
Problem Instances

The application of the principles of sustainability to the implementation of urban freight policies requires the estimation of all the costs and externalities involved. We focus here on the case of access time windows, which ban the access of freight vehicles to central urban areas in many European cities. Even though this measure seeks to reduce congestion and emissions in the most crowded periods of the day, it also imposes additional costs for carriers and results in higher emissions and energy consumption. We present here a mathematical model for the Vehicle Routing Problem with Access Time Windows, a variant of the VRP suitable for planning delivery routes in a city subject to this type of accessibility restriction. We use the model to find exact solutions to small problem instances based on a case study and then compare the performance over larger instances of a modified savings algorithm, a genetic algorithm, and a tabu search procedure, with the results showing no clear prevalence of any of them, but confirming the significance of those additional costs and externalities.

Routing Electric Vehicles on Congested Street Networks

2020 ◽  
Author(s):  
Alexandre M. Florio ◽  
Nabil Absi ◽  
Dominique Feillet
Keyword(s):  
Electric Vehicles ◽  
Traffic Congestion ◽  
Control Policy ◽  
Time Dependent ◽  
Travel Times ◽  
Routing Problem ◽  
Promising Alternative ◽  
Street Networks ◽  
Time Control ◽  
The Impact

Freight distribution with electric vehicles (EVs) is a promising alternative to reduce the carbon footprint associated with city logistics. Algorithms for planning routes for EVs should take into account their relatively short driving range and the effects of traffic congestion on the battery consumption. This paper proposes new methodology and illustrates how it can be applied to solve an electric vehicle routing problem with stochastic and time-dependent travel times where battery recharging along routes is not allowed. First, a new method for generating network-consistent (correlated in time and space) and time-dependent speed scenarios is introduced. Second, a new technique for applying branch and price on instances defined on real street networks is developed. Computational experiments demonstrate the effectiveness of the approach for finding optimal or near-optimal solutions in instances with up to 133 customers and almost 1,500 road links. With a high probability, the routes in the obtained solutions can be performed by EVs without requiring intermediate recharging stops. An execution time control policy to further reduce the chances of stranded EVs is also presented. In addition, we measure the cost of independence, which is the impact on solution feasibility when travel times are assumed statistically independent. Last, we give directions on how to extend the proposed framework to handle recourse actions.

scholarly journals Time-Dependent Vehicle Routing of Free Pickup and Delivery Service in Flight Ticket Sales Companies Based on Carbon Emissions

2017 ◽  
Vol 2017 ◽  
pp. 1-14 ◽  
Author(s):  
Jingmei Guo ◽  
Chao Liu
Keyword(s):  
Traffic Congestion ◽  
Time Window ◽  
Set Partitioning ◽  
Time Dependent ◽  
Time Constraints ◽  
Pickup And Delivery ◽  
Routing Problem ◽  
Ticket Sales ◽  
Computational Performance ◽  
The Impact

The time-dependent pollution-routing problem of free pickup and delivery of passengers to the airport service (TDFPDS) is an extension of the time-dependent pollution-routing problems, arising in flight ticket sales companies for the service of free pickup and delivery of airline passengers to the airport. The problem consists of routing a fleet of vehicles in order to deliver a set of customers to the airport considering the traffic congestion, time window constraints, and maximum ride time constraints. The cost function includes fuel consumption and driver costs. We provide an analytical characterization of the optimal solutions for a fixed route and propose a novel heuristic for a given route based on the analysis of the illustrative examples. The heuristic algorithm is embedded into a set-partitioning model to produce high-quality routing plans. Finally, using wide variety of random instances, we present results on the computational performance of the heuristic and also on the impact of the congestion and the maximum ride time constraints.

scholarly journals DIFFERENT URBAN CONSOLIDATION CENTRE SCENARIOS: IMPACT ON EXTERNAL COSTS OF LAST-MILE DELIVERIES

Transport ◽  
2018 ◽  
Vol 33 (4) ◽  
pp. 948-958 ◽  
Author(s):  
Marko Veličković ◽  
Đurđica Stojanović ◽  
Svetlana Nikoličić ◽  
Marinko Maslarić
Keyword(s):  
Urban Area ◽  
Urban Areas ◽  
Freight Transport ◽  
Sustainable Urban Development ◽  
External Costs ◽  
Urban Freight ◽  
Last Mile ◽  
Freight Consolidation ◽  
The Impact ◽  
Urban Consolidation

The identification and mitigation of negative externalities from goods deliveries in urban areas are important aspects of sustainable urban development. Previous studies have shown that urban freight consolidation increases the load factor of Delivery Vehicles (DVs), reducing the vehicle-kilometres driven and thus reducing negative freight transport externalities in urban areas. The objective of this paper is to explore the possible impact of the number of Urban Consolidation Centres (UCCs) on the external costs of last-mile deliveries in freight transport and to determine the possible contribution of such consolidation scenarios to external cost mitigation. Therefore, several consolidation scenarios are considered assuming different numbers of UCCs in operation. A new consolidation scheme is proposed with more than one UCC to serve a given city area. Input data are obtained from a roadside questionnaire survey with a sample of 1617 drivers at 9 access roads to an urban area as part of the NOvi Sad TRAnsport Model (NOSTRAM) study. Externalities are calculated using the IMPACT methodology and discussed for different urban freight consolidation options. The best option is identified, and the results indicate that properly planned, organised and managed urban freight consolidation can significantly reduce transport externalities. The main research results showed that all of the proposed consolidation options increase the total driving distance in an urban area. However, some consolidation options significantly reduce the driving distance of less manageable vehicles in last-mile deliveries (long-haul heavy- and light-duty vehicles). Consequently, the external costs ranged from 2108.3 to 5420.5 EUR for the consolidation option, whereas the current state externalities are 2791.4 EUR. Thus, more small UCCs may provide better results than the central centre even in medium-sized cities.

scholarly journals A Fissile Ripple Spreading Algorithm to Solve Time-Dependent Vehicle Routing Problem via Coevolutionary Path Optimization

2020 ◽  
Vol 2020 ◽  
pp. 1-13
Author(s):  
Wen Xu ◽  
JiaJun Li
Keyword(s):  
Vehicle Routing ◽  
Shortest Path ◽  
Traffic Congestion ◽  
Path Optimization ◽  
Time Dependent ◽  
Optimization Approach ◽  
Routing Problem ◽  
Shortest Path Problems ◽  
Travelling Time ◽  
Logistics Delivery

The time-dependent vehicle routing problems have lately received great attention for logistics companies due to their crucial roles in reducing the time and economic costs, as well as fuel consumption and carbon emissions. However, the dynamic routing environment and traffic congestions have made it challenging to make the actual travelling trajectory optimal during the delivery process. To overcome this challenge, this study proposed an unconventional path optimization approach, fissile ripple spreading algorithm (FRSA), which is based on the advanced structure of coevolutionary path optimization (CEPO). The objective of the proposed model is to minimize the travelling time and path length of the vehicle, which are the popular indicators in path optimization. Some significant factors usually ignored in other research are considered in this study, such as congestion evolution, routing environment dynamics, signal control, and the complicated correlation between delivery sequence and the shortest path. The effectiveness of the proposed approach was demonstrated well in two sets of simulated experiments. The results prove that the proposed FRSA can scientifically find out the optimal delivery trajectory in a single run via global research, effectively avoid traffic congestion, and decrease the total delivery costs. This finding paves a new way to explore a promising methodology for addressing the delivery sequence and the shortest path problems at the same time. This study can provide theoretical support for the practical application in logistics delivery.

scholarly journals A framework for IoT-enabled environment aware traffic management

2021 ◽  
Vol 11 (1) ◽  
pp. 518
Author(s):  
Mohamed Fazil Mohamed Firdhous ◽  
B. H. Sudantha ◽  
Naseer Ali Hussien
Keyword(s):  
Traffic Congestion ◽  
Urban Areas ◽  
Traffic Management ◽  
Fine Particles ◽  
Environment Pollution ◽  
Negative Effects ◽  
Traffic Condition ◽  
Pollution Levels ◽  
Transport Services ◽  
The Cost

Vehicular traffic has increased across all over the world especially in urban areas due to many reasons including the reduction in the cost of vehicles, degradation of the quality of public transport services and increased wealth of people. The traffic congestion created by these vehicles causes many problems. Increased environment pollution is one of the most serious negative effects of traffic congestion. Noxious gases and fine particles emitted by vehicles affect people in different ways depending on their age and present health conditions. Professionals and policy makers have devised schemes for better managing traffic in congested areas. These schemes suffer from many shortcomings including the inability to adapt to dynamic changes of traffic patterns. With the development of technology, new applications like Google maps help drivers to select less congested routes. But, the identification of the best route takes only the present traffic condition on different road segments presently. In this paper the authors propose a system that helps drivers select routes based on the present and expected environment pollution levels at critical points in a given area.

scholarly journals A Model for Sustainable Courier Services: Vehicle Routing with Exclusive Lanes

2020 ◽  
Vol 12 (3) ◽  
pp. 1077
Author(s):  
Keyju Lee ◽  
Junjae Chae ◽  
Bomi Song ◽  
Donghyun Choi
Keyword(s):  
Vehicle Routing ◽  
Carbon Emissions ◽  
Vehicle Routing Problem ◽  
Traffic Congestion ◽  
Urban Areas ◽  
Southeast Asian ◽  
Routing Problem ◽  
Heterogeneous Fleet ◽  
Proposed Model ◽  
Asian Cities

In Southeast Asian cities, it is common for logistic companies to operate a heterogeneous fleet of delivery vehicles with motorcycles being the preferred vehicle to handle the final phase of delivery. In such scenarios, heterogeneous fleet vehicle routing problem (HFVRP) is generally applied to plan an optimal delivery. However, in many downtown cores of large and rapidly developing Southeast Asian cities, HFVRP is neither viable nor reliable because of road usage restrictions. The purpose of this article is to develop and test a different approach that accurately takes these restrictions into account and provides viable and more sustainable results. Restrictions in this paper refer to situations of urban areas in Vietnam where (i) certain vehicle types are prohibited in specified areas or where narrow alleyways limit the utilization of vehicles that exceed the road capacity and (ii) certain roads are exclusive to certain vehicle types. In networks, limited access and exclusive lanes are represented as links, or arcs, exclusive to one or another. Taking these limitations into consideration, we have developed a unique model, which we have termed Vehicle Routing Problem with Exclusive Links (VRP-EL). The model was validated and tested for its performance on scenarios with varying ratios of exclusive links. Scenarios up to 500 customers were tested on a meta-heuristic algorithm, simulated annealing. VRP-EL produces realistic outcomes. Limiting certain links to be selected according to vehicle types increases overall travel distance. However, this increase outweighs the cost of re-planning and rerouting had they not been constrained initially. The reduction in traveling distance leads to fossil fuel reduction for the overall system. The estimation of reduced carbon emissions through applying the proposed model is presented. Considering the severe traffic congestion and carbon emissions caused by motorcycles in Vietnam, the proposed model leads to a sustainable road environment.

Sign in / Sign up

Export Citation Format

Share Document