A set of sequencing heuristic and the computer code for the TSP.

Please use this identifier to cite or link to this item: http://ir.library.ui.edu.ng/handle/123456789/1764

Full metadata record

DC Field	Value	Language
dc.contributor.author	Charles-Owaba, O. E.	-
dc.contributor.author	Oladokun, V. O.	-
dc.date.accessioned	2018-10-10T12:45:24Z	-
dc.date.available	2018-10-10T12:45:24Z	-
dc.date.issued	1999	-
dc.identifier.other	Proceedings of NIIE conference on Manufacturing Engineering 1, pp. 135-146	-
dc.identifier.other	ui_inpro_charles-owaba_set_1999	-
dc.identifier.uri	http://ir.library.ui.edu.ng/handle/123456789/1764	-
dc.description	in proceeding	en_US
dc.description.abstract	This paper proposes a set sequencing heuristic solution for the travelling salesman problem (TSP). It attempts to first select, preferably a set of M smallest elements of the TSP matrix and then form a sequence. A computer code of the procedure was developed in Fortran 77 and used to examine its efficiency and relative effectiveness. It was found to be as effective as, but more efficient than the best of the nearest neighbour heuristics.	en_US
dc.language.iso	en	en_US
dc.title	A set of sequencing heuristic and the computer code for the TSP.	en_US
dc.type	Other	en_US
Appears in Collections:	scholarly works

Files in This Item:

File	Description	Size	Format
(1)ui_inpro_charles-owaba_set_1999.pdf		1.77 MB	Adobe PDF	View/Open

UISpace