An interactive heuristic method for multi-objective combinatorial optimization

DOI10.1016/S0305-0548(99)00109-4zbMath0961.90104OpenAlexW2016304425MaRDI QIDQ1569903

E. L. Ulungu, Daniel Tuyttens, Jacques jun. Teghem

Publication date: 9 July 2000

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0305-0548(99)00109-4

zbMATH Keywords

combinatorial optimizationsimulated annealingmultiobjective programmingknapsack problemassignment problem

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items

Solving multi-objective production scheduling problems using metaheuristics, Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic, A multi-objective production scheduling case study solved by simulated annealing, A new multiobjective simulated annealing algorithm, Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors., A multiobjective metaheuristic for a mean-risk static stochastic knapsack problem, Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms, Performance evaluation of acceptance probability functions for multi-objective SA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• General local search methods
• Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem
• Performance of the MOSA method for the bicriteria assignment problem
• Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization
• Multi‐objective combinatorial optimization problems: A survey
• MOSA method: a tool for solving multiobjective combinatorial optimization problems