본 연구는 호텔에서 방 예약을 받는 시스템에서, 전술적으로 방의 등급을 정해 예약을 받는 방 배정 문제에서, 효과적인 절차를 총 수익에 관련되는 여러 가지 요소들을 고려하여, 총 수익을 최대화하는 알고리즘을 개발하였다. 이익을 최대화하고, 자원들의 효과적인 배분을 위해서 먼저 시장의 차별화가 어떻게 다르게 형성되는가를 분석하고, 이 결과를 전략적인 계층 방 분배 문제를 해결하는 데에 적용하였다. 하룻밤을 지내는 손님을 위한 예약에서는 동적인 모델링(

In this paper we develop an efficient procedure for solving the tactical-level room allocation problem for hotel industry by incorporating other sources of revenue into overall Revenue Management (RM) system. To maximize profits and allocate wisely available resources, first, determine how different market segments contributed. And apply this to an efficient procedure for solving tactical-level room allocation problem for the hotel industry by combining the dynamic model for handling single-night reservation requests and the static model for handling multi-night reservation requests.

Despite the remarkable continual growth of the world cruise industry, studies have yet to be attempted on many revenue management problems in cruise operations. This paper suggests two schemes that can be easily applied to cruise revenue management: optimal dual pricing and passenger safety level. In optimal dual pricing, a pair of higher and lower prices is applied to cabin reservation through market segmentation. This scheme can be executed with a linear price-response function for the current unreserved cabins. A cruise line could benefit from this scheme to maximize reservation revenue while attaining full occupancy. The dual pricing scheme is also devised to produce only integer demands to suit real management practices. The life boat capacity is an additional service capacity unique to the cruise industry, catering to passengers’ safety. The concept of passenger safety level is defined and computed for any passenger life boat capacity of a cruise ship. It can be used to evaluate the passenger safety of a cruise ship in operation, as well as to determine the number of life boat seats required for a new cruise ship. Hypothetical examples are used to illustrate the operation of these two schemes.