Article ID: | iaor2007348 |
Country: | Netherlands |
Volume: | 169 |
Issue: | 3 |
Start Page Number: | 918 |
End Page Number: | 931 |
Publication Date: | Mar 2006 |
Journal: | European Journal of Operational Research |
Authors: | Smith Alice E., Norman Bryan A., Kulturel-Konak Sadan |
Keywords: | simulation: applications, heuristics: tabu search |
A tabu search approach to solve multi-objective combinatorial optimization problems is developed in this paper. This procedure selects an objective to become active for a given iteration with a multinomial probability mass function. The selection step eliminates two major problems of simple multi-objective methods, a priori weighting and scaling of objectives. Comparison of results on an NP-hard combinatorial problem with a previously published multi-objective tabu search approach and with a deterministic version of this approach shows that the multinomial approach is effective, tractable and flexible.