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

DOI10.1057/palgrave.jors.2600569zbMath1140.90460MaRDI QIDQ3157778

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

Publication date: 19 January 2005

Published in: 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

simulated annealing; combinatorial optimisation; multi-objective

Mathematics Subject Classification ID

90C27: Combinatorial optimization

90B90: Case-oriented studies in operations research

Related Items

Resource allocation in multi-class dynamic PERT networks with finite capacity, 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, 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, Smart Production by Integrating Product-Mix Planning and Revenue Management for Semiconductor Manufacturing