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

DOI10.1016/0305-0548(95)00029-1zbMath0847.90082OpenAlexW2073160629MaRDI QIDQ1915966

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

simulated annealingtabu searchlarge, complex multi-objective flow-shop problem

Mathematics Subject Classification ID

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

Related Items (8)

Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic ⋮ A multi-objective particle swarm for a flow shop scheduling problem ⋮ Metaheuristics: A bibliography ⋮ Evaluating solution sets of a posteriori solution techniques for bi-criteria combinatorial optimization problems ⋮ A multi-objective tabu search for a single-machine scheduling problem with sequence-dependent setup times ⋮ A multi-population genetic algorithm to solve multi-objective scheduling problems for parallel machines. ⋮ Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors. ⋮ Scheduling continuous casting of aluminum using a multiple objective ant colony optimization metaheuristic

Cites Work

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

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