Problem dependent optimization (PDO)

Iliya Bluskov ()
Additional contact information
Iliya Bluskov: University of Northern BC

Journal of Combinatorial Optimization, 2016, vol. 31, issue 3, No 24, 1335-1344

Abstract: Abstract A metaheuristic is generally a procedure designed to find a good solution to a difficult optimization problem. Known optimization search metaheuristics heavily rely on parameters, which are usually introduced so that the metaheuristic follows some supposedly related to the optimization problem natural process (simulated annealing, swarm optimization, genetic algorithms). Adjusting the parameters so that the metaheuristic performs successfully in the problem at hand could be quite tricky and time consuming task which often requires intimate knowledge of the problem and a lot of experimenting to achieve the needed level of performance. In this article I present a metaheuristic with parameters depending only on the problem at hand, which virtually eliminates the preliminary work on adjusting the parameters. Moreover, the parameters are frequently updated during the process, based on the increasing amount of information about the solution space collected during the run. The metaheuristic has been successfully applied in several different searches for discrete objects such as designs, packings, coverings and partitions.

Keywords: Discrete; Optimization; Metaheuristic; Self-improving (search for similar items in EconPapers)
Date: 2016
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-014-9826-x Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:31:y:2016:i:3:d:10.1007_s10878-014-9826-x

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-014-9826-x

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().