Optimization of snow plowing cost and time in an urban environment: A case study for the City of Edmonton

2014 ◽  
Vol 41 (7) ◽  
pp. 667-675 ◽  
Author(s):  
Gang Liu ◽  
Yongfeng Ge ◽  
Tony Z. Qiu ◽  
Hamid R. Soleymani

Each winter, Canadian municipalities deploy significant capital for snow plowing. Any improvements to snowplow operations not only results in significant capital savings for municipalities and road agencies, but also improves roadway safety and user mobility. In the existing research, routing snowplow operations is generally considered a network optimization problem; however, the formulations and solutions can be very diverse, as each urban area has unique environmental conditions and operational constraints. For a specific district and depot, the problem is determining a set of routes that ensure that all road links are serviced, all operational constraints are satisfied, and total operational costs are minimized. This study used a mathematical optimization model based on the capacitated arc routing problem (CARP) to minimize the total travel distance for snowplow operations in the City of Edmonton. Depot location and route number are critical input parameters to the operation cost control. Sensitivity analyses were conducted to not only derive snowplow routing strategies using the CARP methodology, but also draw useful conclusions for winter road maintenance planners.

2021 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Mahdieh Masoumi ◽  
Amir Aghsami ◽  
Mohammad Alipour-Vaezi ◽  
Fariborz Jolai ◽  
Behdad Esmailifar

PurposeDue to the randomness and unpredictability of many disasters, it is essential to be prepared to face difficult conditions after a disaster to reduce human casualties and meet the needs of the people. After the disaster, one of the most essential measures is to deliver relief supplies to those affected by the disaster. Therefore, this paper aims to assign demand points to the warehouses as well as routing their related relief vehicles after a disaster considering convergence in the border warehouses.Design/methodology/approachThis research proposes a multi-objective, multi-commodity and multi-period queueing-inventory-routing problem in which a queuing system has been applied to reduce the congestion in the borders of the affected zones. To show the validity of the proposed model, a small-size problem has been solved using exact methods. Moreover, to deal with the complexity of the problem, a metaheuristic algorithm has been utilized to solve the large dimensions of the problem. Finally, various sensitivity analyses have been performed to determine the effects of different parameters on the optimal response.FindingsAccording to the results, the proposed model can optimize the objective functions simultaneously, in which decision-makers can determine their priority according to the condition by using the sensitivity analysis results.Originality/valueThe focus of the research is on delivering relief items to the affected people on time and at the lowest cost, in addition to preventing long queues at the entrances to the affected areas.


2019 ◽  
Vol 46 (6) ◽  
pp. 511-521
Author(s):  
Lian Gu ◽  
Tae J. Kwon ◽  
Tony Z. Qiu

In winter, it is critical for cold regions to have a full understanding of the spatial variation of road surface conditions such that hot spots (e.g., black ice) can be identified for an effective mobilization of winter road maintenance operations. Acknowledging the limitations in present study, this paper proposes a systematic framework to estimate road surface temperature (RST) via the geographic information system (GIS). The proposed method uses a robust regression kriging method to take account for various geographical factors that may affect the variation of RST. A case study of highway segments in Alberta, Canada is used to demonstrate the feasibility and applicability of the method proposed herein. The findings of this study suggest that the geostatistical modelling framework proposed in this paper can accurately estimate RST with help of various covariates included in the model and further promote the possibility of continuous monitoring and visualization of road surface conditions.


2017 ◽  
Vol 44 (12) ◽  
pp. 1005-1013 ◽  
Author(s):  
Olivier Quirion-Blais ◽  
André Langevin ◽  
Martin Trépanier

In this article, we address a winter maintenance problem where the streets need to be plowed and gritted in a sequence that depends on the class of the road. The maintenance fleet includes vehicles equipped for plowing, some for spreading, and some for both at once. The objective is to complete the operations as rapidly as possible while considering street hierarchy, turn restrictions, heterogeneous speeds, and street–vehicle compatibility. An adaptive large neighborhood search framework is developed to solve the problem. Analysis of the results obtained can provide both a good basis for vehicle routing and help managers plan long-term policies and investments.


2018 ◽  
Vol 2018 ◽  
pp. 1-11
Author(s):  
Xu Wang ◽  
Lian Gu ◽  
Tae J. Kwon ◽  
Tony Z. Qiu

Inclement weather acutely affects road surface and driving conditions and can negatively impact traffic mobility and safety. Highway authorities have long been using road weather information systems (RWISs) to mitigate the risk of adverse weather on traffic. The data gathered, processed, and disseminated by such systems can improve both the safety of the traveling public as well as the effectiveness of winter road maintenance operations. As the road authorities continue to invest in expanding their existing RWIS networks, there is a growing need to determine the optimal deployment strategies for RWISs. To meet such demand, this study presents an innovative geostatistical approach to quantitatively analyze the spatiotemporal variations of the road weather and surface conditions. With help of constructed semivariograms, this study quantifies and examines both the spatial and temporal coverage of RWIS data. A case study of Alberta, which is one of the leaders in Canada in the use of RWISs, was conducted to indicate the reliability and applicability of the method proposed herein. The findings of this research offer insight for constructing a detailed spatiotemporal RWIS database to manage and deploy different types of RWISs, optimize winter road maintenance resources, and provide timely information on inclement road weather conditions for the traveling public.


