Pareto ant colony optimization with ILP preprocessing in multiobjective project portfolio selection
From MaRDI portal
Publication:819077
DOI10.1016/j.ejor.2004.09.009zbMath1116.90087OpenAlexW2129143056WikidataQ59389771 ScholiaQ59389771MaRDI QIDQ819077
Christine Strauss, Richard F. Hartl, Karl F. Doerner, Walter J. Gutjahr, Christian Stummer
Publication date: 22 March 2006
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2004.09.009
integer linear programmingant colony optimizationpreprocessingmultiobjective combinatorial optimizationproject portfolio selectionhybrid optimization method
Integer programming (90C10) Multi-objective and goal programming (90C29) Combinatorial optimization (90C27) Portfolio theory (91G10)
Related Items
Pareto ant colony optimization with ILP preprocessing in multiobjective project portfolio selection ⋮ Robust optimization for interactive multiobjective programming with imprecise information applied to R\&D project portfolio selection ⋮ Environmental and social implications of incorporating carpooling service on a customized bus system ⋮ A trade-off multiobjective dynamic programming procedure and its application to project portfolio selection ⋮ Multicriteria tour planning for mobile healthcare facilities in a developing country ⋮ A survey of multidisciplinary design optimization methods in launch vehicle design ⋮ Multi-objective ant colony optimization based on decomposition for bi-objective traveling salesman problems ⋮ A clustering‐based review on project portfolio optimization methods ⋮ Secure and efficient routing on nodes, edges, and arcs of simple‐graphs and of multi‐graphs ⋮ On the finite-time dynamics of ant colony optimization ⋮ A multiagent evolutionary algorithm for the resource-constrained project portfolio selection and scheduling problem ⋮ ACS-TS: Train scheduling using ant colony system ⋮ Multi-objective vehicle routing problems ⋮ Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors. ⋮ A provably convergent heuristic for stochastic bicriteria integer programming ⋮ Investing strategy analysis of applying Ant colony optimization system to Taiwan stock market ⋮ Ant colony pattern search algorithms for unconstrained and bound constrained optimization ⋮ Portfolio decision analysis: recent developments and future prospects ⋮ Metaheuristic search techniques for multi-objective and stochastic problems: a history of the inventions of Walter J. Gutjahr in the past 22 years ⋮ An attractor-based multiobjective particle swarm optimization ⋮ Multi Objective Optimization Using Ant Colonies ⋮ A novel multi period mean-VaR portfolio optimization model considering practical constraints and transaction cost ⋮ Solving a comprehensive model for multiobjective project portfolio selection ⋮ Hybridizing exact methods and metaheuristics: a taxonomy ⋮ Project portfolio selection based on multi-project synergy ⋮ MOAQ and ant-Q algorithm for multiple objective optimization problems
Cites Work
- Pareto ant colony optimization: a metaheuristic approach to multiobjective portfolio selection
- Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors.
- Pareto ant colony optimization with ILP preprocessing in multiobjective project portfolio selection
- A survey and annotated bibliography of multiobjective combinatorial optimization
- Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
