Implementation Branch And Bound Algorithm For Travelling Salesman Problem

Wibisono, Bayu Harjanto (2009) Implementation Branch And Bound Algorithm For Travelling Salesman Problem. Other thesis, Fakultas Ilmu Komputer, UNIKA Soegijapranata.

Preview	Text (COVER) 04.02.0017 Harjanto Bayu Wibisono COVER.pdf Download (227kB) | Preview
	Text (BAB I) 04.02.0017 Harjanto Bayu Wibisono BAB I.pdf Restricted to Registered users only Download (80kB)
	Text (BAB II available document only in library of Soegijapranata Catholic University) 04.02.0017 Harjanto Bayu Wibisono BAB II.pdf Restricted to Repository staff only Download (117kB)
	Text (BAB III available document only in library of Soegijapranata Catholic University) 04.02.0017 Harjanto Bayu Wibisono BAB III.pdf Restricted to Repository staff only Download (57kB)
	Text (BAB IV available document only in library of Soegijapranata Catholic University) 04.02.0017 Harjanto Bayu Wibisono BAB IV.pdf Restricted to Repository staff only Download (172kB)
	Text (BAB V available document only in library of Soegijapranata Catholic University) 04.02.0017 Harjanto Bayu Wibisono BAB V.pdf Restricted to Repository staff only Download (196kB)
	Text (BAB VI) 04.02.0017 Harjanto Bayu Wibisono BAB VI.pdf Restricted to Registered users only Download (47kB)
Preview	Text (DAFTAR PUSTAKA) 04.02.0017 Harjanto Bayu Wibisono DAFTAR PUSTAKA.pdf Download (44kB) | Preview

Abstract

Traveling Salesman Problem is one of Ihe most intensively studied problems in computational mathematics. Travelling Salesman problem is a problem in combinatorial optimization studied in operations research and theoretical computer science. Given a list of cities and their pairwisc distances, the task is to find a shortest possible tour that visits each city exactly once. Travelling Salesman Problem was invented by Hassler Whitney at Princeton. In the 1950s and 1960s, the problem became increasingly popular in scientific circles in Europe and the USA. These problems will be solved with branch and bound algorithm and using tree data structures. Branch and Bound was first proposed by A.H Land and A.G Dotg in 1960. Branch and bound is a general algorithm for finding optimal solutions of various optimization problems, especially in discrete and combinatorial optimization. It consists of a systematic enumeration of all candidate solutions, where large subsets of fruitless candidates are discarded en masse, by using upper and lower estimated bounds of the quantity being optimized.

Item Type:	Thesis (Other)
Subjects:	000 Computer Science, Information and General Works > 005 Computer programming, programs & data
Divisions:	Faculty of Computer Science
Depositing User:	Mr Ign. Setya Dwiana
Date Deposited:	27 Jan 2016 02:18
Last Modified:	27 Jan 2016 02:18
URI:	http://repository.unika.ac.id/id/eprint/7453

Actions (login required)

View Item