Nonparametric Comparison of Two Dynamic Parameter Setting Methods in a Meta-Heuristic Approach
Meta-heuristics are commonly used to solve combinatorial problems in practice. Many approaches provide very good quality solutions in a short amount of computational time; however most meta-heuristics use parameters to tune the performance of the meta-heuristic for particular problems and the select...
Main Authors: | Seyhun HEPDOGAN, Reinaldo Moraga, Gail DePuy, Gary Whitehouse |
---|---|
Format: | Article |
Language: | English |
Published: |
International Institute of Informatics and Cybernetics
2007-10-01
|
Series: | Journal of Systemics, Cybernetics and Informatics |
Subjects: | |
Online Access: | http://www.iiisci.org/Journal/CV$/sci/pdfs/P498382.pdf
|
Similar Items
-
A Rough Sets based modified Scatter Search algorithm for solving 0-1 Knapsack problem
by: Hassan Rezazadeh
Published: (2015-07-01) -
Substantiation of a heuristic algorithm in the knapsack problem
by: Н.В. KHalipovа, et al.
Published: (2012-12-01) -
A Novel Hybrid Cuckoo Search Algorithm with Global Harmony Search for 0–1 Knapsack Problems
by: Yanhong Feng, et al.
Published: (2016-12-01) -
Binary Moth Search Algorithm for Discounted {0-1} Knapsack Problem
by: Yan-Hong Feng, et al.
Published: (2018-01-01) -
Multi-objective database queries in combined knapsack and set covering problem domains
by: Sean A. Mochocki, et al.
Published: (2021-03-01)