A comparison of neighborhood search techniques for multi-objective combinatorial problems

DOI10.1016/0305-0548(95)00029-1MaRDI QIDQ1915966zbMATH OpenOpenAlexFDO

Authors Richard Marett, Mike Wright

Publication date 1 July 1996

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

Full work available at URL https://doi.org/10.1016/0305-0548(95)00029-1

zbMATH Keywords

large, complex multi-objective flow-shop problemsimulated annealingtabu search

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Multi-objective and goal programming (90C29)

Recommendations

• A comparison of local search methods for flow shop scheduling
• Multi-objective tabu search using a multinomial probability mass function
• An application of a multi-objective tabu search algorithm to a bicriteria flowshop problem
• Simulated annealing and tabu search: Lessons from a line search
• Simulated annealing and tabu search in the long run: A comparison on QAP tasks

Cites work

• A new heuristic method for the flow shop sequencing problem
• Algorithms for the maximum satisfiability problem
• Ant colony optimization for the examination scheduling problem
• Applied simulated annealing
• Comparison of the performance of modern heuristics for combinatorial optimization on real data
• scientific article; zbMATH DE number 3220839 (Why is no real title available?)
• scientific article; zbMATH DE number 3233290 (Why is no real title available?)
• Improving the Efficiency of Tabu Search for Machine Sequencing Problems
• Multi-level lot-sizing problem: Evaluation of a simulated-annealing heuristic
• Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
• Restricted neighborhood in the tabu search for the flowshop problem
• Simulated annealing: A tool for operational research
• Some efficient heuristic methods for the flow shop sequencing problem
• Some experiments with simulated annealing techniques for packing problems
• The multiobjective equilibrium network design problem revisited: A simulated annealing approach
• Using tabu search techniques for graph coloring

Cited in

(11)

• A multi-population genetic algorithm to solve multi-objective scheduling problems for parallel machines.
• Scheduling continuous casting of aluminum using a multiple objective ant colony optimization metaheuristic
• Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic
• Metaheuristics: A bibliography
• A study with neighborhood searches to deal with multiobjective unconstrained permutation problems
• A multi-objective tabu search for a single-machine scheduling problem with sequence-dependent setup times
• scientific article; zbMATH DE number 1054941 (Why is no real title available?)
• scientific article; zbMATH DE number 2156686 (Why is no real title available?)
• Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors.
• A multi-objective particle swarm for a flow shop scheduling problem
• Evaluating solution sets of a posteriori solution techniques for bi-criteria combinatorial optimization problems

This page was built for publication: A comparison of neighborhood search techniques for multi-objective combinatorial problems

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