scholarly journals Emergency Repair Scheduling Model for Road Network Integrating Rescheduling Feature

2021 ◽  
Vol 11 (4) ◽  
pp. 1447
Author(s):  
Shu-Shun Liu ◽  
Muhammad Faizal Ardhiansyah Arifin ◽  
Wei Tong Chen ◽  
Ying-Hua Huang

When a natural disaster occurs, road maintenance departments always face the challenge of how to assign repair resources properly to recover damaged road segments as soon as possible. From the literature review, most studies treat such problems as a vehicle routing problem (VRP). In those studies, repair resources are always dispatched as complete crews, and cannot be divided into smaller scales. Furthermore, each disaster point is only allowed one group of resources to recover it, without considering the possibility of accelerating the production rate subjected to specific objectives. Such limitation restricts required resources in an inflexible manner. Therefore, this study defines all repair works as an emergency repair project and adopts the framework of the Resource-Constrained Project Scheduling Problem (RCPSP), which can resolve such complicated resource assignment issue. A novel emergency repair scheduling model for the road network is proposed based on Constraint Programming (CP) as the searching algorithm to facilitate model formulation. According to the RCPSP concepts, disaster points are set as repair activities and resource travel routes between disaster points are set as transit activities. All the repair activities are linked by transit activities and the required resources are assigned accordingly. In order to consider the second-wave hazard events of where new disaster points may occur, and new resources may be added into emergency repair projects, a rescheduling feature is integrated into the proposed model. Through two case studies, research findings show that this model can be easily modulated to adapt to different situations satisfying practical disaster management goals and solving emergency repair scheduling problems for road networks efficiently.

Symmetry ◽  
2021 ◽  
Vol 13 (3) ◽  
pp. 364
Author(s):  
Shu-Shun Liu ◽  
Agung Budiwirawan ◽  
Muhammad Faizal Ardhiansyah Arifin ◽  
Wei Tong Chen ◽  
Ying-Hua Huang

When heavy rain strikes Taiwan, it always results in cracks in road pavement, and damages arising from potholes. Tremendously compromising road safety, road users may have fatal accidents caused by untimely repair actions. The road maintenance department needs to take the responsibilities for road sections in the form of inspections and faces the decision about how to properly allocate available resources to repair pavement damages immediately. When performing pavement repair works, we need to consider the resource consumption behavior and explore the mechanism of replenishing resources and calculating the return time. Therefore, in order to help maintenance units to deal with consumable resource issues, this study proposes a novel approach to offer the mechanism of consumable resource calculation, which is difficult to solve through the traditional vehicle routing problem (VRP) approach. This proposed model treats the pothole repair problem as a resource-constrained project scheduling problem (RCPSP), which is capable of resolving such consumable resource considerations. The proposed model was developed by adopting constraint programming (CP) techniques. Research results showed that the proposed model is capable of providing the optimal decisions of pavement pothole repair tasks and also meets practical requirements to make appropriate adjustment, and helps the maintenance unit to shorten total repair duration and optimize resource assignment decisions of pavement maintenance objectives.


Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-15 ◽  
Author(s):  
Tinggui Chen ◽  
Shiwen Wu ◽  
Jianjun Yang ◽  
Guodong Cong ◽  
Gongfa Li

It is common that many roads in disaster areas are damaged and obstructed after sudden-onset disasters. The phenomenon often comes with escalated traffic deterioration that raises the time and cost of emergency supply scheduling. Fortunately, repairing road network will shorten the time of in-transit distribution. In this paper, according to the characteristics of emergency supplies distribution, an emergency supply scheduling model based on multiple warehouses and stricken locations is constructed to deal with the failure of part of road networks in the early postdisaster phase. The detailed process is as follows. When part of the road networks fail, we firstly determine whether to repair the damaged road networks, and then a model of reliable emergency supply scheduling based on bi-level programming is proposed. Subsequently, an improved artificial bee colony algorithm is presented to solve the problem mentioned above. Finally, through a case study, the effectiveness and efficiency of the proposed model and algorithm are verified.


