Skip to main content
SpringerLink
Log in

New Multiobjective Metaheuristic Solution Procedures for Capital Investment Planning

  • Published:
Journal of Heuristics Aims and scope Submit manuscript

Abstract

Capital investment planning is a periodic management task that is particularly challenging in the presence of multiple objectives as trade-offs have to be made with respect to the preferences of the decision-makers. The underlying mathematical model is a multiobjective combinatorial optimization problem that is NP-hard. One way to tackle this problem is first to determine the set of all efficient portfolios and then to explore this set in order to identify a final preferred portfolio. In this study, we developed heuristic procedures to find efficient portfolios because it is impossible to enumerate all of them within a reasonable computation time for practical problems. We first added a neighborhood search routine to the Pareto Ant Colony Optimization (P-ACO) procedure to improve its performance and then developed a Tabu Search procedure and a Variable Neighborhood Search procedure. Step-by-step descriptions of these three new procedures are provided. Computational results on benchmark and randomly generated test problems show that the Tabu Search procedure outperforms the others if the problem does not have too many objective functions and an excessively large efficient set. The improved P-ACO procedure performs better otherwise.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Bratley, P. and B.L. Box. (1988). “Algorithm 659: Implementing Sobol’s Quasirandom Sequence Generator.” ACM Transactions on Mathematical Software 14, 88–100.

    Google Scholar 

  • Buchanan, J. and L. Gardiner. (2003). “A Comparison of Two Reference Point Methods in Multiple Objective Mathematical Programming.” European Journal of Operational Research 149, 17–34.

    Article  Google Scholar 

  • Bullnheimer, B., R.F. Hartl, and C. Strauss. (1999). “A New Rank Based Version of the Ant System: A Computational Study.” Central European Journal of Operations Research 7, 25–38.

    Google Scholar 

  • Burke, E., P. De Causmaecker, S. Petrovic, and G.V. Berghe. (2003). “Variable Neighborhood Search for Nurse Rostering Problems.” In M.G.C. Resende and J.P. Sousa (eds.), Metaheuristics: Computer Decision-Making. Boston: Kluwer, pp. 153–172.

    Google Scholar 

  • Colorni, A., M. Dorigo, and V. Maniezzo. (1992). “Distributed Optimization by Ant Colonies.” In F.J. Varela and P. Bourgine (eds.), Toward a Practice of Autonomous Systems. Cambridge: MIT Press, 134–142.

    Google Scholar 

  • Cowling, P. (2003). “A Flexible Decision Support System for Steel Hot Rolling Mill Scheduling.” Computers & Industrial Engineering 45, 307–321.

    Google Scholar 

  • Czyzak, P. and A. Jaszkiewicz. (1998). “Pareto Simulated Annealing: A Metaheuristic Technique for Multiple-Objective Combinatorial Optimization.” Journal of Multi-Criteria Decision Analysis 7, 34–47.

    Google Scholar 

  • Deb, K. (2001). Multi-Objective Optimization Using Evolutionary Algorithms. Chichester: Wiley.

    Google Scholar 

  • Deneubourg, J.L. (1983). “Probabilistic Behaviour in Ants: A Strategy of Errors?” Journal of Theoretical Biology 105, 259–271.

    Google Scholar 

  • Deneubourg, J.L. and S. Goss. (1989). “Collective Patterns and Decision-Making.” Ethology, Ecology and Evolution 1, 295–311.

    Google Scholar 

  • Doerner, K., W.J. Gutjahr, R.F. Hartl, C. Strauss, and C. Stummer. (2001). “Ant Colony Optimization in Multiobjective Portfolio Selection.” In Proceedings of the 4th Metaheuristics International Conference. Porto, pp. 243–248.

  • Doerner, K., W.J. Gutjahr, R.F. Hartl, C. Strauss, and C. Stummer. (2004). “Pareto Ant Colony Optimization: A Metaheuristic Approach to Multiobjective Portfolio Selection.” Annals of Operations Research 131, 79–99.

    Article  Google Scholar 

  • Doerner, K., W.J. Gutjahr, R.F. Hartl, C. Strauss, and C. Stummer. (2005). “Pareto Ant Colony Optimization with ILP Preprocessing in Multiobjective Project Portfolio Selection.” European Journal of Operational Research, forthcoming.

  • Dorigo, M. (1992). Optimisation, Learning, and Natural Algorithms. Ph.D. Thesis, Politecnico di Milano.

  • Dorigo, M. and L.M. Gambardella. (1997). “Ant Colony System: A Cooperative Learning Approach to the Trave-ling Salesman Problem.” IEEE Transactions on Evolutionary Computation 1, 53–66.

    Article  Google Scholar 

  • Ehrgott, M. and X. Gandibleux. (2000). “A Survey and Annotated Bibliography of Multiobjective Combinatorial Optimization.” OR Spektrum 22, 425–460.

    MathSciNet  Google Scholar 

  • Ehrgott, M. and X. Gandibleux. (2004). “Approximative Solution Methods for Multiobjective Combinatorial Optimization.” Top 12, 1–63.

    Google Scholar 

  • Gambardella, L.M. and E. Taillard. (1999). “MACS-VRPTW: A Multiple Ant Colony System for Vehicle Routing Problems With Time Windows.” In D. Corne, M. Dorigo, and F. Glover (eds.), New Ideas in Optimization. London: McGraw-Hill, pp. 63–76.

    Google Scholar 

  • Glover, F. (1989). “Tabu Search: Part I.” ORSA Journal on Computing 1, 190–206.

    Google Scholar 

  • Glover, F. (1990). “Tabu Search: Part II.” ORSA Journal on Computing 2, 4–32.

    Google Scholar 

  • Glover, F. (1999). “Scatter Search and Path Relinking.” In D. Corne, M. Dorigo, and F. Glover (eds.), New Ideas in Optimization. London: McGraw-Hill, pp. 297–316.

    Google Scholar 

  • Glover, F. and M. Laguna. (1997). Tabu Search. Boston: Kluwer.

    Google Scholar 

  • Habenicht, W. (1983). “Quad Trees: A Datastructure for Discrete Vector Optimization Problems.” In P. Hansen (ed.), Essays and Surveys on Multiple Criteria Decision Making. Berlin: Springer, pp. 136–145.

    Google Scholar 

  • Hansen, M.P. (2000). “Tabu Search for Multiobjective Combinatorial Optimization: TAMOCO.” Control and Cybernetics 29, 799–818.

    MathSciNet  Google Scholar 

  • Hansen, P. and N. Mladenovic. (2001). “Variable Neighborhood Search: Principles and Applications.” European Journal of Operational Research 130, 449–467.

    Article  MathSciNet  Google Scholar 

  • Iredi, S., D. Merkle, and M. Middendorf. (2001). “Bi-Criterion Optimization with Multi Colony Ant Algorithms.” In E. Zitzler et al. (eds.), Evolutionary Multi-Criterion Optimization. Berlin: Springer, pp. 359–372.

  • Jaszkiewicz, A. (2004). “On the Computational Efficiency of Multiple Objective Metaheuristics: The Knapsack Problem Case Study.” European Journal of Operational Research 158, 418–433.

    Article  MathSciNet  Google Scholar 

  • Kahnemann, D., P. Slovic, and A. Tversky. (1982). Judgement Under Uncertainty: Heuristics and Biases. Cambridge: Cambridge University Press.

    Google Scholar 

  • Kaliszewski, I. (2004). “Out of the Mist: Towards Decision-Maker-Friendly Multiple Criteria Decision Making Support.” European Journal of Operational Research 158, 293–307.

    Article  MathSciNet  Google Scholar 

  • Lin, S. (1965). “Computer Solutions of the Traveling Salesman Problem.” Bell System Technical Journal 44, 2245–2269.

    Google Scholar 

  • Lotfi, V., T.J. Stewart, and S. Zionts. (1992). “An Aspiration-Level Interactive Model for Multiple Criteria Decision Making.” Computers & Operations Research 19, 677–681.

    Google Scholar 

  • Mariano, C.E. and E. Morales. (1999). “MOAQ and Ant-Q Algorithm for Multiple Objective Optimization Problems.” In W. Banzhaf, J. Daida, A.E. Eiben, M.H. Garzon, V. Honovar, M. Jakiela, and R.E. Smith (eds.), Proceedings of the Genetic and Evolutionary Computation Conference. San Francisco: Morgan Kaufmann, pp. 894–901.

    Google Scholar 

  • McMullen, P.R. (2001). “An Ant Colony Optimization Approach to Addressing a JIT Sequencing Problem with Multiple Objectives.” Artificial Intelligence in Engineering 15, 309–317.

    Article  Google Scholar 

  • Mladenovic, N. and P. Hansen. (1997). “Variable Neighborhood Search.” Computers & Operations Research 24, 1097–1100.

    Google Scholar 

  • Pastor, R., C. Andres, A. Duran, and M. Perez. (2002). “Tabu Search Algorithms for an Industrial Multi-Product and Multi-Objective Assembly Line Balancing Problem, with Reduction of the Task Dispersion.” Journal of the Operational Research Society 53, 1317–1323.

    Article  Google Scholar 

  • Ringuest, J. and S. Graves. (1990). “The Linear R{&}D Project Selection Problem: An Alternative to Net Present Value.” IEEE Transactions on Engineering Management 37, 143–146.

    Article  Google Scholar 

  • Sarker, R. and C. Newton. (2001). “Solving a Multiple Objective Linear Program Using Simulated Annealing.” Asia-Pacific Journal of Operational Research 18, 109–120.

    MathSciNet  Google Scholar 

  • Sobol, I.M. (1979). “On the Systematic Search in a Hypercube.” SIAM Journal of Numerical Analysis 16, 790–793.

    Article  Google Scholar 

  • Steinberg, D.I. (1977). “Designing a Heuristic for the Fixed Charge Transportation Problem.” Reprints in Mathematics and the Mathematical Science, Southern Illinois University at Edwardsville.

  • Steuer, R.E. (1986). Multiple Criteria Optimization: Theory, Computation, and Application. New York: Wiley.

    Google Scholar 

  • Steuer, R.E. (2003). “ADBASE: A Multiple Objective Linear Programming Solver for Efficient Extreme Points and Unbounded Efficient Edges.” User Manual, Department of Banking & Finance, University of Georgia.

  • Steuer, R.E., Y. Qi, and M. Hirschberger. (2003). “Suitable-Portfolio Investors, Nondominated Frontier Sensitivity, and the Effect of Multiple Objectives on Standard Portfolio Selection.” Working Paper, Department of Banking & Finance, University of Georgia.

  • Stummer, C. and K. Heidenberger. (2003). “Interactive R&D Portfolio Analysis with Project Interdependencies and Time Profiles of Multiple Objectives.” IEEE Transactions on Engineering Management 50, 175–183.

    Article  Google Scholar 

  • Stummer, C., K. Doerner, A. Focke, and K. Heidenberger. (2004). “Determining Location and Size of Medical Departments in a Hospital Network: A Multiobjective Decision Support Approach.” Health Care Management Science 7, 63–71.

    Article  PubMed  Google Scholar 

  • Stützle, T. and H.H. Hoos. (2000). “MAX-MIN Ant System.” Journal of Future Generation Computer Systems 16, 889–914.

    Article  Google Scholar 

  • Sun, M. (1997). “Applying Tabu Search to Multiple Objective Combinatorial Optimization Problems.” In Proceedings of the 1997 DSI Annual Meeting. San Diego, pp. 945–947.

  • Sun, M. (2005a). “A Primogenitary Linked Quad Tree Data Structure and its Application to Discrete Multiple Criteria Optimization.” Annals of Operations Research, forthcoming.

  • Sun, M. (2005b). “Some Issues in Measuring and Reporting Solution Quality of Interactive Multiple Objective Programming Procedures.” European Journal of Operational Research 162, 468–483.

    Article  Google Scholar 

  • Sun, M. and R.E. Steuer. (1996). “InterQuad: An Interactive Quad Tree Based Procedure for Solving the Discrete Alternative Multiple Criteria Problem.” European Journal of Operational Research 98, 462–472.

    Article  Google Scholar 

  • Viana, A. and J.P. de Sousa. (2000). “Using Metaheuristics in Multiobjective Resource Constrained Project Scheduling.” European Journal of Operational Research 120, 359–374.

    Article  MathSciNet  Google Scholar 

  • Witus, G. (1986). “Decision Support for Planning and Resource Allocation in Hierarchical Organizations.” IEEE Transactions on Systems, Man, and Cybernetics 16, 927–942.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Business, Economics and Computer Science, University of Vienna, Bruenner Str. 72, A-1210, Vienna, Austria

    Christian Stummer

  2. College of Business, The University of Texas at San Antonio, 6900 North Loop 1604 West, San Antonio, Texas, 78249-0632, USA

    Minghe Sun

Authors
  1. Christian Stummer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Minghe Sun
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Christian Stummer.

Additional information

Supported by the Austrian Science Fund (Grant No. J2351-N04).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Stummer, C., Sun, M. New Multiobjective Metaheuristic Solution Procedures for Capital Investment Planning. J Heuristics 11, 183–199 (2005). https://doi.org/10.1007/s10732-005-0970-4

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10732-005-0970-4

Keywords

Search

Navigation