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).
|Title of host publication||8th Metaheuristic International Conference CDROM|
|Publication status||Published - 2009|
|Event||Metaheuristic International Conference - Hamburg, Germany|
Duration: 1 Jan 2009 → …
Conference number: 8
|Conference||Metaheuristic International Conference|
|Period||01/01/2009 → …|