IDEAS home Printed from https://ideas.repec.org/a/vrs/organi/v50y2017i4p364-373n6.html
   My bibliography  Save this article

Multi-objective Optimization Algorithms with the Island Metaheuristic for Effective Project Management Problem Solving

Author

Listed:
  • Brester Christina

    (Reshetnev Siberian State University of Science and Technology, Institute of Computer Science and Telecommunications, 31 »Krasnoyarskiy Rabochiy« ave., Krasnoyarsk, 660037, Russian Federation)

  • Ryzhikov Ivan

    (Reshetnev Siberian State University of Science and Technology, Institute of Computer Science and Telecommunications, 31 »Krasnoyarskiy Rabochiy« ave., Krasnoyarsk, 660037, Russian Federation)

  • Semenkin Eugene

    (Reshetnev Siberian State University of Science and Technology, Institute of Computer Science and Telecommunications, 31 »Krasnoyarskiy Rabochiy« ave., Krasnoyarsk, 660037, Russian Federation)

Abstract

Background and Purpose: In every organization, project management raises many different decision-making problems, a large proportion of which can be efficiently solved using specific decision-making support systems. Yet such kinds of problems are always a challenge since there is no time-efficient or computationally efficient algorithm to solve them as a result of their complexity. In this study, we consider the problem of optimal financial investment. In our solution, we take into account the following organizational resource and project characteristics: profits, costs and risks.Design/Methodology/Approach: The decision-making problem is reduced to a multi-criteria 0-1 knapsack problem. This implies that we need to find a non-dominated set of alternative solutions, which are a trade-off between maximizing incomes and minimizing risks. At the same time, alternatives must satisfy constraints. This leads to a constrained two-criterion optimization problem in the Boolean space. To cope with the peculiarities and high complexity of the problem, evolution-based algorithms with an island meta-heuristic are applied as an alternative to conventional techniques.Results: The problem in hand was reduced to a two-criterion unconstrained extreme problem and solved with different evolution-based multi-objective optimization heuristics. Next, we applied a proposed meta-heuristic combining the particular algorithms and causing their interaction in a cooperative and collaborative way. The obtained results showed that the island heuristic outperformed the original ones based on the values of a specific metric, thus showing the representativeness of Pareto front approximations. Having more representative approximations, decision-makers have more alternative project portfolios corresponding to different risk and profit estimations. Since these criteria are conflicting, when choosing an alternative with an estimated high profit, decision-makers follow a strategy with an estimated high risk and vice versa.Conclusion: In the present paper, the project portfolio decision-making problem was reduced to a 0-1 knapsack constrained multi-objective optimization problem. The algorithm investigation confirms that the use of the island meta-heuristic significantly improves the performance of genetic algorithms, thereby providing an efficient tool for Financial Responsibility Centres Management.

Suggested Citation

  • Brester Christina & Ryzhikov Ivan & Semenkin Eugene, 2017. "Multi-objective Optimization Algorithms with the Island Metaheuristic for Effective Project Management Problem Solving," Organizacija, Sciendo, vol. 50(4), pages 364-373, December.
  • Handle: RePEc:vrs:organi:v:50:y:2017:i:4:p:364-373:n:6
    DOI: 10.1515/orga-2017-0027
    as

    Download full text from publisher

    File URL: https://doi.org/10.1515/orga-2017-0027
    Download Restriction: no

    File URL: https://libkey.io/10.1515/orga-2017-0027?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
    ---><---

    References listed on IDEAS

    as
    1. 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.
    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. Tsionas, Mike G., 2019. "Multi-objective optimization using statistical models," European Journal of Operational Research, Elsevier, vol. 276(1), pages 364-378.
    2. Przybylski, Anthony & Gandibleux, Xavier, 2017. "Multi-objective branch and bound," European Journal of Operational Research, Elsevier, vol. 260(3), pages 856-872.
    3. García-Martínez, C. & Rodriguez, F.J. & Lozano, M., 2014. "Tabu-enhanced iterated greedy algorithm: A case study in the quadratic multiple knapsack problem," European Journal of Operational Research, Elsevier, vol. 232(3), pages 454-463.
    4. Mauricio Diéguez & Jaime Bustos & Carlos Cares, 2020. "Mapping the variations for implementing information security controls to their operational research solutions," Information Systems and e-Business Management, Springer, vol. 18(2), pages 157-186, June.
    5. Harris, Irina & Mumford, Christine L. & Naim, Mohamed M., 2014. "A hybrid multi-objective approach to capacitated facility location with flexible store allocation for green logistics modeling," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 66(C), pages 1-22.
    6. Cacchiani, Valentina & D’Ambrosio, Claudia, 2017. "A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs," European Journal of Operational Research, Elsevier, vol. 260(3), pages 920-933.
    7. 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.
    8. 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.
    9. 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.
    10. Hedieh Sajedi & Seyedeh Fatemeh Razavi, 2017. "DGSA: discrete gravitational search algorithm for solving knapsack problem," Operational Research, Springer, vol. 17(2), pages 563-591, July.
    11. 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.
    12. 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.
    13. Mavrotas, George & Florios, Kostas & Figueira, José Rui, 2015. "An improved version of a core based algorithm for the multi-objective multi-dimensional knapsack problem: A computational study and comparison with meta-heuristics," Applied Mathematics and Computation, Elsevier, vol. 270(C), pages 25-43.
    14. Bas, Esra, 2011. "An investment plan for preventing child injuries using risk priority number of failure mode and effects analysis methodology and a multi-objective, multi-dimensional mixed 0-1 knapsack model," Reliability Engineering and System Safety, Elsevier, vol. 96(7), pages 748-756.
    15. Audrey Cerqueus & Xavier Gandibleux & Anthony Przybylski & Frédéric Saubion, 2017. "On branching heuristics for the bi-objective 0/1 unidimensional knapsack problem," Journal of Heuristics, Springer, vol. 23(5), pages 285-319, October.
    16. Sune Lauth Gadegaard & Lars Relund Nielsen & Matthias Ehrgott, 2019. "Bi-objective Branch-and-Cut Algorithms Based on LP Relaxation and Bound Sets," INFORMS Journal on Computing, INFORMS, vol. 31(4), pages 790-804, October.
    17. Madjid Tavana & Kaveh Khalili-Damghani & Amir-Reza Abtahi, 2013. "A fuzzy multidimensional multiple-choice knapsack model for project portfolio selection using an evolutionary algorithm," Annals of Operations Research, Springer, vol. 206(1), pages 449-483, July.
    18. Mauricio Diéguez & Jaime Bustos & Carlos Cares, 0. "Mapping the variations for implementing information security controls to their operational research solutions," Information Systems and e-Business Management, Springer, vol. 0, pages 1-30.

    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:vrs:organi:v:50:y:2017:i:4:p:364-373:n: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: Peter Golla (email available below). General contact details of provider: https://www.sciendo.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.