We are very excited to join forces with MLCommons and OctoML.ai! Contact Grigori Fursin for more details!

A New Arc-Routing Algorithm Applied to Winter Road Maintenance

lib:6888e3881758550b (v1.0.0)

Authors: Jiří Fink,Martin Loebl,Petra Pelikánová
ArXiv: 2001.10828
Document:  PDF  DOI 
Abstract URL: https://arxiv.org/abs/2001.10828v1

This paper studies large scale instances of a fairly general arc-routing problem as well as incorporate practical constraints in particular coming from the scheduling problem of the winter road maintenance (e.g. different priorities for and methods of road maintenance). We develop a new algorithm based on a bin-packing heuristic which is well-scalable and able to solve road networks on thousands of crossroads and road segments in few minutes. Since it is impossible to find an optimal solution for such a large instances to compare it with a result of our algorithm, we also develop techniques to compute lower bounds which are based on Integer Linear Programming and Lazy Constraints.

Relevant initiatives  

Related knowledge about this paper Reproduced results (crowd-benchmarking and competitions) Artifact and reproducibility checklists Common formats for research projects and shared artifacts Reproducibility initiatives


Please log in to add your comments!
If you notice any inapropriate content that should not be here, please report us as soon as possible and we will try to remove it within 48 hours!