Bio-inspired parameter-less heuristic for NP-hard (complete) discrete problems
by Manal Zettam
International Journal of Bio-Inspired Computation (IJBIC), Vol. 16, No. 1, 2020

Abstract: In this article, a bio-inspired parameter-less heuristic employs a path-relinking approach coupled with a local search instead of moving alternatives within the search space. In addition, a mean solution has assured the exploration and exploitation phases. The proposed bio-inspired parameter-less heuristic has been compared to ZODIAC, GRAFICS, WFA-water flow, EA-evolutionary algorithm, GRASP, GATSP, HGA-hybrid genetic algorithm, GA-genetic algorithm, HGDE-differential evolution algorithm, ACO-ant colony optimisation, HGGA-grouping genetic algorithm, SACF-simulated annealing algorithm, GAA-genetic algorithm, SCF-BMCF-hybrid heuristic algorithm, EnGGA-enhanced grouping genetic algorithm, SA - simulated annealing, SA_YLL - simulated annealing with variable on set of benchmarks. The comparative study shows that the proposed heuristic performs well on 26 benchmarks.

Online publication date: Fri, 14-Aug-2020

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Bio-Inspired Computation (IJBIC):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com