Vis enkel innførsel

dc.contributor.authorHolden, Nina
dc.contributor.authorHasle, Geir
dc.date.accessioned2016-02-25T14:15:25Z
dc.date.accessioned2016-02-26T09:25:22Z
dc.date.available2016-02-25T14:15:25Z
dc.date.available2016-02-26T09:25:22Z
dc.date.issued2009
dc.identifier.citationSINTEF Rapport A13822, 12 p. SINTEF, 2009nb_NO
dc.identifier.isbn9788214044591
dc.identifier.urihttp://hdl.handle.net/11250/2380706
dc.description-
dc.description.abstractHelsgaun’s implementation of the Lin-Kernighan algorithm (LKH) is an effective heuristic solver for the Traveling Salesman Problem (TSP). The report presents an extension of LKH to support time windows, i.e., to a solver for the TSPTW. The new solver is referred to as LKHTW. SINTEF’s solver for rich Vehicle Routing Problems, Spider, has been integrated with LKHTW. Several alternative methods for combining Spider’s VRP heuristics with optimization of each tour using LKHTW have been developed and investigated empirically on a set of test instances. The results show that small but significant improvements of the Spider solutions can be obtained in cases with few or very wide time windows, whereas only few and marginal improvements are obtained in cases with narrower time windows.
dc.language.isoengnb_NO
dc.titleExtending the Lin-Kernighan algorithm to improve solutions to VRPs with Time Windowsnb_NO
dc.typeResearch reportnb_NO
dc.date.updated2016-02-25T14:15:25Z
dc.identifier.cristin1267918


Tilhørende fil(er)

Thumbnail

Denne innførselen finnes i følgende samling(er)

Vis enkel innførsel