IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v188y2008i1p57-75.html
   My bibliography  Save this article

An empirical study on similarity-based mating for evolutionary multiobjective combinatorial optimization

Author

Listed:
  • Ishibuchi, Hisao
  • Narukawa, Kaname
  • Tsukamoto, Noritaka
  • Nojima, Yusuke

Abstract

No abstract is available for this item.

Suggested Citation

  • Ishibuchi, Hisao & Narukawa, Kaname & Tsukamoto, Noritaka & Nojima, Yusuke, 2008. "An empirical study on similarity-based mating for evolutionary multiobjective combinatorial optimization," European Journal of Operational Research, Elsevier, vol. 188(1), pages 57-75, July.
    • Handle: RePEc:eee:ejores:v:188:y:2008:i:1:p:57-75
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(07)00382-7
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. Jaszkiewicz, Andrzej, 2004. "On the computational efficiency of multiple objective metaheuristics. The knapsack problem case study," European Journal of Operational Research, Elsevier, vol. 158(2), pages 418-433, October.
    2. Jaszkiewicz, Andrzej, 2002. "Genetic local search for multi-objective combinatorial optimization," European Journal of Operational Research, Elsevier, vol. 137(1), pages 50-71, February.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Sahinkoc, H. Mert & Bilge, Ümit, 2022. "A reference set based many-objective co-evolutionary algorithm with an application to the knapsack problem," European Journal of Operational Research, Elsevier, vol. 300(2), pages 405-417.
    2. Goh, C.K. & Tan, K.C. & Liu, D.S. & Chiam, S.C., 2010. "A competitive and cooperative co-evolutionary approach to multi-objective particle swarm optimization algorithm design," European Journal of Operational Research, Elsevier, vol. 202(1), pages 42-54, April.
    3. Wang, Yujia & Yang, Yupu, 2010. "Particle swarm with equilibrium strategy of selection for multi-objective optimization," European Journal of Operational Research, Elsevier, vol. 200(1), pages 187-197, January.

    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. Bogdan Rębiasz, 2009. "A method for selecting an effective investment project portfolio," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 19(3), pages 95-117.
    2. 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.
    3. 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.
    4. Mei, Yi & Salim, Flora D. & Li, Xiaodong, 2016. "Efficient meta-heuristics for the Multi-Objective Time-Dependent Orienteering Problem," European Journal of Operational Research, Elsevier, vol. 254(2), pages 443-457.
    5. Xuhui Yu & Yin Feng & Cong He & Chang Liu, 2024. "Modeling and Optimization of Container Drayage Problem with Empty Container Constraints across Multiple Inland Depots," Sustainability, MDPI, vol. 16(12), pages 1-32, June.
    6. Lakmali Weerasena & Aniekan Ebiefung & Anthony Skjellum, 2022. "Design of a heuristic algorithm for the generalized multi-objective set covering problem," Computational Optimization and Applications, Springer, vol. 82(3), pages 717-751, July.
    7. Luo, Hao & Yang, Xuan & Kong, Xiang T.R., 2019. "A synchronized production-warehouse management solution for reengineering the online-offline integrated order fulfillment," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 122(C), pages 211-230.
    8. Calvete, Herminia I. & Galé, Carmen & Iranzo, José A., 2016. "MEALS: A multiobjective evolutionary algorithm with local search for solving the bi-objective ring star problem," European Journal of Operational Research, Elsevier, vol. 250(2), pages 377-388.
    9. Aristotelis E. Thanos & Nurcin Celik & Juan P. Sáenz, 2016. "An Evolutionary Sequential Sampling Algorithm for Multi-Objective Optimization," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 33(01), pages 1-21, February.
    10. Cerqueus, Audrey & Przybylski, Anthony & Gandibleux, Xavier, 2015. "Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems," European Journal of Operational Research, Elsevier, vol. 244(2), pages 417-433.
    11. Tadashi Yamada & Bona Frazila Russ & Jun Castro & Eiichi Taniguchi, 2009. "Designing Multimodal Freight Transport Networks: A Heuristic Approach and Applications," Transportation Science, INFORMS, vol. 43(2), pages 129-143, May.
    12. Lakmali Weerasena, 2022. "Advancing local search approximations for multiobjective combinatorial optimization problems," Journal of Combinatorial Optimization, Springer, vol. 43(3), pages 589-612, April.
    13. Yenisey, Mehmet Mutlu & Yagmahan, Betul, 2014. "Multi-objective permutation flow shop scheduling problem: Literature review, classification and current trends," Omega, Elsevier, vol. 45(C), pages 119-135.
    14. Peter Bober, 2011. "Comparison of Different Approaches to the Cutting Plan Scheduling," Quality Innovation Prosperity, Technical University of Košice, Department of integrated management, vol. 15(1).
    15. Justus Bonz, 2021. "Application of a multi-objective multi traveling salesperson problem with time windows," Public Transport, Springer, vol. 13(1), pages 35-57, March.
    16. Florios, Kostas & Mavrotas, George & Diakoulaki, Danae, 2010. "Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms," European Journal of Operational Research, Elsevier, vol. 203(1), pages 14-21, May.
    17. Burke, E.K. & Landa Silva, J.D., 2006. "The influence of the fitness evaluation method on the performance of multiobjective search algorithms," European Journal of Operational Research, Elsevier, vol. 169(3), pages 875-897, March.
    18. Ana Iannoni & Reinaldo Morabito & Cem Saydam, 2008. "A hypercube queueing model embedded into a genetic algorithm for ambulance deployment on highways," Annals of Operations Research, Springer, vol. 157(1), pages 207-224, January.
    19. Sato, Hiroyuki & Aguirre, Hernan E. & Tanaka, Kiyoshi, 2007. "Local dominance and local recombination in MOEAs on 0/1 multiobjective knapsack problems," European Journal of Operational Research, Elsevier, vol. 181(3), pages 1708-1723, September.
    20. Zouache, Djaafar & Moussaoui, Abdelouahab & Ben Abdelaziz, Fouad, 2018. "A cooperative swarm intelligence algorithm for multi-objective discrete optimization with application to the knapsack problem," European Journal of Operational Research, Elsevier, vol. 264(1), pages 74-88.

    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:eee:ejores:v:188:y:2008:i:1:p:57-75. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.