An interactive heuristic method for multi-objective combinatorial optimization

DOI10.1016/S0305-0548(99)00109-4MaRDI QIDQ1569903zbMATH OpenOpenAlexFDO

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

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

simulated annealingcombinatorial optimizationassignment problemknapsack problemmultiobjective programming

Mathematics Subject Classification ID

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

Recommendations

• An Interactive Heuristic Approach for Multi-Objective Integer-Programming Problems
• An interactive evolutionary metaheuristic for multiobjective combinatorial optimization
• An interactive method for multiple-objective mathematical programming problems
• Interactive solution to multiobjective optimization problems
• Multiobjective combinatorial optimization: some approaches
• scientific article; zbMATH DE number 44121
• scientific article; zbMATH DE number 4154225
• An interactive approximation algorithm for multi-objective integer programs

Cites work

• scientific article; zbMATH DE number 1149800 (Why is no real title available?)
• scientific article; zbMATH DE number 1488081 (Why is no real title available?)
• scientific article; zbMATH DE number 915988 (Why is no real title available?)
• General local search methods
• MOSA method: a tool for solving multiobjective combinatorial optimization problems
• Multi‐objective combinatorial optimization problems: A survey
• Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization
• Performance of the MOSA method for the bicriteria assignment problem
• Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem

Cited in

(19)

• Efficiency of interactive multi-objective simulated annealing through a case study
• scientific article; zbMATH DE number 1784664 (Why is no real title available?)
• A method to identify a representation of the set of non-dominated points for discrete tri-objective optimization problems
• An interactive method for 0-1 multiobjective problems using simulated annealing and tabu search
• Solving multi-objective production scheduling problems using metaheuristics
• Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors.
• MOSA method: a tool for solving multiobjective combinatorial optimization problems
• Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms
• A multi-objective production scheduling case study solved by simulated annealing
• An interactive evolutionary metaheuristic for multiobjective combinatorial optimization
• A multilevel evaluation method for heuristics with an application to the VRPTW
• Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic
• A tool to convert continuous multiobjective optimisation test problems into combinatorial ones
• A multiobjective metaheuristic for a mean-risk static stochastic knapsack problem
• Multiobjective Heuristic Search in AND/OR Graphs
• scientific article; zbMATH DE number 2156685 (Why is no real title available?)
• A new multiobjective simulated annealing algorithm
• An interactive multiobjective programming approach to combinatorial data analysis
• Performance evaluation of acceptance probability functions for multi-objective SA

This page was built for publication: An interactive heuristic method for multi-objective combinatorial optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1569903)