A Self-Adaptive Heuristic Algorithm for Combinatorial Optimization Problems
This paper introduces a new self-tuning mechanism to the local search heuristic for solving of combinatorial optimization problems. Parameter tuning of heuristics makes them difficult to apply, as parameter tuning itself is an optimization problem. For this purpose, a modified local search algorithm...
Main Authors: | Cigdem Alabas-Uslu, Berna Dengiz |
---|---|
Format: | Article |
Language: | English |
Published: |
Atlantis Press
2014-09-01
|
Series: | International Journal of Computational Intelligence Systems |
Subjects: | |
Online Access: | https://www.atlantis-press.com/article/25868534.pdf |
Similar Items
-
The Problem of Tuning Metaheuristics as seen from a Machine Learning Perspective
by: Birattari, Mauro
Published: (2004) -
Combinatorial Optimization Problems and Metaheuristics: Review, Challenges, Design, and Development
by: Fernando Peres, et al.
Published: (2021-07-01) -
A review of simheuristics: Extending metaheuristics to deal with stochastic combinatorial optimization problems
by: Angel A. Juan, et al.
Published: (2015-12-01) -
A comparative study of metaheuristic algorithms for the fertilizer optimization problem
by: Dai, Chen
Published: (2006) -
Automatic Instance-based Tailoring of Parameter Settings for Metaheuristics
by: Dobslaw, Felix
Published: (2011)