IDEAS home Printed from https://ideas.repec.org/a/spr/comgts/v20y2023i1d10.1007_s10287-023-00442-6.html
   My bibliography  Save this article

A criterion space decomposition approach to generalized tri-objective tactical resource allocation

Author

Listed:
  • Sunney Fotedar

    (Chalmers University of Technology and University of Gothenburg)

  • Ann-Brith Strömberg

    (Chalmers University of Technology and University of Gothenburg)

  • Torgny Almgren

    (GKN Aerospace Sweden AB)

  • Stefan Cedergren

    (GKN Aerospace Sweden AB)

Abstract

We present a tri-objective mixed-integer linear programming model of the tactical resource allocation problem with inventories, called the generalized tactical resource allocation problem (GTRAP). We propose a specialized criterion space decomposition strategy, in which the projected two-dimensional criterion space is partitioned and the corresponding sub-problems are solved in parallel by application of the quadrant shrinking method (QSM) (Boland in Eur J Oper Res 260(3):873–885, 2017) for identifying non-dominated points. To obtain an efficient implementation of the parallel variant of the QSM we suggest some modifications to reduce redundancies. Our approach is tailored for the GTRAP and is shown to have superior computational performance as compared to using the QSM without parallelization when applied to industrial instances.

Suggested Citation

  • Sunney Fotedar & Ann-Brith Strömberg & Torgny Almgren & Stefan Cedergren, 2023. "A criterion space decomposition approach to generalized tri-objective tactical resource allocation," Computational Management Science, Springer, vol. 20(1), pages 1-28, December.
    • Handle: RePEc:spr:comgts:v:20:y:2023:i:1:d:10.1007_s10287-023-00442-6
    DOI: 10.1007/s10287-023-00442-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10287-023-00442-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/s10287-023-00442-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. Dächert, Kerstin & Klamroth, Kathrin & Lacour, Renaud & Vanderpooten, Daniel, 2017. "Efficient computation of the search region in multi-objective optimization," European Journal of Operational Research, Elsevier, vol. 260(3), pages 841-855.
    2. James R. Bradley & Peter W. Glynn, 2002. "Managing Capacity and Inventory Jointly in Manufacturing Systems," Management Science, INFORMS, vol. 48(2), pages 273-288, February.
    3. 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.
    4. Boland, Natashia & Charkhgard, Hadi & Savelsbergh, Martin, 2017. "The Quadrant Shrinking Method: A simple and efficient algorithm for solving tri-objective integer programs," European Journal of Operational Research, Elsevier, vol. 260(3), pages 873-885.
    5. Lemesre, J. & Dhaenens, C. & Talbi, E.G., 2007. "An exact parallel method for a bi-objective permutation flowshop problem," European Journal of Operational Research, Elsevier, vol. 177(3), pages 1641-1655, March.
    6. 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.
    7. Nourelfath, Mustapha, 2011. "Service level robustness in stochastic production planning under random machine breakdowns," European Journal of Operational Research, Elsevier, vol. 212(1), pages 81-88, July.
    8. Wei, Cansheng & Li, Yongjian & Cai, Xiaoqiang, 2011. "Robust optimal policies of production and inventory with uncertain returns and demand," International Journal of Production Economics, Elsevier, vol. 134(2), pages 357-367, December.
    9. 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.
    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. 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.
    2. Ozgu Turgut & Evrim Dalkiran & Alper E. Murat, 2019. "An exact parallel objective space decomposition algorithm for solving multi-objective integer programming problems," Journal of Global Optimization, Springer, vol. 75(1), pages 35-62, September.
    3. 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.
    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. De Santis, Marianna & Grani, Giorgio & Palagi, Laura, 2020. "Branching with hyperplanes in the criterion space: The frontier partitioner algorithm for biobjective integer programming," European Journal of Operational Research, Elsevier, vol. 283(1), pages 57-69.
    6. 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.
    7. Satya Tamby & Daniel Vanderpooten, 2021. "Enumeration of the Nondominated Set of Multiobjective Discrete Optimization Problems," INFORMS Journal on Computing, INFORMS, vol. 33(1), pages 72-85, January.
    8. David Bergman & Merve Bodur & Carlos Cardonha & Andre A. Cire, 2022. "Network Models for Multiobjective Discrete Optimization," INFORMS Journal on Computing, INFORMS, vol. 34(2), pages 990-1005, March.
    9. Boland, Natashia & Charkhgard, Hadi & Savelsbergh, Martin, 2019. "Preprocessing and cut generation techniques for multi-objective binary programming," European Journal of Operational Research, Elsevier, vol. 274(3), pages 858-875.
    10. Pham Thi Hoai & Hoai An Le Thi & Nguyen Canh Nam, 2021. "Half-open polyblock for the representation of the search region in multiobjective optimization problems: its application and computational aspects," 4OR, Springer, vol. 19(1), pages 41-70, March.
    11. Ö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.
    12. Forget, Nicolas & Gadegaard, Sune Lauth & Nielsen, Lars Relund, 2022. "Warm-starting lower bound set computations for branch-and-bound algorithms for multi objective integer linear programs," European Journal of Operational Research, Elsevier, vol. 302(3), pages 909-924.
    13. Dächert, Kerstin & Klamroth, Kathrin & Lacour, Renaud & Vanderpooten, Daniel, 2017. "Efficient computation of the search region in multi-objective optimization," European Journal of Operational Research, Elsevier, vol. 260(3), pages 841-855.
    14. 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.
    15. Kerstin Dächert & Ria Grindel & Elisabeth Leoff & Jonas Mahnkopp & Florian Schirra & Jörg Wenzel, 2022. "Multicriteria asset allocation in practice," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 44(2), pages 349-373, June.
    16. Dukkanci, Okan & Karsu, Özlem & Kara, Bahar Y., 2022. "Planning sustainable routes: Economic, environmental and welfare concerns," European Journal of Operational Research, Elsevier, vol. 301(1), pages 110-123.
    17. Gabriele Eichfelder & Peter Kirst & Laura Meng & Oliver Stein, 2021. "A general branch-and-bound framework for continuous global multiobjective optimization," Journal of Global Optimization, Springer, vol. 80(1), pages 195-227, May.
    18. 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.
    19. Hartillo-Hermoso, María Isabel & Jiménez-Tafur, Haydee & Ucha-Enríquez, José María, 2020. "An exact algebraic ϵ-constraint method for bi-objective linear integer programming based on test sets," European Journal of Operational Research, Elsevier, vol. 282(2), pages 453-463.
    20. 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.

    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:comgts:v:20:y:2023:i:1:d:10.1007_s10287-023-00442-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.