Author(s):  
I.V. Balabin ◽  
O.I. Balabin ◽  
I.S. Chabunin

The article presents issues related to improving safety and efficiency of operation of mobile machines in the constantly changing, winter temperature and traffic conditions. The authors develop a conceptual model of winter all-weather tires able to adapt to various road conditions such as when the road is covered with a layer of ice or compacted snow, or when the road is free from snow and ice. The use of such winter all weather tires will improve the road safety by contributing to increasing the life of tires and preserving the road network. The proposed model has no foreign analogues and is protected by a patent of the Russian Federation.


Author(s):  
Yao Liu ◽  
Jianmai Shi ◽  
Zhong Liu ◽  
Jincai Huang ◽  
Tianren Zhou

A novel high-voltage powerline inspection system is investigated, which consists of the cooperated ground vehicle and drone. The ground vehicle acts as a mobile platform that can launch and recycle the drone, while the drone can fly over the powerline for inspection within limited endurance. This inspection system enables the drone to inspect powerline networks in a very large area. Both vehicle’ route in the road network and drone’s routes along the powerline network have to be optimized for improving the inspection efficiency, which generates a new two-layer point-arc routing problem. Two constructive heuristics are designed based on “Cluster First, Rank Second” and “Rank First, Split Second”. Then local search strategies are developed to further improve the quality of the solution. To test the performance of the proposed algorithms, practical cases with different-scale are designed based on the road network and powerline network of Ji’an, China. Sensitivity analysis on the parameters related with the drone’s inspection speed and battery capacity is conducted. Computational results indicate that technical improvement on the inspection sensor is more important for the cooperated ground vehicle and drone system.


2012 ◽  
Vol 22 (6) ◽  
pp. 405-411
Author(s):  
Mohammad Reza Jelokhani-Niaraki ◽  
Ali Asghar Alesheikh ◽  
Abbas Alimohammadi ◽  
Abolghasem Sadeghi-Niaraki

In recent years, the development of the GIS-T (Geographic Information System for Transportation) applications has gained much attention, providing the transportation planners and managers with in-depth knowledge to achieve better decisions. Needless to say, developing a successful GIS for transportation applications is highly dependent on the design of a well-structured data model. Dynamic segmentation (DS) data model is a popular one being used more and more for different GIS-T analyses, serving as a data model that splits linear features into new set of segments wherever its attributes change. In most cases, the sets of segments presenting a particular attribute change frequently. Transportation managers place great importance on having regular update and revision of segmented data to ensure correct and precise decisions are made. However, updating the segmented data manually is a difficult task and a time-consuming process to do, demanding an automatic approach. To alleviate this, the present study describes a rule-based method using topological concept to simply update road segments and replace the manual tasks that users are to carry out. The proposed approach was employed and implemented on real road network data of the City of Tehran provided by the Road Maintenance and Transportation Organization (RMTO) of Iran. The practical results demonstrated that the time, cost, human-type errors, and complexity involved in update tasks are all reduced. KEYWORDS: GIS-T, dynamic segmentation, segment, automatic update, change type, rule


2020 ◽  
Vol 2020 ◽  
pp. 1-8
Author(s):  
Li Sun ◽  
Lei Ning ◽  
Jia-zhen Huo

In this paper, we introduce a group scheduling model with time-dependent and position-dependent DeJong’s learning effect. The objectives of scheduling problems are to minimize makespan, the total completion time, and the total weighted completion time, respectively. We show that the problems remain solvable in polynomial time under the proposed model.


2012 ◽  
Vol 5 ◽  
pp. 20-25 ◽  
Author(s):  
Xin Ming Zhang ◽  
Shi An ◽  
Bing Lei Xie

Based on SO-DTA and one-destination evacuation, a cell-based regional evacuation model, which embeds CTM and point-queue model, is proposed in this paper. The road network is converted to the cell-node topology structure so as to reduce the constraints. The “traffic holding” problem also be solved in the model by an OSP constraint. And to improve the evacuation efficiency, contra-flow lane is imported. A numerical experiment is conducted to verify the proposed model and algorithm.


