A survey of models and algorithms for winter road maintenance. Part I: system design for spreading and plowing

Perrier, Nathalie; Langevin, André; Campbell, James F.

doi:10.1016/j.cor.2004.07.006

Cited by 79 publications

(40 citation statements)

References 25 publications

(39 reference statements)

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…For example, partitioning of urban areas is commonly used to model snow removal operations where specific disposal sites are assigned to a sector (Cook and Alprin 1976;Campbell and Langevin 1995;Labelle et al 2002;Perrier et al 2006a;. Although tephra differs from snow in that it will not melt away, this approach to clean-up operations suits modelling of tephra clean-up.…”

Section: <1 MMmentioning

confidence: 99%

A model to assess tephra clean-up requirements in urban environments

et al. 2017

View full text Add to dashboard Cite

Tephra falls can cause a range of impacts to communities by disrupting, contaminating and damaging buildings and infrastructure systems, as well as posing a potential health hazard. Coordinated clean-up operations minimise the impacts of tephra on social and economic activities. However, global experience suggests clean-up operations are one of the most challenging aspects of responding to and recovering from tephra falls in urban environments. Here, we present a method for modelling coordinated municipal-led (town/district level authorities) tephra clean-up operations to support pre-event response and recovery planning. The model estimates the volume of tephra to be removed, clean-up duration, and direct costs. The underpinning component of the model is a scalable clean-up response framework, which identifies and progressively includes more urban surfaces (e.g., roofs, and roads) requiring clean-up with increasing tephra thickness. To demonstrate model applicability, we present four clean-up scenarios for the city of Auckland, New Zealand: 1 mm and 10 mm distal tephra fall across the city, along with two local 'wet' eruption scenarios (low and high volume tephra deposition) from within the Auckland Volcanic Field. Depending on the modelled scenario, outputs suggest that coordinated clean-up operations in Auckland could require the removal of tens of thousands to millions of cubic metres of tephra. The cost of these operations are estimated to be NZ$0.6-1.1 million (US$0.4-0.7 million) for the 1 mm distal tephra scenario and NZ$13.4-25.6 million (US$9-17 million) for the 10 mm distal tephra scenario. Estimated clean-up costs of local eruptions range from tens of millions to hundreds of millions of dollars. All eruption scenarios indicate clean-up operations lasting weeks to months, but clean-up in some areas impacted by local eruptions could last for years. The model outputs are consistent with documented historic tephra clean-up operations. Although we use Auckland as a proof-of-concept example, the method may be adapted for any city exposed to a tephra hazard.

show abstract

Section: <1 MMmentioning

confidence: 99%

A model to assess tephra clean-up requirements in urban environments

et al. 2017

View full text Add to dashboard Cite

show abstract

“…A review of problems arising during winter road maintenances has been published in the articles [21][22][23][24][25]. They also present industrial applications.…”

Section: Industrial Arc Routing Problemsmentioning

confidence: 99%

A railroad maintenance problem solved with a cut and column generation matheuristic

et al. 2015

View full text Add to dashboard Cite

In this article, we address a real life optimization problem, the rail track inspection scheduling problem. This problem consists of scheduling railway network inspection tasks. The objective is to minimize the total deadhead distance while performing all inspection tasks. Different 0-1 integer formulations for the problem are presented. A heuristic based on both Benders and Dantzig-Wolfe decompositions is proposed to solve this rich arc routing problem. Its performance is analyzed on a real life dataset provided by the French national railway company. The proposed algorithm is compared to a dynamic programming-based heuristic. Its ability to schedule the inspection tasks of 1 year on a sparse graph with thousand nodes and arcs is assessed.

show abstract

“…Finally, the percentage of nodes with lost imparity, given by i∈V r i , is limited by parameter τ 2 ∈ (0, 1), in constraint (13). Finally, constraints (14) and (15) Note that constraints (9)-(13) are valid in any type of graph regardless its distribution of even and odd degree nodes; however, if the number of odd degree nodes in G = (V, E) is relatively large, constraints (9)-(13) may be replaced by (16)- (17) below i∈V p∈P…”

Section: Problem Statement and Modelmentioning

confidence: 99%

“…Compactness and contiguity lead to more efficient routing of vehicles [16]; however, the literature that takes deadhead into account at a strategic level is scarce. Deadhead distance is very hard to model at a strategic level because routing has to be done in order to take it into consideration.…”

Section: Introductionmentioning

confidence: 99%

A novel model for arc territory design: promoting Eulerian districts

García-Ayala

González‐Velarde

Ríos‐Mercado

et al. 2015

Int Trans Operational Res

View full text Add to dashboard Cite

The problem of district design for the implementation of arc routing activities is addressed. The aim is to partition a road network into a given number of sectors to facilitate the organization of the operations to be implemented within the region. This problem arises in numerous applications such as postal delivery, meter readings, winter gritting, road maintenance, and municipal solid waste collection. An integer linear programming model is proposed where a novel set of node parity constraints to favor Eulerian districts is introduced. Series of instances were solved to assess the impact of these parity constraints on the objective function and deadhead distance. Networks with up to 401 nodes and 764 edges were successfully solved. The model is useful at a tactical level as it can be used to promote workload balance, compactness, deadhead distance reduction and parity in districts.

show abstract

A survey of models and algorithms for winter road maintenance. Part I: system design for spreading and plowing

Cited by 79 publications

References 25 publications

A model to assess tephra clean-up requirements in urban environments

A model to assess tephra clean-up requirements in urban environments

A railroad maintenance problem solved with a cut and column generation matheuristic

A novel model for arc territory design: promoting Eulerian districts

Contact Info

Product

Resources

About