IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v31y2016i3d10.1007_s10878-014-9826-x.html
   My bibliography  Save this article

Problem dependent optimization (PDO)

Author

Listed:
  • Iliya Bluskov

    (University of Northern BC)

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.

Suggested Citation

  • Iliya Bluskov, 2016. "Problem dependent optimization (PDO)," Journal of Combinatorial Optimization, Springer, vol. 31(3), pages 1335-1344, April.
    • Handle: RePEc:spr:jcomop:v:31:y:2016:i:3:d:10.1007_s10878-014-9826-x
    DOI: 10.1007/s10878-014-9826-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-014-9826-x
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-014-9826-x?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:31:y:2016:i:3:d:10.1007_s10878-014-9826-x. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.