A branch‐and‐dive heuristic for single vehicle snow removal

DOI10.1002/net.21989zbMath1527.90041OpenAlexW3088848480MaRDI QIDQ6092642

Unnamed Author, Kaj Holmberg

Publication date: 23 November 2023

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.21989

zbMATH Keywords

branch-and-boundheuristicarc routingasymmetric traveling salesmanprecedencesturning penalties

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• A survey of models and algorithms for winter road maintenance. III: Vehicle routing and depot location for spreading
• A survey of models and algorithms for winter road maintenance. IV: Vehicle routing and fleet sizing for plowing and snow disposal
• An effective implementation of the Lin-Kernighan traveling salesman heuristic
• A branch \& cut algorithm for the asymmetric traveling salesman problem with precedence constraints
• An efficient genetic algorithm for the traveling salesman problem with precedence constraints
• A survey of models and algorithms for winter road maintenance. I: System design for spreading and plowing
• A survey of models and algorithms for winter road maintenance. II: System design for snow disposal
• An Efficient Transformation Of The Generalized Traveling Salesman Problem
• An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem
• Solving arc routing problems with turn penalties
• The Directed Rural Postman Problem with Turn Penalties
• A transformation for the mixed general routing problem with turn penalties
• The Rural Postman Problem on mixed graphs with turn penalties

This page was built for publication: A branch‐and‐dive heuristic for single vehicle snow removal