Optimization: principles and algorithms, by Michel Bierlaire
Functions
tspInsertion.m File Reference

Algorithm 27.2: insertion heuristic for TSP. More...

Go to the source code of this file.

Functions

function tspInsertion (in dist, in initialTour)
 Compute an halmitonian path using the insertion heuristic. More...
 

Detailed Description

Algorithm 27.2: insertion heuristic for TSP.

Implementation of algorithm 27.2 of [1]

Note
Tested with run2703insertion.m
Called by tspInsertionLocalSearch
Calls subtourLength
Calls bestInsert
Calls insertCity
Author
Michel Bierlaire
Date
Tue Apr 14 12:43:17 2015

Definition in file tspInsertion.m.

Function Documentation

◆ tspInsertion()

function tspInsertion ( in  dist,
in  initialTour 
)

Compute an halmitonian path using the insertion heuristic.

Parameters
distdistance matrix
initialTourdescription of the initial tour stored as a successors list
Returns
greedyTour permutation of the cities
Copyright 2015-2018 Michel Bierlaire