Performance Evaluation of Combinatorial Optimization Problems Using Meta Heuristics Algorithms

Neha Chaudhary, Waseem Ahmad

Abstract


In real life scheduling, variations of the standard traveling salesman problem is very often encountered. The aim of this work is to present a new heuristic method for solving three such special instances with a common approach. The proposed algorithm uses a variant of the threshold accepting method, enhanced with intense local search, while the candidate solutions are produced through an insertion heuristic scheme. The main characteristic of the algorithm is that it does not require modifications and parameter tuning in order to cope with the three different problems. Computational results on a variety of real life and artificial problems are presented at the end of this work and prove the efficiency and the ascendancy of the proposed method over other algorithms found in the literature.

Full Text:

PDF


DOI: https://doi.org/10.26483/ijarcs.v4i8.1789

Refbacks

  • There are currently no refbacks.




Copyright (c) 2016 International Journal of Advanced Research in Computer Science