The Method of Operational Planning of Group Actions of Aircraft in the "Air Taxi" Mode

2021 ◽  
Vol 22 (9) ◽  
pp. 484-493
Author(s):  
G. N. Lebedev ◽  
V. I. Goncharenko ◽  
N. A. Maximov ◽  
D. A. Mikhailin ◽  
A. V. Rumakina
Keyword(s):  
Queuing Theory ◽  
Group Actions ◽  
Optimal Number ◽  
Unmanned Aircraft ◽  
Operational Planning ◽  
Minimax Criterion ◽  
Dynamic Priority ◽  
Ground Object ◽  
Group Target ◽  
Random Nature

The article is devoted to the development of algorithms for operational planning of routes for a group of aircraft (AC). We consider group actions of small and unmanned aircraft in the "air taxi" mode, when there is no regular flight schedule between the points of destination, and requests are received "on call" for flights to points whose composition is unknown in advance and is of a random nature. The multicriteria task of planning a group flight in the "air taxi" mode is being solved. The solution to this problem is proposed using the apparatus of the queuing theory, according to which the system under consideration belongs to the class of multichannel queuing systems with waiting. A method for solving the problem of operational planning of aircraft actions is proposed. An algorithm for group target distribution of new claims between aircraft is developed on the basis of a modified minimax criterion for assigning the nearest aircraft for an object with a maximum service time. The developed algorithm is based on the following four main operations: in the first operation, priority unserved targets are selected according to the criterion of assigning a dynamic priority; in the second operation, the formed list is ranked according to another criterion, taking into account the importance and total distance of each ground object from the aircraft group, in three this operation selects the object with the maximum rank, and for it the task of assigning "own" aircraft is solved according to the third criterion of maximum proximity, in the fourth operation the conditions of non-intersection of the group flight routes are checked. A computer model of the system for servicing requests in the air taxi mode has been developed. The developed model makes it possible to analyze various scheduling algorithms, as well as to determine at each step the number of free claims and the number of free and busy aircraft. A comparison is made between the well-known in the theory of queuing and the proposed minimax approaches. It is shown that, in comparison with the known variants of scheduling in the queuing theory, on the basis of the proposed approach, the optimal number of used aircraft is achieved.

Value of Bootstrapping Staged Deployment of Infrastructure: Case Study in Space Infrastructure Deployment

2017 ◽  
Author(s):  
Koki Ho ◽  
Hao Chen ◽  
Harrison Kim
Keyword(s):  
Analytical Model ◽  
Analytical Method ◽  
Space Exploration ◽  
Optimal Number ◽  
Single Stage ◽  
Operational Planning ◽  
Uncertain Environment ◽  
Infrastructure System ◽  
Space Infrastructure

This paper analyzes the value of staged deployment for complex infrastructure system and propose a concept of bootstrapping staged deployment. Staged deployment has been well known for its advantage of providing flexibility in an uncertain environment. In contrast, this paper demonstrates that the proposed bootstrapping staged deployment can even add values in a deterministic environment. The key idea of bootstrapping staged deployment is to have the previously deployed stages support the subsequent deployment. We develop an analytical model to demonstrate the effects of bootstrapping staged deployment with a case study in space exploration. Our analysis results show that with a well-coordinated deployment plan, staged deployment can overperform single-stage deployment even in a deterministic environment, and that there is an optimal number of stages in terms of lifecycle cost under certain conditions. Our method can find the analytical expression for the optimal number of stages and its deployment strategies. The general findings from the proposed concept and analytical method can advance our knowledge about systems staged deployment, and make operational planning of resource generation infrastructure more efficient.

scholarly journals Optimal Allocation of Changing Station for Electric Vehicle Based on Queuing Theory

2016 ◽  
Vol 28 (5) ◽  
pp. 497-505 ◽  
Author(s):  
Yagang Zhang ◽  
Dingli Qi ◽  
Wei Jiang ◽  
Shuang Lei
Keyword(s):  
Electric Vehicle ◽  
Queuing Theory ◽  
Optimal Allocation ◽  
Electricity Consumption ◽  
Optimal Number ◽  
Power Station ◽  
Charging Station ◽  
New Construction ◽  
Optimum Plan ◽  
Planning And Construction

