Multilevel neighborhood search for solving full truckload routing problems arising in timber transportation

DOI10.1016/j.endm.2012.10.037zbMath1268.90140OpenAlexW1979131935MaRDI QIDQ2840788

Patrick Hirsch, Ulrich Derigs, Markus Pullmann, Marco Oberscheider, Ulrich Vogel, Manfred Gronalt

Publication date: 23 July 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2012.10.037

zbMATH Keywords

metaheuristicsvehicle routingvariable neighborhood searchmultilevel neighborhood search

Mathematics Subject Classification ID

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

Related Items (1)

Route planning for a mixed delivery system in long distance transportation and comparison with pure delivery systems

Cites Work

• Unnamed Item
• The attribute based hill climber
• Applying the attribute based hill climber heuristic to the vehicle routing problem
• New optimization heuristics. The great deluge algorithm and the record- to-record travel
• Variable neighborhood search

This page was built for publication: Multilevel neighborhood search for solving full truckload routing problems arising in timber transportation