Efficiency of interactive multi-objective simulated annealing through a case study

DOI10.1057/PALGRAVE.JORS.2600569MaRDI QIDQ3157778zbMATH OpenOpenAlexFDO

Authors E. L. Ulungu, Ch. Ost, Jacques Teghem

Publication date 19 January 2005

Published in The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1057/palgrave.jors.2600569

zbMATH Keywords

combinatorial optimisationmulti-objectivesimulated annealing

Mathematics Subject Classification ID

Case-oriented studies in operations research (90B90) Combinatorial optimization (90C27)

Recommendations

• An interactive heuristic method for multi-objective combinatorial optimization
• Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization
• MOSA method: a tool for solving multiobjective combinatorial optimization problems
• scientific article; zbMATH DE number 721857
• scientific article; zbMATH DE number 1086965

Cited in

(15)

• g-dominance: Reference point based dominance for multiobjective metaheuristics
• Performance evaluation of acceptance probability functions for multi-objective SA
• On the computational efficiency of multiple objective metaheuristics. The knapsack problem case study
• Mathematical analysis and solutions for multi-objective line-cell conversion problem
• Integrated rescheduling and preventive maintenance for arrival of new jobs through evolutionary multi-objective optimization
• Generating efficient schedules for identical parallel machines involving flow-time and tardy jobs
• Genetic local search for multi-objective flowshop scheduling problems
• Resource allocation in multi-class dynamic PERT networks with finite capacity
• Smart Production by Integrating Product-Mix Planning and Revenue Management for Semiconductor Manufacturing
• A survey of simulated annealing as a tool for single and multiobjective optimization
• Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors.
• Asymptotic convergence of a simulated annealing algorithm for multiobjective optimization problems
• MOTGA: a multiobjective Tchebycheff based genetic algorithm for the multidimensional knapsack problem
• Pruned Pareto-optimal sets for the system redundancy allocation problem based on multiple prioritized objectives
• A multi-objective iterated greedy search for flowshop scheduling with makespan and flowtime criteria

This page was built for publication: Efficiency of interactive multi-objective simulated annealing through a case study

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