Performance Evaluation of Convex Hull Node-Based Heuristics for Solving the Travelling Salesman Problem

Asani, E. Oluwatobi and Okeyinka, A.E and Adebiyi, A. A. (2022) Performance Evaluation of Convex Hull Node-Based Heuristics for Solving the Travelling Salesman Problem. In: Lecture Notes in Networks and Systems. Proceedings of Sixth International Congress on Information and Communication Technology ICICT 2021, London, Volume 4, 217 . Springer, London, pp. 665-674. ISBN 2367-3370

	Text (Performance Evaluation of Convex Hull Node-Based Heuristics for Solving the Travelling Salesman Problem) Performance Evaluation of Convex Hull Node Based Heuristics.pdf - Published Version Download (7MB)
	Text (Performance Evaluation of Convex Hull Node-Based Heuristics for Solving the Travelling Salesman Problem) Performance Evaluation of Convex Hull Node Based Heuristics.pdf - Published Version Download (7MB)

Abstract

This experimental study investigated the effect of Convex Hull on Nodebased Heuristics. This was motivated by the assertion in the literature that starting some insertion tours with a convex hull theoretically degrades their worst case from twice optimal to thrice optimal. The Node-based techniques considered were Nearest Neighbour Heuristic (NNH) and Nearest Insertion Heuristic (NIH). The derived heuristics with Convex Hull were referred to in this study as Convex Hull Nearest Neighbour (CHNN) and Convex Hull Nearest Insertion (CHNI), respectively. The techniques were experimented on eleven benchmark instances from TSPLIB using Python Programming Language. Experimental results showed that the performances of both the Nearest Neighbour and Nearest Insertion were enhanced in terms of Computational speed and solution quality

Actions (login required)

View Item