SWOT Analysis and a Case Study at Kayseri Airport

In this study, Kayseri Airport, which operates under Dhmi in Kayseri, is discussed within the scope of SWOT analysis. As a result, the most powerful aspect of Kayseri Airport is its proximity to the city, and the weakest dimension of Kayseri Airport is the low frequency of flights during the daytime. The outstanding features of Kayseri Airport regarding the opportunities arising from the external environment are tourism potential of the city, transport modes supporting each other, investments around the airport, supporting civil aviation nationwide, development of trade volume of the city. The most important feature of Kayseri Airport regarding the threats arising from the external environment are that it is not seen as a direct departure/destination point for international flights and distorted construction around the airport land.

Design and architecture solutions for service robot waiter with a specialized system of payload stabilization

Application of robotic devices in subject domains, where monotonous routines have to be performed promptly and accurately, is a relevant problem, particularly in complicated epidemiological situations. In this paper the design of robot waiters is analyzed and a design is proposed for stabilization of payload during delivering. Common applied problems in the robotic service domain are associated with the need to use such robots on mostly even, flat surfaces or with the arrangement of special structures that simplify the movement of a robotic device along a given route. The proposed solution potentially provides for cheaper, simpler and more optimized application of the robotic device indoors, inside the restraunt due to the developed buffer mechanism and the system of gyroscopic stabilization of the trays, as well as the implemented control system based on the PID controller and the PWM generator, which ensures the smooth movement of the robot (from the starting point to the destination point). Based on the proposed solution, we get a fully functional robotic device that does not require additional investments in the reconstruction of the restaurant premises, completely replaces the waiter when delivering food and drinks to the client's table, and also attracts new customers due to its novelty and practicality.

Path Planning and Obstacles Avoidance in Dynamic Workspace Using Polygon Shape Tangents Algorithm

This paper presents the design of a path planning system in an environment that contains a set of static and dynamic polygon obstacles localized randomly. In this paper, an algorithm so-called (Polygon shape tangents algorithm) is proposed to move a mobile robot from a source point to a destination point with no collision with surrounding obstacles using the visibility binary tree algorithm. The methodology of this algorithm is based on predicting the steps of a robot trajectory from the source to the destination point. The polygon shapes tangent algorithm is compared with the virtual circles' tangents algorithm for different numbers of static and dynamic polygon obstacles for the time of arrival and the length of the path to the target. The obtained result shows that the used algorithm has better performance than the other algorithms and gets less time of arrival and shortest path with free collision.

Are current tsunami evacuation approaches safe enough?

Developing an effective tsunami evacuation plan is essential for disaster risk reduction in coastal regions. To develop effective tsunami evacuation plans, real transportation network, interaction among evacuees, and uncertainties associated with future tsunami events need to be considered in a holistic manner. This study aims to develop such an integrated tsunami evacuation approach using agent-based evacuation simulation and advanced stochastic tsunami hazard assessment. As a case study, a urban area in Padang, Indonesia, threatened by tsunamis from the Mentawai–Sunda subduction zone, is adopted. The uncertainty of the tsunami hazard is taken into account by generating 900 stochastic tsunami inundation maps for three earthquake magnitudes, i.e. 8.5, 8.75, and 9.0. A simplified evacuation approach considering the evacuees moving directly to evacuation areas (defined a priori) is compared with two more rigorous agent-based modeling approaches: (a) a two-destination-point tsunami evacuation plan developed by the local government and (b) a multiple-destination-point plan developed in this study. The improved agent-based stochastic tsunami evacuation framework with multiple destinations takes advantage of the extensive tsunami hazard analyses to define safe areas in a dynamic manner and is capable of capturing the uncertainty of future tsunami risk in coastal areas. In contrast, the results clearly show that the simplified approach significantly underestimates the evacuation time, and the existing tsunami evacuation routes identified by local authorities may be insufficient to save lives.

Optimize the Time and Network on the Distribution of Tempe Industry by Using the Approach of the Assignment and Networking

