Røpke, Stefan

This paper propose a simple, parallel, portable software framework for the metaheuristic named large neighborhood search (LNS). The aim is to provide a framework where the user has to set up a few data structures and implement a few functions and then the framework provides a metaheuristic where parallelization "comes for free". We apply the parallel LNS heuristic to two different problems: the traveling salesman problem with pickup and delivery (TSPPD) and the capacitated vehicle routing problem (CVRP)

Online Research Database In Technology

PALNS - A software framework for parallel large neighborhood search

http://orbit.dtu.dk/ws/files/4129408/PALNS.pdf

PALNS - A software framework for parallel large neighborhood search

Abstract

Similar works

Full text

Available Versions

Online Research Database In Technology