IDEAS home Printed from https://ideas.repec.org/a/spr/eurjco/v6y2018i2d10.1007_s13675-017-0090-6.html
   My bibliography  Save this article

Column generation algorithms for bi-objective combinatorial optimization problems with a min–max objective

Author

Listed:
  • Christian Artigues

    (Université de Toulouse)

  • Nicolas Jozefowiez

    (Université de Lorraine)

  • Boadu M. Sarpong

    (Université de Toulouse)

Abstract

Many practical combinatorial optimization problems can be described by integer linear programs having an exponential number of variables, and they are efficiently solved by column generation algorithms. For these problems, column generation is used to compute good dual bounds that can be incorporated in branch-and-price algorithms. Recent research has concentrated on describing lower and upper bounds of bi-objective and general multi-objective problems with sets of points (bound sets). An important issue to address when computing a bound set by column generation is how to efficiently search for columns corresponding to each point of the bound set. In this work, we propose a generalized column generation scheme to compute bound sets for bi-objective combinatorial optimization problems. We present specific implementations of the generalized scheme for the case where one objective is a min–max function by using a variant of the $$\varepsilon $$ ε -constraint method to efficiently model these problems. The proposed strategies are applied to a bi-objective extension of the multi-vehicle covering tour problem, and their relative performances based on different criteria are compared. The results show that good bound sets can be obtained in reasonable times if columns are efficiently managed. The variant of the $$\varepsilon $$ ε -constraint presented is also better than a standard $$\varepsilon $$ ε -constraint method in terms of the quality of the bound sets.

