IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v57y2013i2p347-365.html
   My bibliography  Save this article

Finding all nondominated points of multi-objective integer programs

Author

Listed:
  • Banu Lokman
  • Murat Köksalan

Abstract

We develop exact algorithms for multi-objective integer programming (MIP) problems. The algorithms iteratively generate nondominated points and exclude the regions that are dominated by the previously-generated nondominated points. One algorithm generates new points by solving models with additional binary variables and constraints. The other algorithm employs a search procedure and solves a number of models to find the next point avoiding any additional binary variables. Both algorithms guarantee to find all nondominated points for any MIP problem. We test the performance of the algorithms on randomly-generated instances of the multi-objective knapsack, multi-objective shortest path and multi-objective spanning tree problems. The computational results show that the algorithms work well. Copyright Springer Science+Business Media, LLC. 2013

Suggested Citation

  • Banu Lokman & Murat Köksalan, 2013. "Finding all nondominated points of multi-objective integer programs," Journal of Global Optimization, Springer, vol. 57(2), pages 347-365, October.
    • Handle: RePEc:spr:jglopt:v:57:y:2013:i:2:p:347-365
    DOI: 10.1007/s10898-012-9955-7
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10898-012-9955-7
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10898-012-9955-7?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. Laumanns, Marco & Thiele, Lothar & Zitzler, Eckart, 2006. "An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method," European Journal of Operational Research, Elsevier, vol. 169(3), pages 932-942, March.
    2. Ramos, R. M. & Alonso, S. & Sicilia, J. & Gonzalez, C., 1998. "The problem of the optimal biobjective spanning tree," European Journal of Operational Research, Elsevier, vol. 111(3), pages 617-628, December.
    3. F. Guerriero & R. Musmanno, 2001. "Label Correcting Methods to Solve Multicriteria Shortest Path Problems," Journal of Optimization Theory and Applications, Springer, vol. 111(3), pages 589-613, December.
    4. Sylva, John & Crema, Alejandro, 2007. "A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs," European Journal of Operational Research, Elsevier, vol. 180(3), pages 1011-1027, August.
    5. Selcen (Pamuk) Phelps & Murat Köksalan, 2003. "An Interactive Evolutionary Metaheuristic for Multiobjective Combinatorial Optimization," Management Science, INFORMS, vol. 49(12), pages 1726-1738, December.
    6. Matthias Ehrgott & Xavier Gandibleux, 2004. "Approximative solution methods for multiobjective combinatorial optimization," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 12(1), pages 1-63, June.
    7. Sylva, John & Crema, Alejandro, 2004. "A method for finding the set of non-dominated vectors for multiple objective integer linear programs," European Journal of Operational Research, Elsevier, vol. 158(1), pages 46-55, October.
    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. Özarık, Sami Serkan & Lokman, Banu & Köksalan, Murat, 2020. "Distribution based representative sets for multi-objective integer programs," European Journal of Operational Research, Elsevier, vol. 284(2), pages 632-643.
    2. Özlen, Melih & Azizoglu, Meral, 2009. "Multi-objective integer programming: A general approach for generating all non-dominated solutions," European Journal of Operational Research, Elsevier, vol. 199(1), pages 25-35, November.
    3. Ceyhan, Gökhan & Köksalan, Murat & Lokman, Banu, 2019. "Finding a representative nondominated set for multi-objective mixed integer programs," European Journal of Operational Research, Elsevier, vol. 272(1), pages 61-77.
    4. Mesquita-Cunha, Mariana & Figueira, José Rui & Barbosa-Póvoa, Ana Paula, 2023. "New ϵ−constraint methods for multi-objective integer linear programming: A Pareto front representation approach," European Journal of Operational Research, Elsevier, vol. 306(1), pages 286-307.
    5. Holzmann, Tim & Smith, J.C., 2018. "Solving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizations," European Journal of Operational Research, Elsevier, vol. 271(2), pages 436-449.
    6. Mavrotas, George & Florios, Kostas, 2013. "An improved version of the augmented epsilon-constraint method (AUGMECON2) for finding the exact Pareto set in Multi-Objective Integer Programming problems," MPRA Paper 105034, University Library of Munich, Germany.
    7. 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.
    8. Natashia Boland & Hadi Charkhgard & Martin Savelsbergh, 2015. "A Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box Method," INFORMS Journal on Computing, INFORMS, vol. 27(4), pages 735-754, November.
    9. Rong, Aiying & Figueira, José Rui, 2014. "Dynamic programming algorithms for the bi-objective integer knapsack problem," European Journal of Operational Research, Elsevier, vol. 236(1), pages 85-99.
    10. 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.
    11. Lacour, Renaud, 2014. "Approches de résolution exacte et approchée en optimisation combinatoire multi-objectif, application au problème de l'arbre couvrant de poids minimal," Economics Thesis from University Paris Dauphine, Paris Dauphine University, number 123456789/14806 edited by Vanderpooten, Daniel.
    12. Tobias Kuhn & Stefan Ruzika, 2017. "A coverage-based Box-Algorithm to compute a representation for optimization problems with three objective functions," Journal of Global Optimization, Springer, vol. 67(3), pages 581-600, March.
    13. Doğan, Ilgın & Lokman, Banu & Köksalan, Murat, 2022. "Representing the nondominated set in multi-objective mixed-integer programs," European Journal of Operational Research, Elsevier, vol. 296(3), pages 804-818.
    14. Melih Ozlen & Benjamin A. Burton & Cameron A. G. MacRae, 2014. "Multi-Objective Integer Programming: An Improved Recursive Algorithm," Journal of Optimization Theory and Applications, Springer, vol. 160(2), pages 470-482, February.
    15. Klamroth, Kathrin & Lacour, Renaud & Vanderpooten, Daniel, 2015. "On the representation of the search region in multi-objective optimization," European Journal of Operational Research, Elsevier, vol. 245(3), pages 767-778.
    16. Burdett, Robert & Kozan, Erhan, 2016. "A multi-criteria approach for hospital capacity analysis," European Journal of Operational Research, Elsevier, vol. 255(2), pages 505-521.
    17. S. Razavyan, 2016. "A Method for Generating a Well-Distributed Pareto Set in Multiple Objective Mixed Integer Linear Programs Based on the Decision Maker’s Initial Aspiration Level," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 33(04), pages 1-23, August.
    18. Francis Sourd & Olivier Spanjaard, 2008. "A Multiobjective Branch-and-Bound Framework: Application to the Biobjective Spanning Tree Problem," INFORMS Journal on Computing, INFORMS, vol. 20(3), pages 472-484, August.
    19. Kirlik, Gokhan & Sayın, Serpil, 2014. "A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems," European Journal of Operational Research, Elsevier, vol. 232(3), pages 479-488.
    20. Jorge, Jesús M., 2009. "An algorithm for optimizing a linear function over an integer efficient set," European Journal of Operational Research, Elsevier, vol. 195(1), pages 98-103, May.

    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:jglopt:v:57:y:2013:i:2:p:347-365. 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: 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.