Symmetry ◽  
2021 ◽  
Vol 13 (11) ◽  
pp. 2082
Author(s):  
Dengkai Hou ◽  
Houming Fan ◽  
Xiaoxue Ren

This paper studies the multi-depot joint distribution vehicle routing problem considering energy consumption with time-dependent networks (MDJDVRP-TDN). Aiming at the multi-depot joint distribution vehicle routing problem where the vehicle travel time depends on the variation characteristics of the road network speed in the distribution area, considering the influence of the road network on the vehicle speed and the relationship between vehicle load and fuel consumption, a multi-depot joint distribution vehicle routing optimization model is established to minimize the sum of vehicle fixed cost, fuel consumption cost and time window penalty cost. Traditional vehicle routing problems are modeled based on symmetric graphs. In this paper, considering the influence of time-dependent networks on routes optimization, modeling is based on asymmetric graphs, which increases the complexity of the problem. A hybrid genetic algorithm with variable neighborhood search (HGAVNS) is designed to solve the model, in which the nearest neighbor insertion method and Logistic mapping equation are used to generate the initial solution firstly, and then five neighborhood structures are designed to improve the algorithm. An adaptive neighborhood search times strategy is used to balance the diversification and depth search of the population. The effectiveness of the designed algorithm is verified through several groups of numerical instances with different scales. The research can enrich the relevant theoretical research of multi-depot vehicle routing problems and provide the theoretical basis for transportation enterprises to formulate reasonable distribution schemes.


2020 ◽  
Author(s):  
Million Demie ◽  
Emer Quezon ◽  
Alemayehu Feyissa

Roadway is one of the most crucial transportation modes to cater to inland movement within a country. The agency mandate is to design, construct, and maintain the road to sustain the traffic up to its design life without further strengthening. However, some factors are affecting the performance of the pavement. Most pavements start to show some traces of deterioration after construction and opening to traffic, but once neglected, the distress portions would be aggravated with corresponding increasing maintenance cost. Thus, the road's maintenance has to be carried out at the place, right schedule, right quality, and at the least cost. Since there are different maintenance alternatives, the best strategy has to be chosen following the road's condition and the severity of the damage. To select the best maintenance alternative, calculations on the pavement layer's property are performed. The Highway Development and Management (HDM-4) tool can do such measures to help decide which option is the best by evaluating the economic and structural conditions. This paper contains two significant areas that are studied. First, it was assessed the procedures followed by the city's road authority to develop the appropriate road maintenance strategies. Questionnaire surveys and interviews are used to collect information from the city's road maintenance departments. Second, the project analysis was performed for structural and economic comparison of different maintenance alternatives using HDM-4. In the analyses, three selected road segments are considered and collected important input data like road condition data, road network data, vehicle fleet data, estimated AADT, and International Roughness Index (IRI). There were five maintenance alternatives have been defined, and proposed maintenance alternatives are compared. The selection is based on the deteriorated pavement, which showed the average roughness for every section of the road network, considering an analysis period of 20 years and cost stream ranking for their Net Present Value and IRR. Results indicated that using a mill and replace, and routine maintenance schedule for the selected road networks is economically viable and structurally significant. Hence, the city's road authority is recommended to apply the different maintenance strategies, providing an economical and better performance for the city's road network.


2018 ◽  
Vol 7 (3.20) ◽  
pp. 140
Author(s):  
Ahmed Tarajo BUBA ◽  
Lai Soon LEE

In this paper, the urban transit routing problem is addressed by using a real-world urban transit network. Given the road network infrastructure and the demand, the problem consists in designing routes such that the service level as well as the operator cost are optimized. The optimality of the service level is measured in terms of average journey time and the route set length. A differential evolution approach is proposed to solve the problem. An improved sub-route reversal repair mechanism is introduced to deal with the infeasibility of route sets. Computational results on a real network produce solutions that are close to the lower bound values of the passenger and the operator costs. In addition, the proposed algorithm produces approximate Pareto fronts that enable the transit operator to evaluate the trade-off between the passenger and passenger costs. 


Sign in / Sign up

Export Citation Format

Share Document