Suggested Citation

  • Christian Artigues & Nicolas Jozefowiez & Boadu M. Sarpong, 2018. "Column generation algorithms for bi-objective combinatorial optimization problems with a min–max objective," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 6(2), pages 117-142, June.
  • Handle: RePEc:spr:eurjco:v:6:y:2018:i:2:d:10.1007_s13675-017-0090-6
    DOI: 10.1007/s13675-017-0090-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s13675-017-0090-6
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s13675-017-0090-6?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. Current, John R. & Schilling, David A., 1994. "The median tour and maximal covering tour problems: Formulations and heuristics," European Journal of Operational Research, Elsevier, vol. 73(1), pages 114-126, February.
    2. Bérubé, Jean-François & Gendreau, Michel & Potvin, Jean-Yves, 2009. "An exact [epsilon]-constraint method for bi-objective combinatorial optimization problems: Application to the Traveling Salesman Problem with Profits," European Journal of Operational Research, Elsevier, vol. 194(1), pages 39-50, April.
    3. Michel Gendreau & Gilbert Laporte & Frédéric Semet, 1997. "The Covering Tour Problem," Operations Research, INFORMS, vol. 45(4), pages 568-576, August.
    4. Peter C. Fishburn, 1967. "Letter to the Editor—Additive Utilities with Incomplete Product Sets: Application to Priorities and Assignments," Operations Research, INFORMS, vol. 15(3), pages 537-542, June.
    5. 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.
    6. Hà, Minh Hoàng & Bostel, Nathalie & Langevin, André & Rousseau, Louis-Martin, 2013. "An exact algorithm and a metaheuristic for the multi-vehicle covering tour problem with a constraint on the number of vertices," European Journal of Operational Research, Elsevier, vol. 226(2), pages 211-220.
    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. Glize, Estèle & Roberti, Roberto & Jozefowiez, Nicolas & Ngueveu, Sandra Ulrich, 2020. "Exact methods for mono-objective and Bi-Objective Multi-Vehicle Covering Tour Problems," European Journal of Operational Research, Elsevier, vol. 283(3), pages 812-824.
    2. Daş, Gülesin Sena & Gzara, Fatma & Stützle, Thomas, 2020. "A review on airport gate assignment problems: Single versus multi objective approaches," Omega, Elsevier, vol. 92(C).
    3. Salman, F. Sibel & Yücel, Eda & Kayı, İlker & Turper-Alışık, Sedef & Coşkun, Abdullah, 2021. "Modeling mobile health service delivery to Syrian migrant farm workers using call record data," Socio-Economic Planning Sciences, Elsevier, vol. 77(C).

    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. Glize, Estèle & Roberti, Roberto & Jozefowiez, Nicolas & Ngueveu, Sandra Ulrich, 2020. "Exact methods for mono-objective and Bi-Objective Multi-Vehicle Covering Tour Problems," European Journal of Operational Research, Elsevier, vol. 283(3), pages 812-824.
    2. Fischer, Vera & Pacheco Paneque, Meritxell & Legrain, Antoine & Bürgy, Reinhard, 2024. "A capacitated multi-vehicle covering tour problem on a road network and its application to waste collection," European Journal of Operational Research, Elsevier, vol. 315(1), pages 338-353.
    3. Glock, Katharina & Meyer, Anne, 2023. "Spatial coverage in routing and path planning problems," European Journal of Operational Research, Elsevier, vol. 305(1), pages 1-20.
    4. Huili Zhang & Yinfeng Xu, 2018. "Online covering salesman problem," Journal of Combinatorial Optimization, Springer, vol. 35(3), pages 941-954, April.
    5. Eda Yücel & F. Sibel Salman & Burçin Bozkaya & Cemre Gökalp, 2020. "A data-driven optimization framework for routing mobile medical facilities," Annals of Operations Research, Springer, vol. 291(1), pages 1077-1102, August.
    6. Ivan Contreras & Moayad Tanash & Navneet Vidyarthi, 2017. "Exact and heuristic approaches for the cycle hub location problem," Annals of Operations Research, Springer, vol. 258(2), pages 655-677, November.
    7. Nicolas Jozefowiez & Gilbert Laporte & Frédéric Semet, 2012. "A Generic Branch-and-Cut Algorithm for Multiobjective Optimization Problems: Application to the Multilabel Traveling Salesman Problem," INFORMS Journal on Computing, INFORMS, vol. 24(4), pages 554-564, November.
    8. Lei, Chao & Lin, Wei-Hua & Miao, Lixin, 2014. "A multicut L-shaped based algorithm to solve a stochastic programming model for the mobile facility routing and scheduling problem," European Journal of Operational Research, Elsevier, vol. 238(3), pages 699-710.
    9. Afsaneh Amiri & Majid Salari, 2019. "Time-constrained maximal covering routing problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 41(2), pages 415-468, June.
    10. Veenstra, Marjolein & Roodbergen, Kees Jan & Coelho, Leandro C. & Zhu, Stuart X., 2018. "A simultaneous facility location and vehicle routing problem arising in health care logistics in the Netherlands," European Journal of Operational Research, Elsevier, vol. 268(2), pages 703-715.
    11. Contreras, Ivan & Fernández, Elena, 2012. "General network design: A unified view of combined location and network design problems," European Journal of Operational Research, Elsevier, vol. 219(3), pages 680-697.
    12. Karaoğlan, İsmail & Erdoğan, Güneş & Koç, Çağrı, 2018. "The Multi-Vehicle Probabilistic Covering Tour Problem," European Journal of Operational Research, Elsevier, vol. 271(1), pages 278-287.
    13. Eduardo Álvarez-Miranda & Markus Sinnl, 2020. "A branch-and-cut algorithm for the maximum covering cycle problem," Annals of Operations Research, Springer, vol. 284(2), pages 487-499, January.
    14. Allahyari, Somayeh & Salari, Majid & Vigo, Daniele, 2015. "A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 242(3), pages 756-768.
    15. Nathan Adelgren & Akshay Gupte, 2022. "Branch-and-Bound for Biobjective Mixed-Integer Linear Programming," INFORMS Journal on Computing, INFORMS, vol. 34(2), pages 909-933, March.
    16. Elfe Buluc & Meltem Peker & Bahar Y. Kara & Manoj Dora, 2022. "Covering vehicle routing problem: application for mobile child friendly spaces for refugees," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 44(2), pages 461-484, June.
    17. David A. Flores-Garza & M. Angélica Salazar-Aguilar & Sandra Ulrich Ngueveu & Gilbert Laporte, 2017. "The multi-vehicle cumulative covering tour problem," Annals of Operations Research, Springer, vol. 258(2), pages 761-780, November.
    18. Katharina Glock & Anne Meyer, 2020. "Mission Planning for Emergency Rapid Mapping with Drones," Transportation Science, INFORMS, vol. 54(2), pages 534-560, March.
    19. Markus Leitner & Ivana Ljubić & Markus Sinnl, 2015. "A Computational Study of Exact Approaches for the Bi-Objective Prize-Collecting Steiner Tree Problem," INFORMS Journal on Computing, INFORMS, vol. 27(1), pages 118-134, February.
    20. Naji-Azimi, Z. & Renaud, J. & Ruiz, A. & Salari, M., 2012. "A covering tour approach to the location of satellite distribution centers to supply humanitarian aid," European Journal of Operational Research, Elsevier, vol. 222(3), pages 596-605.

    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:eurjco:v:6:y:2018:i:2:d:10.1007_s13675-017-0090-6. 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.