Solving the large-scale min-max k-rural postman problem for snow plowing

DOI10.1002/NET.21759MaRDI QIDQ6496352zbMATH OpenFDO

Authors Olivier Quirion-Blais, André Langevin, Fabien Lehuédé, Olivier Péton, Martin Trépanier

Publication date 3 May 2024

Published in Networks (Search for Journal in Brave)

zbMATH Keywords

network topologyadaptive large neighborhood searchrural postman problemarc groupinglarge-scale real-life applicationswinter maintenance

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Recommendations

• Plowing with precedence: a variant of the windy postman problem
• Synchronized arc routing for snow plowing operations
• Arc routing with precedence constraints: an application to snow plowing operations
• Optimization models for a real-world snow plow routing problem
• Heuristics for the rural postman problem

Cites work

• scientific article; zbMATH DE number 6741971 (Why is no real title available?)
• A general heuristic for vehicle routing problems
• A metaheuristic for the min-max windy rural postman problem with K vehicles
• A survey of models and algorithms for winter road maintenance. IV: Vehicle routing and fleet sizing for plowing and snow disposal
• A transformation for the mixed general routing problem with turn penalties
• An Efficient Transformation Of The Generalized Traveling Salesman Problem
• An algorithm for the hierarchical Chinese postman problem
• Arc routing problems with min-max objectives
• Competitive memetic algorithms for arc routing problems
• Evolutionary algorithms for periodic arc routing problems
• General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic
• Min-Max \(K\)-vehicles windy rural postman problem
• Modeling and solving several classes of arc routing problems as traveling salesman problems
• On the hierarchical Chinese postman problem with linear ordered classes
• Solving the hierarchical Chinese postman problem as a rural postman problem.
• Synchronized arc routing for snow plowing operations
• The Capacitated Canadian Postman Problem
• The Directed Rural Postman Problem with Turn Penalties
• The Rural Postman Problem on mixed graphs with turn penalties
• The capacitated arc routing problem: heuristics
• The fleet size and mix problem for capacitated arc routing
• The rural postman problem on directed, mixed, and windy graphs

Cited in

(2)

• A rolling horizon framework for the time‐dependent multi‐visit dynamic safe street snow plowing problem
• Approximation algorithms for some min-max and minimum stacker crane cover problems

This page was built for publication: Solving the large-scale min-max \(k\)-rural postman problem for snow plowing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6496352)