Abstract
Several studies have considered metaheuristics, especially simulated annealing, for solving combinatorial optimization problems involving several objectives. Yet, few works have been devoted to tabu search approaches. In this paper, we present a heuristic based upon tabu search principles to generate a good approximation of the set of the Pareto-optimal (efficient) solutions.
Cite
CITATION STYLE
APA
Gandibleux, X., Mezdaoui, N., & Fréville, A. (1997). A Tabu Search Procedure to Solve MultiObjective Combinatorial Optimization Problems (pp. 291–300). https://doi.org/10.1007/978-3-642-46854-4_32
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free