MO-COMPASS: a fast convergent search algorithm for multi-objective discrete optimization via simulation
Haobin Li,
Loo Hay Lee,
Ek Peng Chew and
Peter Lendermann
IISE Transactions, 2015, vol. 47, issue 11, 1153-1169
Abstract:
Discrete Optimization via Simulation (DOvS) has drawn considerable attention from both simulation researchers and industry practitioners, due to its wide application and significant effects. In fact, DOvS usually implies the need to solve large-scale problems, making the efficiency a key factor when designing search algorithms. In this research work, MO-COMPASS (Multi-Objective Convergent Optimization via Most-Promising-Area Stochastic Search) is developed, as an extension of the single-objective COMPASS, for solving DOvS problems with two or more objectives by taking into consideration the Pareto optimality and the probability of correct selection. The algorithm is proven to be locally convergent, and numerical experiments have been carried out to show its ability to achieve high convergence rate.
Date: 2015
References: Add references at CitEc
Citations: View citations in EconPapers (3)
Downloads: (external link)
http://hdl.handle.net/10.1080/0740817X.2015.1005778 (text/html)
Access to full text is restricted to subscribers.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:taf:uiiexx:v:47:y:2015:i:11:p:1153-1169
Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/uiie20
DOI: 10.1080/0740817X.2015.1005778
Access Statistics for this article
IISE Transactions is currently edited by Jianjun Shi
More articles in IISE Transactions from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().