IDEAS home Printed from https://ideas.repec.org/a/wsi/apjorx/v30y2013i03ns0217595913400010.html
   My bibliography  Save this article

Hybrid Coding Pso-Aco Co-Evolutionary Algorithm For Solving Mixed-Integer Programming Problems

Author

Listed:
  • YUELIN GAO

    (School of Information and Computation Science, Beifang University for Nationalities, Yinchuan, 750021, P. R. China)

  • MIAOMIAO WANG

    (School of Information and Computation Science, Beifang University for Nationalities, Yinchuan, 750021, P. R. China)

Abstract

A co-evolutionary algorithm based on particle swarm optimization (PSO) and ant colony optimization (ACO) is given to solve the bound constrained mixed-integer programming problem (BCMIP). For the specificity of the problem, the hybrid coding includes the real coding and the integer coding. The real coding part is evolved by PSO while the integer coding part is evolved by ACO. The entire population is co-evolved by PSO and ACO. Numerical experiments show that the proposed algorithm is feasible and effective to solve BCMIP. We also obtain satisfactory result to solve MIP when the proposed algorithm is combined with penalty function method.

Suggested Citation

  • Yuelin Gao & Miaomiao Wang, 2013. "Hybrid Coding Pso-Aco Co-Evolutionary Algorithm For Solving Mixed-Integer Programming Problems," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 30(03), pages 1-13.
    • Handle: RePEc:wsi:apjorx:v:30:y:2013:i:03:n:s0217595913400010
    DOI: 10.1142/S0217595913400010
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0217595913400010
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0217595913400010?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:wsi:apjorx:v:30:y:2013:i:03:n:s0217595913400010. 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/apjor/apjor.shtml .

    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.