Developing an allocation algorithm for seats allocation with multiple objectives

Pao Yue-kong Library Electronic Theses Database

Developing an allocation algorithm for seats allocation with multiple objectives

 

Author: Kan, Yuk-man
Title: Developing an allocation algorithm for seats allocation with multiple objectives
Degree: M.Sc.
Year: 1996
Subject: Reservation systems -- Mathematical models
Algorithms
Hong Kong Polytechnic University -- Dissertations
Department: Multi-disciplinary Studies
Pages: ii, 64 leaves ; 30 cm
Language: English
InnoPac Record: http://library.polyu.edu.hk/record=b1235084
URI: http://theses.lib.polyu.edu.hk/handle/200/1520
Abstract: In this research paper, a seat allocation problem with specific objectives is studied. A number of bookings are received with priority defined and the seats of a specific floor plan are then allocated to the bookings meeting certain defined objectives. The task is then to find a feasible combination of seatings allocation that maximize the objective function defined. A methodology utilizing heuristics approach have been developed trying to obtain a high enough value of the objective function. The problem is defined into two phases with the first phase focusing on the utilization and the second phase on combination of bookings priority and seats weightings. Two set of complementary heuristic rules are specially designed respectively to solve the problem in two phases. The algorithm is tested with 4 sets of data, the results are encouraging where the final solutions are obtained with objective values very close to the upper bound calculated.

Files in this item

Files Size Format
b12350849.pdf 2.759Mb PDF
Copyright Undertaking
As a bona fide Library user, I declare that:
  1. I will abide by the rules and legal ordinances governing copyright regarding the use of the Database.
  2. I will use the Database for the purpose of my research or private study only and not for circulation or further reproduction or any other purpose.
  3. I agree to indemnify and hold the University harmless from and against any loss, damage, cost, liability or expenses arising from copyright infringement or unauthorized usage.
By downloading any item(s) listed above, you acknowledge that you have read and understood the copyright undertaking as stated above, and agree to be bound by all of its terms.

     

Quick Search

Browse

More Information