Next Article in Journal
Taylor Matrix Solution of the Mathematical Model of the RLC Circuits
Previous Article in Journal
Fibonacci Collocation Method for Solving Linear Differential - Difference Equations
 
 
Mathematical and Computational Applications is published by MDPI from Volume 21 Issue 1 (2016). Previous articles were published by another publisher in Open Access under a CC-BY (or CC-BY-NC-ND) licence, and they are hosted by MDPI on mdpi.com as a courtesy and upon agreement with the previous journal publisher.
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A Parametric Hybrid Method for the Traveling Salesman Problem

by
Gözde Kızılates
* and
Fidan Nuriyeva
*
Department of Mathematics, Ege University, 35100, Bornova, Izmir, Turkey
*
Authors to whom correspondence should be addressed.
Math. Comput. Appl. 2013, 18(3), 459-466; https://doi.org/10.3390/mca18030459
Published: 1 December 2013

Abstract

The traveling salesman problem (TSP) is one of the typical NP–Hard problems of combinatorial optimization area. This paper proposes a new hyper heuristic algorithm named Parametric Hybrid Method (PHM) based on The Farthest Vertex (FV) and Greedy heuristics for solving the traveling salesman problem. In addition, many problem instances from TSPLIB (traveling salesman problem library) were solved with NN, Greedy and PHM algorithms. The experimental results show that the new hybrid algorithm is more effective and efficient than both Greedy and Nearest Neighbor algorithms.
Keywords: traveling salesman problem; nearest neighbor algorithm; greedy algorithm; parametric hybrid algorithm; hyper heuristic algorithm traveling salesman problem; nearest neighbor algorithm; greedy algorithm; parametric hybrid algorithm; hyper heuristic algorithm

Share and Cite

MDPI and ACS Style

Kızılates, G.; Nuriyeva, F. A Parametric Hybrid Method for the Traveling Salesman Problem. Math. Comput. Appl. 2013, 18, 459-466. https://doi.org/10.3390/mca18030459

AMA Style

Kızılates G, Nuriyeva F. A Parametric Hybrid Method for the Traveling Salesman Problem. Mathematical and Computational Applications. 2013; 18(3):459-466. https://doi.org/10.3390/mca18030459

Chicago/Turabian Style

Kızılates, Gözde, and Fidan Nuriyeva. 2013. "A Parametric Hybrid Method for the Traveling Salesman Problem" Mathematical and Computational Applications 18, no. 3: 459-466. https://doi.org/10.3390/mca18030459

Article Metrics

Back to TopTop