INFORMS Journal on Computing
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
 QUICK SEARCH:   [advanced]


     


INFORMS JOURNAL ON COMPUTING
Vol. 19, No. 2, Spring 2007, pp. 291-301
DOI: 10.1287/ijoc.1050.0170
This Article
Right arrow Full Text (PDF)
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Citing Articles
Right arrow Citing Articles via HighWire
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Köksalan, M.
Right arrow Articles by Phelps, S.
Right arrow Search for Related Content

An Evolutionary Metaheuristic for Approximating Preference-Nondominated Solutions

Murat Köksalan, Selcen (Pamuk) Phelps

Department of Industrial Engineering, Middle East Technical University, 06531 Ankara, Turkey
Department of Accounting, Business, Economics, and Management Information Systems, Westminster College, Fulton, Missouri 65251, USA

koksalan{at}ie.metu.edu.tr
phelpss{at}westminster-mo.edu

We propose an evolutionary metaheuristic for approximating the preference-nondominated solutions of a decision maker in multiobjective combinatorial problems. The method starts out with some partial preference information provided by the decision maker, and utilizes an individualized fitness function to converge toward a representative set of solutions favored by the information at hand. The breadth of the set depends on the precision of the partial information available on the decision maker’s preferences. The algorithm simultaneously evolves the population of solutions out toward the efficient frontier, focuses the population on those segments of the efficient frontier that will appeal to the decision maker, and disperses it over these segments to have an adequate representation. Simulation runs carried out on randomly generated instances of the multiobjective knapsack problem and the multiobjective spanning-tree problem have found the algorithm to yield highly satisfactory results.

Key words: multiple criteria; combinatorial optimization; evolutionary heuristic
History: received September 2001; revised September 2005; accepted November 2005.




This article has been cited by other articles:


Home page
Management ScienceHome page
J. Wallenius, J. S. Dyer, P. C. Fishburn, R. E. Steuer, S. Zionts, and K. Deb
Multiple Criteria Decision Making, Multiattribute Utility Theory: Recent Accomplishments and What Lies Ahead
Management Science, July 1, 2008; 54(7): 1336 - 1349.
[Abstract] [PDF]




HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
Copyright © 2007 by INFORMS.