MOAQ and ant-Q algorithm for multiple objective optimization problems
From MaRDI portal
Publication:2573012
DOI10.1007/s10732-005-0970-4zbMath1122.91337OpenAlexW2075879859WikidataQ57570757 ScholiaQ57570757MaRDI QIDQ2573012
Publication date: 7 November 2005
Published in: Journal of Heuristics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10732-005-0970-4
tabu searchvariable neighborhood searchant colony optimizationinvestment planningmultiobjective combinatorial optimization
Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
Exact and approximate approaches for the Pareto front generation of the single path multicommodity flow problem ⋮ 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 ⋮ Multiobjective project portfolio selection with fuzzy constraints ⋮ SOLVING A SPECIAL CLASS OF MULTIPLE OBJECTIVE LINEAR FRACTIONAL PROGRAMMING PROBLEMS ⋮ Metaheuristics for solving the biobjective single‐path multicommodity communication flow problem ⋮ A primogenitary linked quad tree approach for solution storage and retrieval in heuristic binary optimization ⋮ Multi-objective redundancy allocation optimization using a variable neighborhood search algorithm
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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.
- Some issues in measuring and reporting solution quality of interactive multiple objective programming procedures
- Pareto ant colony optimization with ILP preprocessing in multiobjective project portfolio selection
- An aspiration-level interactive model for multiple criteria decision making
- InterQuad: An interactive quad tree based procedure for solving the discrete alternative multiple criteria problem
- Variable neighborhood search
- A new rank based version of the ant system. -- A computational study
- A comparison of two reference point methods in multiple objective mathematical programming.
- A survey and annotated bibliography of multiobjective combinatorial optimization
- Out of the mist -- towards decision-maker-friendly multiple criteria decision making support
- On the computational efficiency of multiple objective metaheuristics. The knapsack problem case study
- Using metaheuristics in multiobjective resource constrained project scheduling
- A primogenitary linked quad tree data structure and its application to discrete multiple criteria optimization
- Suitable-portfolio investors, nondominated frontier sensitivity, and the effect of multiple objectives on standard portfolio selection
- Algorithm 659
- On the Systematic Search in a Hypercube
- Tabu Search—Part I
- Tabu Search—Part II
- Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization
- Tabu search algorithms for an industrial multi-product and multi-objective assembly line balancing problem, with reduction of the task dispersion
- Computer Solutions of the Traveling Salesman Problem
- Variable neighborhood search: Principles and applications
