Fast automatic seat assignment for large-scale passengers reservation systems
Pages 239 - 244
Abstract
In this paper, a fastest seat assignment algorithm based on the well-known Left-Edge Algorithm (LEA) and the data structure of buckets in multi-dimension for large-scale passenger reservation system is presented. The time and space complexities are both O(N), where N is the number of tickets. In the meantime, the group tickets will be reserved in the neighboring seats. The concept of the proposed algorithm can be also applied to scheduling and channel assignment for Printed Circuit Boards (PCB) and Electronic Design Automation (EDA).
References
[1]
G. Persky, D. N. Deutsch, and D. G. Schweikert, “Ltx - a system for the directed automatic design of 1st circuits”, in Proc. of Design Automation Conference, pp. 399–407, 1976.
[2]
S. M. Sait and H. Youssef, VLSI Physical Design Automation: Theory and Practice, World Scientific 1999.
[3]
C. Wang, H. H. Ghenniwa, and W. Shen, “A winner determination algorithm for auction based decentralized scheduling”, IEEE Transactions on Systems, Man and Cybernetics, Part A: Systems and Humans, vol. 39, no. 5, pp. 609–618, 2009.
[4]
A. Raniwala, K. Gopalan, and T. Chi-ueh, “Centralized channel assignment and routing algorithms for multi-channel wireless mesh networks”, ACM SIGMOBILE Mobile Computing and Communications Review, vol. 8, no. 2, pp. 50–65, Apr. 2004.
[5]
A. Goldsmith and S. Wicker, “Design challenges for energy-constrained ad hoc wireless networks” IEEE Wireless Communications, vol. 9, no. 4, pp. 8–27, Aug. 2002.
[6]
Y. Lee, K. Kim, and Y. Choi, “Optimization of ap placement and channel assignment in wireless lans”, in Proc. of IEEE Conference on Local ComputerNetworks, pp. 831–836, 2002.
[7]
C. A. Schemes, “Channel assignment schemes for cellular mobile telecommunication systems: A comprehensive survey”, IEEE Personal Communications, pp. 11–31, June 1996.
[8]
X. N. Fernando and A. O. Fapojuwo, “A viterbi-like algorithm with adaptive clustering for channel assignment in cellular radio networks”, IEEE Transactions on Vehicular Technology, vol. 51, no. 1, pp. 73–87, Jan. 2002.
[9]
S. Sarkar and K. N. Sivarajan, “Channel assignment algorithms satisfying cochannel and adjacent channel reuse constraints in cellular mobile networks”, IEEE Transactions on Vehicular Technology, vol. 51, no. 5, pp. 954–967, Sept. 2002.
[10]
R. Chavez-Santiago, E. Gigi, and V. Lyandres, “Channel assignment for cellular mobile networks with nonuniform cells - an improved heuristic algorithm”, IEEE Proceedings Communications, vol. 153, no. 1, pp. 61–68, Feb. 2006.
[11]
X. J. Li and P. H. J. Chong, “A dynamic channel assignment scheme for tdma-based multihop cellular networks”, IEEE Transactions on Wireless Communications, vol. 7, no. 6, pp. 1999–2003, June 2008.
[12]
D. Bozda, F. Ozguner, and U. V. Catalyurek, “Compaction of schedules and a two-stage approach for duplication-based DAG scheduling”, IEEE Transactions on Parallel and Distributed Systems, vol. 20, pp. 857–871, 2009.
[13]
A. Hashimoto and J. Stevens, “Wire routing by optimizing channel assignment within large apertures”, in Proc. of Design Automation Conference, pp. 35–49, 1988.
[14]
A. Somogyi, “Equivalence of the left-edge and column by column channel routing algorithms”, Electronics Letters, vol. 20, no. 14, pp. 606–607, 1984.
[15]
T. Yoshimura and E. S. Kuh, “Efficient algorithms for channel routing”, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 1, no. 1, pp. 25–35, Jan. 1982.
[16]
M. P. McGarry, M. Reisslein, C. J. Colbourn, M. Maier, F. Aurzada, and M. Scheutzow, “Just-in-time scheduling for multichannel EPONs”, Journal of Lightwave Technology, vol. 26, no. 10, pp. 1204–1216, 2008.
[17]
S. E. Lass, “Automated printed circuit routing with a stepping aperture”, Communications of the ACM, vol. 12, no. 5, pp. 262–265, 1969.
[18]
N. A. Sherwani, Algorithms for VLSI Physical Design Automation, Kluwer Academic Publishers 1995.
[19]
G. E. Jan, C. H. Li, C.C. Sun, and B. S. Lin, “A fast seat assignment algorithm based on buckets data structure”, in Proc. of International Conference on Computing Technology and Information Management, Apr. 2012.
Index Terms
- Fast automatic seat assignment for large-scale passengers reservation systems
Index terms have been assigned to the content through auto-classification.
Recommendations
An AR-Enabled Interactive Car Door to Extend In-Car Infotainment Systems for Rear Seat Passengers
CHI EA '21: Extended Abstracts of the 2021 CHI Conference on Human Factors in Computing SystemsModern cars create a high-tech interactive space by providing entertainment and information functionalities to the driver and partly to the passengers. By introducing rear-seat infotainment systems especially in luxury cars, manufacturers started to ...
Personal Space of Autonomous Car’s Passengers Sitting in the Driver’s Seat
2018 IEEE Intelligent Vehicles Symposium (IV)This article deals with the specific context of an autonomous car navigating in an urban center within a shared space between pedestrians and cars. The driver delegates the control to the autonomous system while remaining seated in the driver’s ...
Seat reservation allowing seat changes
We consider a variant of the Seat Reservation Problem [J. Boyar, K.S. Larsen, Algorithmica 25 (1999) 403-417] in which seat changes are allowed. We analyze the model using the competitive ratio, the competitive ratio on accommodating sequences [J. Boyar,...
Comments
Information & Contributors
Information
Published In
1128 pages
Copyright © 2016.
Publisher
IEEE Press
Publication History
Published: 01 August 2016
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 05 Feb 2025