A Merged Bat Algorithm for Solving the Hotel Booking Limits Problem

• Main Authors: He, Zong-Yu, 何宗諭
• Other Authors: Horng, Shih-Cheng
• Format: Others
• Language: zh-TW
• Published: 2017
• Online Access: http://ndltd.ncl.edu.tw/handle/583pt2

碩士 === 朝陽科技大學 === 資訊工程系 === 105 === In this thesis, a Merged bat algorithm, abbreviated as MBA, is proposed to solve the hotel booking limits problem. The goal is to search for a good enough solution with the objective of maximizing the expected revenue using limited computation time. The MBA improves the shortcomings of the slow convergence of the original bat algorithm. The control parameters contain the inertia weight, loudness and pulse emission rate. These three control parameters are varied to speed up the search for the optimal solution when the number of iterations are increased. BA is inspired by the echolocation behavior of microbats, with varying pulse rates of emission and loudness. Then the proposed MBA is applied to a hotel booking limits problem, which is formulated as a hard stochastic simulation optimization problem that consists of a huge solution space comprised by the vector of booking limits. Finally, the proposed MBA is compared with the evolutionary strategies, simulated annealing, artificial bee colony and original bat algorithm. The vector of good enough booking limits obtained by the proposed MBA is promising in the aspects of solution quality and computational efficiency.