IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v131y2004i1p135-15810.1023-banor.0000039516.50069.5b.html
   My bibliography  Save this article

A Comparative Study of Multiple-Objective Metaheuristics on the Bi-Objective Set Covering Problem and the Pareto Memetic Algorithm

Author

Listed:
  • Andrzej Jaszkiewicz

Abstract

The paper describes a comparative study of multiple-objective metaheuristics on the bi-objective set covering problem. Ten representative methods based on genetic algorithms, multiple start local search, hybrid genetic algorithms and simulated annealing are evaluated in the computational experiment. Nine of the methods are well known from the literature. The paper introduces also a new hybrid genetic algorithm called Pareto memetic algorithm. The results of the experiment indicate very good performance of hybrid genetic algorithms, however, no algorithm was able to outperform all other methods on all instances. Furthermore, the results indicate that the performance of multiple-objective metaheuristics may differ radically even if the methods are based on the same single objective algorithm and use exactly the same problem-specific operators. Copyright Kluwer Academic Publishers 2004

Suggested Citation

  • Andrzej Jaszkiewicz, 2004. "A Comparative Study of Multiple-Objective Metaheuristics on the Bi-Objective Set Covering Problem and the Pareto Memetic Algorithm," Annals of Operations Research, Springer, vol. 131(1), pages 135-158, October.
    • Handle: RePEc:spr:annopr:v:131:y:2004:i:1:p:135-158:10.1023/b:anor.0000039516.50069.5b
    DOI: 10.1023/B:ANOR.0000039516.50069.5b
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/B:ANOR.0000039516.50069.5b
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1023/B:ANOR.0000039516.50069.5b?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.

    Citations

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


    Cited by:

    1. Andrzej Jaszkiewicz & Thibaut Lust, 2017. "Proper balance between search towards and along Pareto front: biobjective TSP case study," Annals of Operations Research, Springer, vol. 254(1), pages 111-130, July.
    2. 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.
    3. Jaszkiewicz, Andrzej & Zielniewicz, Piotr, 2009. "Pareto memetic algorithm with path relinking for bi-objective traveling salesperson problem," European Journal of Operational Research, Elsevier, vol. 193(3), pages 885-890, March.
    4. Florios, Kostas & Mavrotas, George, 2014. "Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems," MPRA Paper 105074, University Library of Munich, Germany.
    5. Lakmali Weerasena & Margaret M. Wiecek & Banu Soylu, 2017. "An algorithm for approximating the Pareto set of the multiobjective set covering problem," Annals of Operations Research, Springer, vol. 248(1), pages 493-514, January.
    6. Jordi Pereira & Igor Averbakh, 2013. "The Robust Set Covering Problem with interval data," Annals of Operations Research, Springer, vol. 207(1), pages 217-235, August.
    7. Mariano Frutos & Ana Olivera & Fernando Tohmé, 2010. "A memetic algorithm based on a NSGAII scheme for the flexible job-shop scheduling problem," Annals of Operations Research, Springer, vol. 181(1), pages 745-765, December.
    8. Dinçer Konur & Hadi Farhangi & Cihan H. Dagli, 2016. "A multi-objective military system of systems architecting problem with inflexible and flexible systems: formulation and solution methods," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 38(4), pages 967-1006, October.
    9. Tarik Chargui & Abdelghani Bekrar & Mohamed Reghioui & Damien Trentesaux, 2019. "Multi-Objective Sustainable Truck Scheduling in a Rail–Road Physical Internet Cross-Docking Hub Considering Energy Consumption," Sustainability, MDPI, vol. 11(11), pages 1-23, June.

    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:annopr:v:131:y:2004:i:1:p:135-158:10.1023/b:anor.0000039516.50069.5b. 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.