dc.contributor.author | Halskau sr., Øyvind | |
dc.contributor.author | Jörnsten, Kurt | |
dc.date.accessioned | 2014-07-01T10:53:49Z | |
dc.date.available | 2014-07-01T10:53:49Z | |
dc.date.issued | 2013 | |
dc.identifier.isbn | 978-82-7962-173-7 | |
dc.identifier.uri | http://hdl.handle.net/11250/197066 | |
dc.description.abstract | The Clarke and Wright heuristic for the travelling salesman problem (TSP) has been used for several decades as a tool for finding good solutions for TSP and other vehicle routing
problems (VRP). In this paper we offer a simple, but fundamental relationship between the
cost of a Hamiltonian cycle measured in the original cost matrix and the cost of the same
cycle measured in a saving matrix. This relationship leads to a new and simple lower bound for TSP that some times is better than more traditional bounds based on so-called 1-trees. We also offer some upper bounds for the optimal solution of TSP. Some examples are given in order to illustrate the new bounds and compare these with the classical ones. | nb_NO |
dc.language.iso | eng | nb_NO |
dc.publisher | Høgskolen i Molde - Vitenskapelig høgskole i logistikk | nb_NO |
dc.relation.ispartofseries | 2013:7;Arbeidsnotat | |
dc.rights | Attribution-NonCommercial-NoDerivs 3.0 Norway | * |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/3.0/no/ | * |
dc.subject | Upper bounds | nb_NO |
dc.subject | Lower bounds | nb_NO |
dc.subject | Clark and Wright savings | nb_NO |
dc.subject | TSP | nb_NO |
dc.subject | Vehicle routing problems | nb_NO |
dc.subject | Travelling salesman problems | nb_NO |
dc.title | Some new bounds for the travelling salesman problem | nb_NO |
dc.type | Working paper | nb_NO |