IDEAS home Printed from https://ideas.repec.org/a/anm/alpnmr/v8y2020i1p43-58.html
   My bibliography  Save this article

Machine Coded Compact Genetic Algorithms for Real Parameter Optimization Problems

Author

Listed:
  • Mehmet Hakan Satman
  • Emre Akadal

Abstract

In this paper, we extend the Compact Genetic Algorithm (CGA) for real-valued optimization problems by dividing the total search process into three stages. In the first stage, an initial vector of probabilities is generated. The initial vector contains the probabilities of bits having 1 depending on the bit locations as defined in the IEEE-754 standard. In the second stage, a CGA search is applied on the objective function using the same encoding scheme. In the last stage, a local search is applied using the result obtained by the previous stage as the starting point. A simulation study is performed on a set of well-known test functions to measure the performance differences. Simulation results show that the improvement in search capabilities is significant for many test functions in many dimensions and different levels of difficulty.

Suggested Citation

  • Mehmet Hakan Satman & Emre Akadal, 2020. "Machine Coded Compact Genetic Algorithms for Real Parameter Optimization Problems," Alphanumeric Journal, Bahadir Fatih Yildirim, vol. 8(1), pages 43-58, June.
    • Handle: RePEc:anm:alpnmr:v:8:y:2020:i:1:p:43-58
    DOI: https://doi.org/10.17093/alphanumeric.576919
    as

    Download full text from publisher

    File URL: https://www.alphanumericjournal.com/media/Issue/volume-8-issue-1-2020/machine-coded-compact-genetic-algorithms-for-real-parameter-_rOBmpZw.pdf
    Download Restriction: no
    File URL: https://alphanumericjournal.com/article/machine-coded-compact-genetic-algorithms-for-real-parameter-optimization-problems/
    Download Restriction: no
    File URL: https://libkey.io/https://doi.org/10.17093/alphanumeric.576919?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
    ---><---

    References listed on IDEAS

    as
    1. Mishra, Sudhanshu, 2006. "Some new test functions for global optimization and performance of repulsive particle swarm method," MPRA Paper 2718, University Library of Munich, Germany.
    2. Goncalves, Jose Fernando & de Magalhaes Mendes, Jorge Jose & Resende, Mauricio G. C., 2005. "A hybrid genetic algorithm for the job shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 167(1), pages 77-95, November.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Ivorra, Benjamin & Mohammadi, Bijan & Manuel Ramos, Angel, 2015. "A multi-layer line search method to improve the initialization of optimization algorithms," European Journal of Operational Research, Elsevier, vol. 247(3), pages 711-720.
    2. Sels, Veronique & Craeymeersch, Kjeld & Vanhoucke, Mario, 2011. "A hybrid single and dual population search procedure for the job shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 215(3), pages 512-523, December.
    3. Mishra, SK, 2006. "Performance of Differential Evolution and Particle Swarm Methods on Some Relatively Harder Multi-modal Benchmark Functions," MPRA Paper 449, University Library of Munich, Germany.
    4. Weitao Sun & Yuan Dong, 2011. "Study of multiscale global optimization based on parameter space partition," Journal of Global Optimization, Springer, vol. 49(1), pages 149-172, January.
    5. Rego, César & Duarte, Renato, 2009. "A filter-and-fan approach to the job shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 194(3), pages 650-662, May.
    6. Gonçalves, J.F. & Mendes, J.J.M. & Resende, M.G.C., 2008. "A genetic algorithm for the resource constrained multi-project scheduling problem," European Journal of Operational Research, Elsevier, vol. 189(3), pages 1171-1190, September.
    7. Chiang, Tsung-Che & Fu, Li-Chen, 2009. "Using a family of critical ratio-based approaches to minimize the number of tardy jobs in the job shop with sequence dependent setup times," European Journal of Operational Research, Elsevier, vol. 196(1), pages 78-92, July.
    8. G I Zobolas & C D Tarantilis & G Ioannou, 2009. "A hybrid evolutionary algorithm for the job shop scheduling problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(2), pages 221-235, February.
    9. Hong-Sen Yan & Wen-Chao Li, 2017. "A multi-objective scheduling algorithm with self-evolutionary feature for job-shop-like knowledgeable manufacturing cell," Journal of Intelligent Manufacturing, Springer, vol. 28(2), pages 337-351, February.
    10. Seung-Hyun Moon & Yourim Yoon, 2022. "Genetic Mean Reversion Strategy for Online Portfolio Selection with Transaction Costs," Mathematics, MDPI, vol. 10(7), pages 1-20, March.
    11. Gonçalves, José Fernando & Resende, Mauricio G.C., 2015. "A biased random-key genetic algorithm for the unequal area facility layout problem," European Journal of Operational Research, Elsevier, vol. 246(1), pages 86-107.
    12. Nicolás Álvarez-Gil & Rafael Rosillo & David de la Fuente & Raúl Pino, 2021. "A discrete firefly algorithm for solving the flexible job-shop scheduling problem in a make-to-order manufacturing system," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 29(4), pages 1353-1374, December.
    13. José Fernando Gonçalves & Mauricio G. C. Resende, 2011. "A parallel multi-population genetic algorithm for a constrained two-dimensional orthogonal packing problem," Journal of Combinatorial Optimization, Springer, vol. 22(2), pages 180-201, August.
    14. Massimiliano Kaucic, 2013. "A multi-start opposition-based particle swarm optimization algorithm with adaptive velocity for bound constrained global optimization," Journal of Global Optimization, Springer, vol. 55(1), pages 165-188, January.
    15. Thi-Kien Dao & Tien-Szu Pan & Trong-The Nguyen & Jeng-Shyang Pan, 2018. "Parallel bat algorithm for optimizing makespan in job shop scheduling problems," Journal of Intelligent Manufacturing, Springer, vol. 29(2), pages 451-462, February.
    16. Gabriel H Greve & Kenneth M Hopkinson & Gary B Lamont, 2018. "Evolutionary sensor allocation for the Space Surveillance Network," The Journal of Defense Modeling and Simulation, , vol. 15(3), pages 303-322, July.
    17. Mauricio Resende, 2012. "Biased random-key genetic algorithms with applications in telecommunications," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 20(1), pages 130-153, April.
    18. Gonçalves, José Fernando & Wäscher, Gerhard, 2020. "A MIP model and a biased random-key genetic algorithm based approach for a two-dimensional cutting problem with defects," European Journal of Operational Research, Elsevier, vol. 286(3), pages 867-882.
    19. Julliany S. Brandão & Thiago F. Noronha & Celso C. Ribeiro, 2016. "A biased random-key genetic algorithm to maximize the number of accepted lightpaths in WDM optical networks," Journal of Global Optimization, Springer, vol. 65(4), pages 813-835, August.
    20. Jorge M. S. Valente & Maria R. A. Moreira & Alok Singh & Rui A. F. S. Alves, 2009. "Genetic algorithms for single machine scheduling with quadratic earliness and tardiness costs," FEP Working Papers 312, Universidade do Porto, Faculdade de Economia do Porto.

    More about this item

    Keywords

    Evolutionary Optimization; Genetic Algorithm; Optimization; Simulation;
    All these keywords.

    JEL classification:

    • C63 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Computational Techniques
    • C80 - Mathematical and Quantitative Methods - - Data Collection and Data Estimation Methodology; Computer Programs - - - General

    Statistics

    Access and download statistics

    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:anm:alpnmr:v:8:y:2020:i:1:p:43-58. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Bahadir Fatih Yildirim (email available below). General contact details of provider: https://www.alphanumericjournal.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.