Hybrid population-based algorithms for the bi-objective quadratic assignment problem
From MaRDI portal
Publication:2506218
DOI10.1007/s10852-005-9034-xzbMath1099.68134OpenAlexW2033634519MaRDI QIDQ2506218
Luís Paquete, Thomas Stützle, Manuel López-Ibáñez
Publication date: 28 September 2006
Published in: JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)
Full work available at URL: https://dipot.ulb.ac.be/dspace/bitstream/2013/69627/1/LopPaqStu04JMMA.pdf
Multi-objective and goal programming (90C29) Combinatorial optimization (90C27) Discrete location and assignment (90B80) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Randomized algorithms (68W20)
Related Items
Anytime Pareto local search, Ergonomic risk and cycle time minimization for the U-shaped worker assignment assembly line balancing problem: a multi-objective approach, A bi-objective heuristic approach for green identical parallel machine scheduling, Incorporating decision-maker's preferences into the automatic configuration of bi-objective optimisation algorithms, Design and analysis of stochastic local search for the multiobjective traveling salesman problem, Multi-objective memetic algorithm: comparing artificial neural networks and pattern search filter method approaches, Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The quadratic assignment problem. Theory and algorithms
- Hybrid evolutionary algorithms for graph coloring
- A study of stochastic local search algorithms for the biobjective QAP with correlated flow matrices
- Ant colonies for the quadratic assignment problem
- P-Complete Approximation Problems
- Comparison of iterative searches for the quadratic assignment problem
- Genetic local search for multi-objective combinatorial optimization
