IDEAS home Printed from https://ideas.repec.org/a/taf/gcmbxx/v12y2009i4p407-413.html
   My bibliography  Save this article

A multi-objective evolutionary algorithm for protein structure prediction with immune operators

Author

Listed:
  • M.V. Judy
  • K.S. Ravichandran
  • K. Murugesan

Abstract

Genetic algorithms (GA) are often well suited for optimisation problems involving several conflicting objectives. It is more suitable to model the protein structure prediction problem as a multi-objective optimisation problem since the potential energy functions used in the literature to evaluate the conformation of a protein are based on the calculations of two different interaction energies: local (bond atoms) and non-local (non-bond atoms) and experiments have shown that those types of interactions are in conflict, by using the potential energy function, Chemistry at Harvard Macromolecular Mechanics. In this paper, we have modified the immune inspired Pareto archived evolutionary strategy (I-PAES) algorithm and denoted it as MI-PAES. It can effectively exploit some prior knowledge about the hydrophobic interactions, which is one of the most important driving forces in protein folding to make vaccines. The proposed MI-PAES is comparable with other evolutionary algorithms proposed in literature, both in terms of best solution found and the computational time and often results in much better search ability than that of the canonical GA.

Suggested Citation

  • M.V. Judy & K.S. Ravichandran & K. Murugesan, 2009. "A multi-objective evolutionary algorithm for protein structure prediction with immune operators," Computer Methods in Biomechanics and Biomedical Engineering, Taylor & Francis Journals, vol. 12(4), pages 407-413.
  • Handle: RePEc:taf:gcmbxx:v:12:y:2009:i:4:p:407-413
    DOI: 10.1080/10255840802649715
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/10255840802649715
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/10255840802649715?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.

    References listed on IDEAS

    as
    1. Jones, D. F. & Mirrazavi, S. K. & Tamiz, M., 2002. "Multi-objective meta-heuristics: An overview of the current state-of-the-art," European Journal of Operational Research, Elsevier, vol. 137(1), pages 1-9, February.
    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. Schweiger, Katharina & Sahamie, Ramin, 2013. "A hybrid Tabu Search approach for the design of a paper recycling network," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 50(C), pages 98-119.
    2. Surafel Luleseged Tilahun & Mohamed A. Tawhid, 2019. "Swarm hyperheuristic framework," Journal of Heuristics, Springer, vol. 25(4), pages 809-836, October.
    3. T. Gómez & M. Hernández & J. Molina & M. León & E. Aldana & R. Caballero, 2011. "A multiobjective model for forest planning with adjacency constraints," Annals of Operations Research, Springer, vol. 190(1), pages 75-92, October.
    4. Frota Neto, J. Quariguasi & Bloemhof-Ruwaard, J.M. & van Nunen, J.A.E.E. & van Heck, E., 2008. "Designing and evaluating sustainable logistics networks," International Journal of Production Economics, Elsevier, vol. 111(2), pages 195-208, February.
    5. Hernandez, M. & Gómez, T. & Molina, J. & León, M.A. & Caballero, R., 2014. "Efficiency in forest management: A multiobjective harvest scheduling model," Journal of Forest Economics, Elsevier, vol. 20(3), pages 236-251.
    6. Juan Villegas & Fernando Palacios & Andrés Medaglia, 2006. "Solution methods for the bi-objective (cost-coverage) unconstrained facility location problem with an illustrative example," Annals of Operations Research, Springer, vol. 147(1), pages 109-141, October.
    7. Selçuklu, Saltuk Buğra & Coit, David W. & Felder, Frank A., 2020. "Pareto uncertainty index for evaluating and comparing solutions for stochastic multiple objective problems," European Journal of Operational Research, Elsevier, vol. 284(2), pages 644-659.
    8. Xiaofeng Lv & Deyun Zhou & Yongchuan Tang & Ling Ma, 2018. "An Improved Test Selection Optimization Model Based on Fault Ambiguity Group Isolation and Chaotic Discrete PSO," Complexity, Hindawi, vol. 2018, pages 1-10, January.
    9. Xiaoya Ma & Xiang Zhao, 2015. "Land Use Allocation Based on a Multi-Objective Artificial Immune Optimization Model: An Application in Anlu County, China," Sustainability, MDPI, vol. 7(11), pages 1-20, November.
    10. Gang Chen & Liping Jiang, 2016. "Managing customer arrivals with time windows: a case of truck arrivals at a congested container terminal," Annals of Operations Research, Springer, vol. 244(2), pages 349-365, September.
    11. Arroyo, Jose Elias Claudio & Armentano, Vinicius Amaral, 2005. "Genetic local search for multi-objective flowshop scheduling problems," European Journal of Operational Research, Elsevier, vol. 167(3), pages 717-738, December.
    12. Nasr, Eman S. & Kilgour, Marc D. & Noori, Hamid, 2015. "Strategizing niceness in co-opetition: The case of knowledge exchange in supply chain innovation projects," European Journal of Operational Research, Elsevier, vol. 244(3), pages 845-854.
    13. Lee, Sangkeum & Cho, Hong-Yeon & Har, Dongsoo, 2018. "Operation optimization with jointly controlled modules powered by hybrid energy source: A case study of desalination," Renewable and Sustainable Energy Reviews, Elsevier, vol. 81(P2), pages 3070-3080.
    14. Choobineh, F. Fred & Mohebbi, Esmail & Khoo, Hansen, 2006. "A multi-objective tabu search for a single-machine scheduling problem with sequence-dependent setup times," European Journal of Operational Research, Elsevier, vol. 175(1), pages 318-337, November.
    15. Julian Molina & Manuel Laguna & Rafael Martí & Rafael Caballero, 2007. "SSPMO: A Scatter Tabu Search Procedure for Non-Linear Multiobjective Optimization," INFORMS Journal on Computing, INFORMS, vol. 19(1), pages 91-100, February.
    16. Shyamal Gondkar & Sivakumar Sreeramagiri & Edwin Zondervan, 2012. "Methodology for Assessment and Optimization of Industrial Eco-Systems," Challenges, MDPI, vol. 3(1), pages 1-21, June.
    17. Tom Rihm & Philipp Baumann, 2018. "Staff assignment with lexicographically ordered acceptance levels," Journal of Scheduling, Springer, vol. 21(2), pages 167-189, April.
    18. Rong, Aiying & Figueira, José Rui, 2013. "A reduction dynamic programming algorithm for the bi-objective integer knapsack problem," European Journal of Operational Research, Elsevier, vol. 231(2), pages 299-313.
    19. J E C Arroyo & V A Armentano, 2004. "A partial enumeration heuristic for multi-objective flowshop scheduling problems," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(9), pages 1000-1007, September.
    20. Yu, Shiwei & Zheng, Shuhong & Gao, Shiwei & Yang, Juan, 2017. "A multi-objective decision model for investment in energy savings and emission reductions in coal mining," European Journal of Operational Research, Elsevier, vol. 260(1), pages 335-347.

    More about this item

    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:taf:gcmbxx:v:12:y:2009:i:4:p:407-413. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/gcmb .

    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.