Transport ◽  
2017 ◽  
Vol 32 (4) ◽  
pp. 348-357 ◽  
Author(s):  
Mariusz Wasiak ◽  
Marianna Jacyna ◽  
Konrad Lewczuk ◽  
Emilian Szczepański

The paper describes proecological solution dedicated for organizing logistics services in urban areas. Proposed solution is based on cross-docking processes combined with consolidation centres. Authors proposed new method of estimating economic and social benefits from implementing centrally managed cooperation of logistics operators using common city consolidation hubs. Developed mathematical model bases on Vehicle Routing Problem (VRP) with vehicles of different types, limited loading capacities and multiply depots characterized by limited throughput. Proposed approach was supported by case study of integration of distribution processes in Warsaw (Poland) performed by three medium-size logistics operators. The central management of distribution was investigated in variants assuming using existing warehouses and with new configuration of logistics network developed with using SIMMAG 3D tools. As it was proved for analysed case, total costs of distribution in the city after implementation of centrally managed distribution were reduced by 8.1% for variant with current depots and by 26.5% for variant with new logistics network, while emission of carbon monoxide (CO) was reduced respectively by 7.8 and 16.7%.


2017 ◽  
Vol 41 (2) ◽  
pp. 138-153 ◽  
Author(s):  
Draženko Glavić ◽  
Marina Milenković ◽  
Miloš Nikolić ◽  
Miloš N. Mladenović

2020 ◽  
Vol 18 (1) ◽  
pp. 107
Author(s):  
Danijel Marković ◽  
Goran Petrovć ◽  
Žarko Ćojbašić ◽  
Aleksandar Stanković

The vehicle routing problem with stochastic demands (VRPSD) is a combinatorial optimization problem. The VRPSD looks for vehicle routes to connect all customers with a depot, so that the total distance is minimized, each customer visited once by one vehicle, every route starts and ends at a depot, and the travelled distance and capacity of each vehicle are less than or equal to the given maximum value. Contrary to the classical VRP, in the VRPSD the demand in a node is known only after a vehicle arrives at the very node. This means that the vehicle routes are designed in uncertain conditions. This paper presents a heuristic and meta-heuristic approach for solving the VRPSD and discusses the real problem of municipal waste collection in the City of Niš.


2018 ◽  
Vol 37 (3) ◽  
pp. 287-300 ◽  
Author(s):  
Amin Farahbakhsh ◽  
Mohammad Ali Forghani

One of the important issues in the world is the significant growth of waste production, including waste that is not biodegradable in nature. According to the Kerman Municipality, 440 tonnes of municipal waste is collected daily in Kerman consisting of five major parts of paper, plastic, metal, glass, and wet waste. The major problems of municipal solid waste disposal are soil erosion, air pollution, and greenhouse gas emissions. The most important factors related to recycling are waste sorting and the relevant environmental conditions. This study aims to create a sustainable approach by locating the optimal sites to reduce environmental pollution, decrease costs, and improve the service system to the society. Optimal locations for establishing the collecting and sorting centers in the city are specified by the use of geographic information system software, based on criteria consisting of population density, road network, distance to health centers, distance to disposal center, waste sorting culture, land space, and land cost, which were weighted by an analytical hierarchy process. It was noteworthy that the criterion “waste sorting culture”, which has a foundation in human sciences and sociology, has been considered by experts in this study to be of the highest importance among other criteria at locating sorting centers. Subsequently, using a symmetric capacitated vehicle routing problem, the number and capacity of each vehicle are determined to serve the specified locations according to the economic, social, and environmental constraints.


2022 ◽  
Vol 14 (2) ◽  
pp. 819
Author(s):  
Antonia Ilabaca ◽  
Germán Paredes-Belmar ◽  
Pamela P. Alvarez

In this paper, we introduce, model, and solve a clustered resource allocation and routing problem for humanitarian aid distribution in the event of an earthquake and subsequent tsunami. First, for the preparedness stage, we build a set of clusters to identify, classify, sort, focus, and prioritize the aid distribution. The clusters are built with k-means method and a modified version of the capacitated p-median model. Each cluster has a set of beneficiaries and candidate delivery aid points. Second, vehicle routes are strategically determined to visit the clusters for the response stage. A mixed integer linear programming model is presented to determine efficient vehicle routes, minimizing the aid distribution times. A vulnerability index is added to our model to prioritize aid distribution. A case study is solved for the city of Iquique, Chile.


Sign in / Sign up

Export Citation Format

Share Document