Multi-objective tabu search using a multinomial probability mass function

Sadan Kulturel-Konak, Alice E. Smith, Bryan A. Norman

Research output: Contribution to journalArticlepeer-review

61 Scopus citations


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.

Original languageEnglish (US)
Pages (from-to)918-931
Number of pages14
JournalEuropean Journal of Operational Research
Issue number3
StatePublished - Mar 16 2006

All Science Journal Classification (ASJC) codes

  • Information Systems and Management
  • General Computer Science
  • Industrial and Manufacturing Engineering
  • Modeling and Simulation
  • Management Science and Operations Research


Dive into the research topics of 'Multi-objective tabu search using a multinomial probability mass function'. Together they form a unique fingerprint.

Cite this