Ordinal optimization based algorithm for hotel booking limits problem

Shih Cheng Horng; Feng Yi Yang

doi:10.1109/IS3C.2012.196

Ordinal optimization based algorithm for hotel booking limits problem

Shih Cheng Horng^*, Feng Yi Yang

^*此作品的通信作者

生物醫學影像暨放射科學系

研究成果: Conference contribution › 同行評審

1 引文斯高帕斯（Scopus）

摘要

In this paper, a two-stage algorithm based on ordinal optimization (OO) theory is proposed to solve the booking limits problem with huge discrete solution space. First, a crude model with a small amount of simulation replications is used as a fitness evaluation in particle swarm optimization (PSO) algorithm to select N candidate solutions from solution space. Starting from the selected N candidate solutions, we then proceed with the optimal computing budget allocation (OCBA) technique to search for a good enough solution. The vector of good enough booking limits obtained by the proposed algorithm is promising in the aspects of solution quality and computational efficiency.

原文	English
主出版物標題	Proceedings - 2012 International Symposium on Computer, Consumer and Control, IS3C 2012
頁面	759-762
頁數	4
DOIs	https://doi.org/10.1109/IS3C.2012.196
出版狀態	Published - 2012
事件	2012 International Symposium on Computer, Consumer and Control, IS3C 2012 - Taichung, Taiwan 持續時間: 4 6月 2012 → 6 6月 2012

出版系列

名字	Proceedings - 2012 International Symposium on Computer, Consumer and Control, IS3C 2012

Conference

Conference	2012 International Symposium on Computer, Consumer and Control, IS3C 2012
國家/地區	Taiwan
城市	Taichung
期間	4/06/12 → 6/06/12

存取文件

10.1109/IS3C.2012.196

其它文件與鏈接

Link to publication in Scopus

引用此

@inproceedings{23521bf01fac4bf6a270147f6d828765,

title = "Ordinal optimization based algorithm for hotel booking limits problem",

abstract = "In this paper, a two-stage algorithm based on ordinal optimization (OO) theory is proposed to solve the booking limits problem with huge discrete solution space. First, a crude model with a small amount of simulation replications is used as a fitness evaluation in particle swarm optimization (PSO) algorithm to select N candidate solutions from solution space. Starting from the selected N candidate solutions, we then proceed with the optimal computing budget allocation (OCBA) technique to search for a good enough solution. The vector of good enough booking limits obtained by the proposed algorithm is promising in the aspects of solution quality and computational efficiency.",

keywords = "hotel booking limits, optimal computing budget allocation, ordinal optimization, particle swarm optimization, stochastic simulation",

author = "Horng, {Shih Cheng} and Yang, {Feng Yi}",

year = "2012",

doi = "10.1109/IS3C.2012.196",

language = "English",

isbn = "9780769546551",

series = "Proceedings - 2012 International Symposium on Computer, Consumer and Control, IS3C 2012",

pages = "759--762",

booktitle = "Proceedings - 2012 International Symposium on Computer, Consumer and Control, IS3C 2012",

note = "2012 International Symposium on Computer, Consumer and Control, IS3C 2012 ; Conference date: 04-06-2012 Through 06-06-2012",

}

Horng, SC & Yang, FY 2012, Ordinal optimization based algorithm for hotel booking limits problem. 於 Proceedings - 2012 International Symposium on Computer, Consumer and Control, IS3C 2012., 6228419, Proceedings - 2012 International Symposium on Computer, Consumer and Control, IS3C 2012, 頁 759-762, 2012 International Symposium on Computer, Consumer and Control, IS3C 2012, Taichung, Taiwan, 4/06/12. https://doi.org/10.1109/IS3C.2012.196

TY - GEN

T1 - Ordinal optimization based algorithm for hotel booking limits problem

AU - Horng, Shih Cheng

AU - Yang, Feng Yi

PY - 2012

Y1 - 2012

N2 - In this paper, a two-stage algorithm based on ordinal optimization (OO) theory is proposed to solve the booking limits problem with huge discrete solution space. First, a crude model with a small amount of simulation replications is used as a fitness evaluation in particle swarm optimization (PSO) algorithm to select N candidate solutions from solution space. Starting from the selected N candidate solutions, we then proceed with the optimal computing budget allocation (OCBA) technique to search for a good enough solution. The vector of good enough booking limits obtained by the proposed algorithm is promising in the aspects of solution quality and computational efficiency.

AB - In this paper, a two-stage algorithm based on ordinal optimization (OO) theory is proposed to solve the booking limits problem with huge discrete solution space. First, a crude model with a small amount of simulation replications is used as a fitness evaluation in particle swarm optimization (PSO) algorithm to select N candidate solutions from solution space. Starting from the selected N candidate solutions, we then proceed with the optimal computing budget allocation (OCBA) technique to search for a good enough solution. The vector of good enough booking limits obtained by the proposed algorithm is promising in the aspects of solution quality and computational efficiency.

KW - hotel booking limits

KW - optimal computing budget allocation

KW - ordinal optimization

KW - particle swarm optimization

KW - stochastic simulation

UR - http://www.scopus.com/inward/record.url?scp=84864192272&partnerID=8YFLogxK

U2 - 10.1109/IS3C.2012.196

DO - 10.1109/IS3C.2012.196

M3 - Conference contribution

AN - SCOPUS:84864192272

SN - 9780769546551

T3 - Proceedings - 2012 International Symposium on Computer, Consumer and Control, IS3C 2012

SP - 759

EP - 762

BT - Proceedings - 2012 International Symposium on Computer, Consumer and Control, IS3C 2012

T2 - 2012 International Symposium on Computer, Consumer and Control, IS3C 2012

Y2 - 4 June 2012 through 6 June 2012

ER -

Ordinal optimization based algorithm for hotel booking limits problem

摘要

出版系列

Conference

存取文件

其它文件與鏈接

指紋

引用此