Full metadata record
DC FieldValueLanguage
dc.contributorMulti-disciplinary Studiesen_US
dc.creatorKan, Yuk-man-
dc.identifier.urihttps://theses.lib.polyu.edu.hk/handle/200/1520-
dc.languageEnglishen_US
dc.publisherHong Kong Polytechnic University-
dc.rightsAll rights reserveden_US
dc.titleDeveloping an allocation algorithm for seats allocation with multiple objectivesen_US
dcterms.abstractIn 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.en_US
dcterms.extentii, 64 leaves ; 30 cmen_US
dcterms.isPartOfPolyU Electronic Thesesen_US
dcterms.issued1996en_US
dcterms.educationalLevelAll Masteren_US
dcterms.educationalLevelM.Sc.en_US
dcterms.LCSHReservation systems -- Mathematical modelsen_US
dcterms.LCSHAlgorithmsen_US
dcterms.LCSHHong Kong Polytechnic University -- Dissertationsen_US
dcterms.accessRightsrestricted accessen_US

Files in This Item:
File Description SizeFormat 
b12350849.pdfFor All Users (off-campus access for PolyU Staff & Students only)2.69 MBAdobe PDFView/Open


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.

Show simple item record

Please use this identifier to cite or link to this item: https://theses.lib.polyu.edu.hk/handle/200/1520