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...

Full description

Bibliographic Details
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
id doaj-3d64bb2f5157431e9ea80af323a80ba0
record_format Article
spelling doaj-3d64bb2f5157431e9ea80af323a80ba02020-11-24T21:30:59ZengInternational Institute of Informatics and CyberneticsJournal of Systemics, Cybernetics and Informatics1690-45242007-10-01554652Nonparametric Comparison of Two Dynamic Parameter Setting Methods in a Meta-Heuristic ApproachSeyhun HEPDOGAN0Reinaldo Moraga1Gail DePuy2Gary Whitehouse3 University of Central Florida Northern Illinois University University of Louisville University of Central Florida 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 selection of these parameters before solving the problem can require much time. This paper investigates the problem of setting parameters using a typical meta-heuristic called Meta-RaPS (Metaheuristic for Randomized Priority Search.). Meta-RaPS is a promising meta-heuristic optimization method that has been applied to different types of combinatorial optimization problems and achieved very good performance compared to other meta-heuristic techniques. To solve a combinatorial problem, Meta-RaPS uses two well-defined stages at each iteration: construction and local search. After a number of iterations, the best solution is reported. Meta-RaPS performance depends on the fine tuning of two main parameters, priority percentage and restriction percentage, which are used during the construction stage. This paper presents two different dynamic parameter setting methods for Meta-RaPS. These dynamic parameter setting approaches tune the parameters while a solution is being found. To compare these two approaches, nonparametric statistic approaches are utilized since the solutions are not normally distributed. Results from both these dynamic parameter setting methods are reported.http://www.iiisci.org/Journal/CV$/sci/pdfs/P498382.pdf Early Tardy Single Machine Scheduling ProblemReactive SearchDynamic Parameter Setting0-1 Multiple Knapsack ProblemMeta-RaPS
collection DOAJ
language English
format Article
sources DOAJ
author Seyhun HEPDOGAN
Reinaldo Moraga
Gail DePuy
Gary Whitehouse
spellingShingle Seyhun HEPDOGAN
Reinaldo Moraga
Gail DePuy
Gary Whitehouse
Nonparametric Comparison of Two Dynamic Parameter Setting Methods in a Meta-Heuristic Approach
Journal of Systemics, Cybernetics and Informatics
Early Tardy Single Machine Scheduling Problem
Reactive Search
Dynamic Parameter Setting
0-1 Multiple Knapsack Problem
Meta-RaPS
author_facet Seyhun HEPDOGAN
Reinaldo Moraga
Gail DePuy
Gary Whitehouse
author_sort Seyhun HEPDOGAN
title Nonparametric Comparison of Two Dynamic Parameter Setting Methods in a Meta-Heuristic Approach
title_short Nonparametric Comparison of Two Dynamic Parameter Setting Methods in a Meta-Heuristic Approach
title_full Nonparametric Comparison of Two Dynamic Parameter Setting Methods in a Meta-Heuristic Approach
title_fullStr Nonparametric Comparison of Two Dynamic Parameter Setting Methods in a Meta-Heuristic Approach
title_full_unstemmed Nonparametric Comparison of Two Dynamic Parameter Setting Methods in a Meta-Heuristic Approach
title_sort nonparametric comparison of two dynamic parameter setting methods in a meta-heuristic approach
publisher International Institute of Informatics and Cybernetics
series Journal of Systemics, Cybernetics and Informatics
issn 1690-4524
publishDate 2007-10-01
description 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 selection of these parameters before solving the problem can require much time. This paper investigates the problem of setting parameters using a typical meta-heuristic called Meta-RaPS (Metaheuristic for Randomized Priority Search.). Meta-RaPS is a promising meta-heuristic optimization method that has been applied to different types of combinatorial optimization problems and achieved very good performance compared to other meta-heuristic techniques. To solve a combinatorial problem, Meta-RaPS uses two well-defined stages at each iteration: construction and local search. After a number of iterations, the best solution is reported. Meta-RaPS performance depends on the fine tuning of two main parameters, priority percentage and restriction percentage, which are used during the construction stage. This paper presents two different dynamic parameter setting methods for Meta-RaPS. These dynamic parameter setting approaches tune the parameters while a solution is being found. To compare these two approaches, nonparametric statistic approaches are utilized since the solutions are not normally distributed. Results from both these dynamic parameter setting methods are reported.
topic Early Tardy Single Machine Scheduling Problem
Reactive Search
Dynamic Parameter Setting
0-1 Multiple Knapsack Problem
Meta-RaPS
url http://www.iiisci.org/Journal/CV$/sci/pdfs/P498382.pdf
work_keys_str_mv AT seyhunhepdogan nonparametriccomparisonoftwodynamicparametersettingmethodsinametaheuristicapproach
AT reinaldomoraga nonparametriccomparisonoftwodynamicparametersettingmethodsinametaheuristicapproach
AT gaildepuy nonparametriccomparisonoftwodynamicparametersettingmethodsinametaheuristicapproach
AT garywhitehouse nonparametriccomparisonoftwodynamicparametersettingmethodsinametaheuristicapproach
_version_ 1725960735303925760