Electric vehicle as the main development direction of the future automotive industry, has gained attention worldwide. The rationality of the planning and construction of the power station, as the foundation of energy supply, is an important premise for the development of electric vehicles. In full consideration of the electric demand and electricity consumption, this paper proposes a new construction mode in which charging station and centralized charging station are appropriately combined and presents a location optimization model. Not only can this model be applied to determine the appropriate location for the power station, but it can use the queuing theory to determine the optimal number of power equipment, with which we can achieve the minimum costs. Finally, taking a certain city as an example, the optimum plan for power station is calculated by using this model, which provides an important reference for the study of electric vehicle infrastructure planning.

scholarly journals Planning Model of Optimal Parking Area Capacity

2012 ◽  
Vol 22 (6) ◽  
pp. 449-457 ◽  
Author(s):  
Robert Maršanić ◽  
Zdenka Zenzerović ◽  
Edna Mrnjavac
Keyword(s):  
Decision Making ◽  
Key Words ◽  
Queuing Theory ◽  
Optimal Number ◽  
Queuing System ◽  
Basic Factor ◽  
Planning Model ◽  
Business Decision ◽  
The City

The demand for parking services is not a constant one, but rather varies from minimum to maximum. The range between the maximum and minimum demands and the dynamics of changes are the basic factor influencing the required size of the parking area capacity and the respective financial effects. The objective of this paper is to demonstrate that the queuing theory can be implemented in defining the optimal number of serving places (ramps) and the required capacity (number of parking spaces) in controlled access parking areas and that the established model can serve in business decision-making in respect to planning and development of the parking area capacity. The presented model has been verified in the example of the “Delta” parking area in the City of Rijeka but this model is particularly valuable as it can be implemented in any controlled access parking areas, i.e., parking areas with toll-bars under current or any other changed future conditions. KEY WORDS: planning of parking area capacities, optimal parking area capacity, queuing theory, parking area as a queuing system

scholarly journals Analisis Sistem Antrean sebagai Upaya Mengoptimalkan Layanan Teller di Bank BRI Cabang Cibadak Kabupaten Sukabumi

2020 ◽  
Vol 13 (1) ◽  
Author(s):  
Agustian Suseno ◽  
Jauhari Arifin
Keyword(s):  
Customer Service ◽  
Queuing Theory ◽  
Service System ◽  
High Mobility ◽  
Optimal Number ◽  
Queue System ◽  
Banking Service ◽  
Excellent Service ◽  
Almost All ◽  
A Company

High mobility in the era of globalization has resulted in the service system in a company being demanded to be faster to meet customer needs. Responsiveness or responsiveness is one aspect of service quality that serves as a benchmark in achieving customer satisfaction. Banking as a financial service in dealing with customers is closely related to the speed of services provided to customers, sometimes whether or not fast customers are constrained by unpredictable queuing times. BRI Bank as the bank that has the largest units that are spread almost all over Indonesia, BRI Bank has been committed to creating excellent service in serving its customers, so that the queuing system in a banking service is crucial to be noticed so that customers can be well served. The purpose of this study was to analyze the optimal teller service queue system for minimizing queue waiting time using queuing theory methods. Data collection with a determined time-based observation and recording of activities that occur directly by researchers to be carried out at BRI Cibadak Branch, Sukabumi. The data to be taken is the time to the teller the service queue system which is the time between the arrival of the customer and the time of customer service. The results showed an optimal number of tellers of 6 with an average server utilization of 67%, an average number in the queue of 0.57 customers, an average number in the system of 4.57 customers, an average time in the queue of 0.01 hours and an average time in the system of 0.11 hours.

scholarly journals Queue Management during Health Pandemics: A Queuing Theory Perspective

2020 ◽  
pp. 18-26
Author(s):  
Yakubu Abdul-Wahab Nawusu ◽  
Abukari Abdul Aziz Danaa ◽  
Shiraz Ismail
Keyword(s):  
Service Delivery ◽  
Queuing Theory ◽  
Care Delivery ◽  
Viral Disease ◽  
Optimal Number ◽  
Medical Attention ◽  
Queue Management ◽  
Healthcare Provision ◽  
Social Distancing ◽  
The Impact

