Columnwise neighborhood search: A novel set partitioning matheuristic and its application to the <scp>VeRoLog</scp> Solver Challenge 2019

DOI10.1002/net.21961zbMath1527.90042OpenAlexW3036427638MaRDI QIDQ6092663

Andrew J. Mason, Oliver J. Maclaren, Unnamed Author, Kevin H. W. Shen, Caroline Jagtenberg, Andrea Raith

Publication date: 23 November 2023

Published in: Networks (Search for Journal in Brave)

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

zbMATH Keywords

local searchrouting problemset partitioningmatheuristicscolumnwise neighborhood search

Mathematics Subject Classification ID

Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Optimization by Simulated Annealing
• Rich vehicle routing problems: from a taxonomy to a definition
• A survey on matheuristics for routing problems
• The Truck Dispatching Problem
• Branch-and-Price: Column Generation for Solving Huge Integer Programs
• Vehicle Routing
• An Integer Programming Approach to the Vehicle Scheduling Problem
• Unnamed Item
• Unnamed Item

This page was built for publication: Columnwise neighborhood search: A novel set partitioning matheuristic and its application to the <scp>VeRoLog</scp> Solver Challenge 2019