An interactive method for 0-1 multiobjective problems using simulated annealing and tabu search

DOI10.1023/A:1009686616612zbMath1071.90561OpenAlexW1608805266MaRDI QIDQ2567890

Maria João Alves, Joao Carlos Namorado Climaco

Publication date: 13 October 2005

Published in: Journal of Heuristics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1009686616612

zbMATH Keywords

metaheuristicssimulated annealingtabu searchzero-one programminginteractive multiple objective programming

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59) Boolean programming (90C09)

Related Items (8)

Multi-directional local search ⋮ A review of interactive methods for multiobjective integer and mixed-integer programming ⋮ MOTGA: a multiobjective Tchebycheff based genetic algorithm for the multidimensional knapsack problem ⋮ A note on a decision support system for multiobjective integer and mixed-integer programming problems. ⋮ Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors. ⋮ g-dominance: Reference point based dominance for multiobjective metaheuristics ⋮ Multi-objective tabu search using a multinomial probability mass function ⋮ A dynamic neighborhood based tabu search algorithm for real-world flight instructor scheduling problems

Uses Software

• OR-Library

This page was built for publication: An interactive method for 0-1 multiobjective problems using simulated annealing and tabu search