The era of coronavirus has called for sustained social distancing measures to minimize the spread of the viral disease. Healthcare establishments are reducing the size of their working staff; while others are running their outfits base on shift work in other to ensure protocols for social distancing.  Inherent in social distancing protocol is the potential for generating waiting lines at service delivery points. Healthcare centres in many countries are already inundated with loads of patient’s attendance on daily basis for treatment off mild to severe ailments. COVID-19 has added a further burden on the already frail health systems. Whiles visits are increasing, social distancing measures are to be ensured. Quick service delivery which is an indispensable need of patients visiting hospitals for treatment is shortened. The occurrence of waiting line, an impediment to healthcare provision has become commonplace in most healthcare centres in Ghana in particular. In addition to loss of financial gains, delay and unsatisfactory healthcare could lead to loss of lives. Health units are dealing with the effective management of staff schedules to curtail the impact of COVID-19 and at the same time cover up capacity to meet the added health care delivery demands. Accordingly, efforts to reduce time spent in waiting to receive medical attention is crucial. In this paper we study the queue situation at a case Outpatient Department (OPD) by applying query theory and offer recommendations for queue management. The study was conducted in the month of May 2020. We present also, an approach to determine the optimal number of service windows required to reduce the time spent waiting for healthcare attention. Numerical analysis of the queuing situation at the case department is given also, drawing from relevant equations from queuing theory.

OPTIMIZATION OF QUANTITY OF PASSENGER TRANSPORT FACILITIES IN URBAN TRANSPORT SUBJECT TO WAITING LOSS

2018 ◽  
pp. 7-16
Author(s):  
Sergey Valerevich Belov ◽  
Georgiy Aleksandrovich Popov ◽  
Ekaterina Aleksandrovna Popova
Keyword(s):  
Transport System ◽  
Queuing Theory ◽  
Nonlinear Function ◽  
Optimal Number ◽  
Urban Transport ◽  
Stationary Mode ◽  
System Of Equations ◽  
Passenger Transportation ◽  
Analytic Expressions ◽  
Two Parameters

The paper focuses on formalizing the task of choosing the optimal number of public transport for minimizing total losses of the transport system and all passengers (where passenger loss is expressed by their waiting time at the stations). As for the research tool, the queuing theory apparatus was chosen. There was introduced a nonlinear function that estimates passenger loss, given the relations for finding two parameters describing the function. A system of equations describing possible states of the queuing system under consideration in the stationary mode of its operation has been obtained. Similar equations are derived for the case when the rate of passengers arriving to the stations depends on the number of passengers already waiting at the stations, which is typical for cases where there are a small number of possible sources of passenger arrival to the station, e.g. in industrial districts of the cities.The optimization problem of finding the optimal number of vehicles is formulated by minimizing the total losses of the transport system and all passengers. The solution of the problem obtained is reduced to solving the system of equations using Newton method as one of the most effective methods for solving systems of equations defined by analytic expressions. Software implementation of the procedures given in the work will reduce the number of vehicles for passenger transportation to a certain acceptable level, thereby reducing the amount of traffic on urban roads.

Analysis of the Flow-Type Manufacturing Systems Using the Cyclic Queuing Theory

1978 ◽  
Vol 100 (4) ◽  
pp. 468-474 ◽  
Author(s):  
K. Hitomi ◽  
M. Nakajima ◽  
Y. Osaka
Keyword(s):  
Production Rate ◽  
Queuing Theory ◽  
Manufacturing Systems ◽  
Manufacturing System ◽  
Optimal Number ◽  
Automated Manufacturing ◽  
Transfer Lines ◽  
Flow Type ◽  
Automated Manufacturing System ◽  
Computational Procedures

A stochastic mathematical model was built and solved by using cyclic queuing theory for the multistage flow-type automated manufacturing system which is composed of several automated machine tools, movable pallets, transfer lines, and workpiece loading/unloading equipment, in an attempt to investigate the system’s behaviors such as production rate of a machine utilized in each stage, production rate of the system, mean number of waiting pallets at each stage, mean number of in-process inventories in each stage, and cycle time of a pallet. In case of limited space for in-process inventory at each stage, it was found that there exists the optimal number of pallets on the transfer line to maximize production rate. In addition, the computational procedures for analyzing the automated manufacturing system were developed and used to solve typical examples of the automated manufacturing system.

scholarly journals Queue Management Benchmark for Modelling Patients' Flow in Nigerian Public Hospitals

2021 ◽  
pp. 17-27
Author(s):  
Akpan, Anietie Peter ◽  
John, Efiok Nsikan
Keyword(s):  
Queuing Theory ◽  
Arrival Rate ◽  
General Purpose ◽  
Optimal Number ◽  
Public Hospitals ◽  
Service Rate ◽  
Queue Management ◽  
Managerial Implications ◽  
Performance Benchmark ◽  
The Mean

