Complete Material Cost #3,000
Order for Complete Material now
ABSTRACT
The use of computer is air-route queuing system is the essence of this project research work. Air Route queuing system plays a large role in the efficient operation of air transportation system. Little however has been written about how aircrafts land and leave the airport in obedience to the queuing discipline.
TABLE OF CONTENT
ACKNOWLEDGEMENT i
DEDICATION ii
CERTIFICATION iii
ABSTRACT iv
TABLE OF CONTENT v
CHAPTER ONE 1
1.1 INTRODUCTION 1
1.2 STATEMENT OF THE PROBLEM 3
1.3 OBJECTIVE OF THE STUDY 4
1.4 SCOPE OF THE PROJECT 5
1.5 DEFINITION OF TERMS 5
CHAPTER TWO 8
2.1 LITERATURE REVIEW 8
2.2 HISTORY OF QUEUING 9
2.3 APPLICATION OF QUEUES 10
2.2.1PORTABLE BATCH SYSTEM (PBS) 10
2.2.2MULTIPLE DEVICE QUEUING SYSTEM (MDQS). 12
2.3 ELEMENTS OF QUEUING SYSTEM 13
2.4 CHARACTERISTICS OF A QUEUING SYSTEM 14
2.4.1 ARRIVAL CHARACTERISTICS 14
2.4.2 SIZE OF CALLING POPULATION 15
2.4.3 PATTERN OF ARRIVAL AT THE SYSTEM 15
2.4.4BEHAVIOUR OF THE ARRIVALS 17
2.5 WAITING LINE CHARACTERISTICS 17
2.6 SERVICE FACILITY 19
CHAPTER THREE 20
3.1 ALGORITHM: Main Program 21
3.2 FLOW CHART 23
CHAPTER FOUR 29
4.1 PROGRAME CODING AND IMPLEMENTATION 29
4.2 LIMITATION OF VISUAL BASIC LANGUAGES 30
4.3 HOW THE PROGRAM IS TO BE USED 32
4.4 SAMPLE OUTPUTS 42
CHAPTER FIVE 47
SUMMARY, CONCLUSION AND RECOMMENDATION 47
5.1 SUMMARY 47
5.2 CONCLUSION 47
5.3 RECOMMENDATION 48
REFERENCES 49
CHAPTER ONE
1.1 INTRODUCTION
Queue is an important special type of a list data structure which is used to hold data that are processed in the order of its arrival. Element’s are deleted from one end caused the front and new elements are added to the other end called the rear. A queue operates in the first in first-out fashion (FIFO) or “first come first serve’ fashion (FCFS).
The arrangement used to store data will depend on the processing. The data must be structured in a way that preserves the links needed for processing and in a way that can successfully be called data structure.
In an Airport queue, when an airplane leaves the head of the queue, the airplane behind takes the position. The head of the queue would always be at the base address of the locations and every time a delection is made, every item in the queue would have to move up on location.
This is obviously inefficient and so it is normal to move the position of the head of the queue by adjusting a pointer rather than moving every item in the queue.
Queuing as a case characterized by the way which airplanes join inorder to wait for services and by way in which for serving. When there is a queue waiting to be serve there must be an order called the queue discipline or simply discipline, which is a rule for selecting the next airplane to be served.
Lewis (1978) defines a queue as a waiting line- A simple data structure modeled after a line of customers awaiting to be served. This is one of life disagreeable activities, yet it forms the basis of the subject of this project work.
Think for a moment how time is spent in one’s daily activities waiting in some form of a queue; waiting for a bank teller, computer programs awaiting processing in a computer, telephone calls coming into an exchange, Airplanes lined up on runway awaiting take-off or landing.
According to Fayol (1964), he said that the study of waiting lines called queuing theory is one of the oldest and most widely used qualitative analysis techniques. It study the behaviour of queues, the concept of arrival-service-departure settings. If the capacity to service the arrivals is not adequate, the waiting time will be long. Furthermore. French (1985), said that queuing mechanism seeks to predict the beharour of the waiting line so that informed decisions can be made regarding how much service capacity should be made available.
This project is aimed at generating a system for the coordination of the waiting line of Airplanes landing and taking-off in a busy Airport with a limited number of runways.
1.2 STATEMENT OF THE PROBLEM
There are many problems associated with queuing. The main purpose of this research is to identify the draw-backs associated with queuing system without proper queuing servicing.
1. Enough landing space cannot be easily made available for aircraft because they neither know the actual time of landing nor take-off. This leads to threats of aircraft safety.
2. Another problem is time delay: As a result of the queue, so much time will be wasted by the waiting system yet to be attended to. It also reduces the number of customers who patronizes these firms, even those yet to come.
1.3 OBJECTIVE OF THE STUDY
The major objective of this project is to examine one of the most common useful kind of computer simulations, the use of queues as it’s basic data structures. This simulation initiates the behavior of systems often called queuing system in which there are queues of objects awaiting to be served by various processes.
In this project we will concentrate on how queues can be applied to airplanes landing and taking-off in each unit of time in a busy airport by designing a system to handle this waiting line. The other objectives include the following:
(a) To reduce air-traffic congestion in airport
(b) To observe the changes in the computer simulations baking inferences
(c) How priority will be given to emergency landing.
1.4 SCOPE OF THE PROJECT
This project concentrates only on computer simulations, which will simulate a small but busy airport with a limited number of runways.
It will not deal with technical details of analysis and design required to determine the type of control required in modern airports. It will cover how planes arrive or take-of at random times and how to give priority for emergencies (fuel shortage landings and technical problem landings)
1.5 DEFINITION OF TERMS
DATA STRUCTURE: This is referred to as the method used in organizing data and the resulting interrelationship between data items and their address of identifiers so that an efficient computer implementation may result.
ARRIVALS: This is the time it takes to get to the service point.
ACTUAL WAITING LINE: Thisrefers to the queueitself. It is another term for waiting line and could be in the form of automobiles at tool plaza, customers arriving a bank teller or airplanes waiting to take-off.
BALKING: This refers to customers who refuse to join the waiting line because it is too long to suit the needs or interest.
CONGESTION: This is referred to as items or customers requiring particular service at a time.
CUSTOMER: This include persons or elements awaiting services.
INTERVALS: This is the duration between successive arrivals.
INTER-ARRIVAL TIME: This is the duration between any two successive arrivals.
IDLE- TIME: This is the period in which there is no customer to be served.
MODEL: This could be a design involving the solution to waiting line problems. Though waiting line problems could be modeled analytically using exponential and Poisson distribution while those waiting line problems which are too complex to be modeled analytically, are modeled using simulation.
QUEUE DISCIPLINE: This is the rule for selecting the next customer or airplane to receive service.
Complete Material Cost #3,000