The problems that occur in the soybean tempe home industry are the competition in the market sector and unstable prices. The purpose of this study is to determine the assignment of employees in performing their works and to distribute them to each destination with the shortest distance. The research method used is assignment, networking using the assistance of the operations management software program - quantitative methods (POM-QM) for windows. The data used are the primary data conducted in a preliminary study. In addition, data collection techniques are carried out in several ways, namely interviews, observation and schedule recording. The finding provides optimal results for all four employees based on suitable jobs. Each employee is employee 1 with a type of laundering taking 17 minutes. Employees 2 with a kneading type of work taking 35 minutes. Eemployees 3 with wrapping job type taking 10 minutes. Meanwhile, eemployees 4 is breawing taking 15 minutes. In addition, the distribution of tempe to the destination point with the shortest route produces a distance of 76 km.

Traffic Controller for Vip/Ambulance Vehicle & Location Tracking

In India the rate of inhabitants is increased day By day but as compare to other countries India is having a poor Road transportation system. So due to these the Emergency Vehicles like mobile hospital, Fire service vehicle, VIP Vehicle, and police vehicle. Vehicle always faced so many problems to reach the destination. If an Ambulance stuck in a traffic then the patient inside it can Lose his/her life. Indians now a days gets aware about organs contributions, the rate of organ donation is also increased. But the main problem in organ transport is that it remains healthy only for very short time. So transporting them is a time dependent task. If the Emergency Vehicles do not reach at its destination point in time it causes human health and wealth. So by using a process that clearing the traffic signal before an Emergency Vehicle Reaches to the signal using IOT will resolve the problem.

FORMULATION OF THE PROBLEM OF PLANNING AIRCRAFT ROUTES WHEN SERVICING A RANDOM FLOW OF APPLICATIONS ARRIVING IN FLIGHT

The work is about process of ground facilities servicing by aircrafts group when receiving requests during the flight. In case of manned aircraft, servicing of one request refers to the flight from the point to another one. As for unmanned aircrafts, it is necessary to observe reached destination point at the specified speed and flight altitude. It is assumed that the distance between the points and the moments of requests appearing ranked by the Poisson law. Necessary condition of successful task solving is that the average service speed of the requests flow exceeds the average speed of their receipt. It was found that taking into account the randomness of requests, three flight situations are possible – the “idle” mode in service when the requests number is less than the number of unoccupied aircraft, the regular mode when the balance of supply and demand and the “peak” mode when the requests number is increased and there is a queue in service.

Shortest Route Application via Dynamic Programming in the Transportation Networks

The purpose of this study is to develop an application for finding the shortest path in the transportation sector. The application was developed using the dynamic programming method in MS Excel Visual Basic application. These types of problems are also called stagecoach problems. The purpose of the problem is finding the shortest path between the starting point (node) and the destination point. Values are related to the roads in the network to specify the distance between two nodes. In case of a small number of nodes (activities), a solution can be reached by evaluating all options. But the number of possible options to be scanned for real problems is quite large. In such cases, a suitable method is needed for the solution. It can produce effective solutions with the dynamic programming approach.

Green Transhipment Model Considering Carbon Emission Cost Using Mixed Integer Linear Programming (Case Study: Beef Distribution in Bogor, Indonesia)

The operational research paper in the transportation model nowadays is heading to the environmental issue. One of the famous operational research models is transshipment. Transshipment is an expanded model of transportation, whether each distribution center between the start to the destination point. In this research, the transshipment model is integrated into an environmental function, the challenge is to find the right shipment of each route from the start, distribution, and destination point considering the transportation cost and carbon emission. This research proposed a transshipment model with minimizing transportation and carbon emission cost using mixed-integer linear programming for model formulation. The solution searching used branch and bound method. This research analyzed the environmental objective function and constrain effect in the transshipment model. The model is tested in a beef distribution case study in Bogor, Indonesia that has eight source points, three distribution centers, and six destination points. The model is experimented by carbon emission limitation scenarios. The optimum result in source allocation, distribution and destination are different between the two scenarios. The carbon emission limitation affects carbon emission production and total cost. Keywords: Branch and Bound, Environmental Cost, Green Transhipment, Mixed Integer Linear Programming preferably 2-scenarios are mentioned