Although queue management in hospitals is widely researched, little is known about the benchmark for modelling patients flow in terms of the optimal number of servers required for effective service delivery. This study applied the queuing theory to the Nigerian public hospitals by setting a benchmark for modelling patients flow. A mixture of survey and observation was adopted to garner data for 30 days from patients in six public hospitals in Nigeria. Data were subjected to performance analysis via the Temporary Ordered Routine Algorithm. The computed performance values were further compared with their acceptable benchmarks for multi-server queues through the General Purpose System Simulator. We found the queuing system in the select hospitals not in congruence with the system performance benchmark; the mean service rate in each facility was low compared to the mean arrival rate; and the simulated number of doctors for were below the modelled benchmark. Managerial implications of findings were discussed.

scholarly journals PERBAIKAN SISTEM PENGUMPULAN SAMPAH PADA PERUMAHAN DI KOTA BATAM

2019 ◽  
Vol 13 (2) ◽  
pp. 117
Author(s):  
Welly Sugianto
Keyword(s):  
Queuing Theory ◽  
Garbage Collection ◽  
Finite Population ◽  
Arrival Rate ◽  
Optimal Number ◽  
Service Rate ◽  
Optimum Number ◽  
Total Cost ◽  
Operational Costs

AbstrakProses pengangkutan sampah di kota Batam dilakukan oleh truk pengangkut sampah. Truk pengangkut sampah masuk ke perumahan dan mengambil sampah yang ada di depan setiap rumah warga. Jumlah truk sampah tidak memadai sehingga sampah menumpuk di depan rumah warga. Warga mengambil inisiatif untuk membuang sampah tersebut di sembarang tempat sehingga tercipta TPS liar. Penelitian ini bertujuan untuk mencari jumlah truk pengangkut sampah yang optimum agar tidak terjadi timbunan sampah di depan rumah warga dan mencegah timbulnya TPS liar. Pendekatan yang digunakan adalah teori antrian dengan populasi terbatas. Truk sampah melayani sejumlah rumah dalam satu wilayah. Jumlah rumah dalam satu wilayah bersifat terbatas dan tetap. Rumah ditetapkan sebagai pelanggan jika jumlah sampah yang ada di depan rumah lebih dari 5 kantong atau lebih dari 20 kg. Beberapa data yang akan diobservasi adalah tingkat kedatangan dan kecepatan pelayanan. Berdasarkan data tersebut dapat dihitung beberapa parameter seperti tingkat antrian, waktu objek dalam antrian, probabilitas objek dalam sistem antrian, probabilitas sejumlah objek dalam antrian, dan biaya total yang merupakan penggabungan antara biaya antrian dan biaya operasional. Penelitian ini dilakukan di Kota Batam. Hasil penelitian menunjukkan bahwa teori antrian dengan populasi terbatas dapat diterapkan untuk menghitung jumlah truk pengangkut sampah yang optimum. Implementasi usulan perbaikan berdampak pada peningkatan kecepatan pelayanan dari 267,2 rumah per hari menjadi 480,8 rumah per hari. Jumlah truk yang optimum untuk satu wilayah perumahan setelah implementasi perbaikan adalah 2. Abstract[Determination of the Optimal Number of Trucks in the Garbage Transport Process] The garbage collection process in Batam city is carried out by garbage truck. Trucks must enter the housing and take out the garbage that is in front of each house. the number of garbage trucks is not enough so that the garbage overflows in front of the house. Residents took the initiative to dispose of the garbage in any place so as to create illegal polling stations. The objective of this research are to find the optimum garbage truck to avoid garbage pile in front of the residents' house and to prevent the occurrence of illegal polling stations. The approach used is queuing theory with limited population. Garbage trucks serve a number of houses in one area. The number of houses in one area is limited and fixed. The house is designated as a customer if the amount of garbage in front of the house is more than 5 bags or more than 20 kg. Some data to be observed is the arrival rate and speed of service. Some parameters to be calculated are the queue level, the time of the object in the queue, the probability of the object in the queue sistem, the probability of a number of objects in the queue, and the total cost which is a combination of queuing costs and operational costs. This research was conducted in Batam City. The results show that queuing theory with limited population can be applied to calculate the number of optimum garbage trucks. Implementation of the proposed improvements has an impact on the increase of speed of service rate  from 267.2 houses per day to 480.8 houses per day. The optimum number of trucks in region  after the implementation of the improvement is 2 Keywords: Queue; Finite Population; Garbage truck

Sign in / Sign up

Export Citation Format

Share Document