ОПТИМАЛЬНАЯ МАРШРУТИЗАЦИЯ ВОЗДУШНЫХ СУДОВ И МАШИН СКОРОЙ ПОМОЩИ В ЛОГИСТИКЕ ПРИ СТИХИЙНЫХ БЕДСТВИЯХ

One of the most vital aspects of emergency management studies is the development and examination of post-disaster search and rescue activities and treatment facilities. One of such issues to be considered while performing these operations is to reach the disaster victims within minimum time and to plan disaster logistics in the most efficient manner possible. In this study, the problem of planning debris scanning activities with Unmanned Aerial Vehicles after an earthquake and transporting the injured people to the hospitals by ambulances within minimum time was discussed, and mathematical models were developed to solve the problem. The ambulance routing problem and the mathematical model to be used in the solution to the problem are discussed for the first time in the literature. The developed model was tested on the problem sets created by taking into account the data of the province under investigation.Одним из наиболее важных аспектов исследований по управлению рисками и чрезвычайными ситуациями является разработка и изучение поисково-спасательных мероприятий и очистных сооружений после стихийных бедствий. Одним из вопросов, которые необходимо учитывать при выполнении этих операций, является обеспечение доступа к жертвам стихийных бедствий в минимальные сроки и планирование логистики в случае стихийных бедствий наиболее эффективным способом. В данном исследовании рассматривается проблема планирования работ по спасению с помощью беспилотных летательных аппаратов после землетрясения и транспортировки пострадавших людей в больницы на машинах скорой помощи за минимальное время. Для решения этой проблемы были разработаны и предложены математические модели. Впервые рассматривается задача маршрутизации скорой помощи и математическая модель, которая будет использоваться для решения этой задачи. Разработанная модель была протестирована на множествах задач, созданных с учетом реальных данных исследуемой провинции Турции

Food emergency dispatching method based on optimized fireworks algorithm

In order to solve the problem of food emergency dispatching under emergencies, a food emergency dispatching method based on the optimal fireworks algorithm was proposed. The fitness function was used to measure the individual merits of fireworks, the tabu table was set to avoid the fireworks algorithm falling into the local optimal, and the tournament strategy was adopted as the iterative strategy of fireworks population. The goal of the fitness function is to maximize the satisfaction of demand points and minimize the vehicle travel time.In order to accurately predict the amount of food required at the point of demand, an infectious disease model (SEIR) was used.By comparing with the basic fireworks algorithm and genetic algorithm, the simulation results show that the proposed algorithm has higher computational efficiency and can be used in food emergency dispatching

Route Optimization System

This final year project is focused on creating a route generation application that can find the best route on a real road network. The distinct lack of route optimization systems or route generation system in Malaysia was the motivational factor behind this project. It is a collaborative project between another final year student and me. I will be concentrating on finding the best algorithm for calculating the shortest distance between two points on a digital map. After much research into the many algorithms available, and considering some, including Genetic Algorithm (GA), the author selected Dijkstra's Algorithm (DA). This algorithm is an exact algorithm that is specifically for finding the shortest route in a network. It has been used in other networks beside roads, for instance, pipe networks or railway networks. The method used to develop this project is Rapid Application Development (RAD). Using that process, we have settled on Java as our development platform as we found it able to both implement DA and the GIS component (map display and manipulation). The software that we came up with allows the user to select a point of origin on the map and a destination point and expect the software to highlight the best route onthe map as well as output the road names in that route, from the origin to the destination. It will also give the user the total distance from origin to destination. It does not take into account the amount of time that the drivermight take to travel that distance. This project is just the first step in creating a more robust route generation system for the Malaysian market. The potential for this project to be propagated on a mobile platform can also be considered due to its Java platform

Analysing the police patrol routing problem : a review

Police patrol is a complex process. While on patrol, police officers must balance many intersecting responsibilities. Most notably, police must proactively patrol and prevent offenders from committing crimes but must also reactively respond to real-time incidents. Efficient patrol strategies are crucial to manage scarce police resources and minimize emergency response times. The objective of this review paper is to discuss solution methods that can be used to solve the so-called police patrol routing problem (PPRP). The starting point of the review is the existing literature on the dynamic vehicle routing problem (DVRP). A keyword search resulted in 30 articles that focus on the DVRP with a link to police. Although the articles refer to policing, there is no specific focus on the PPRP; hence, there is a knowledge gap. A diversity of approaches is put forward ranging from more convenient solution methods such as a (hybrid) Genetic Algorithm (GA), linear programming and routing policies, to more complex Markov Decision Processes and Online Stochastic Combinatorial Optimization. Given the objectives, characteristics, advantages and limitations, the (hybrid) GA, routing policies and local search seem the most valuable solution methods for solving the PPRP

Performance Analysis of AntNet-LA Protocol for Ad-hoc Networks based on Disaster Area Mobility Model

Availability of cheap positioning instruments like GPS receivers makes it possible for routing algorithms to use the position of nodes in an ad hoc mobile network. Regular position based routing algorithms fail to find a route from a source to a destination in some cases when the network contains nodes with irregular transmission ranges or they find a route that is much longer than the shortest path. On the other hand routing algorithms based on Ant Colony Optimization (ACO) find routing paths that are close to the shortest paths even if the nodes in the network have different transmission ranges. The drawback of these algorithms is the large number of messages that needs to be sent or the long delay before the routes are established. In this paper, we propose a novel protocol AntNet-LA which combines the idea of ACO with information about position of all nodes. In this technique the distance between the nodes is considered to transmit the packets, hence overcomes the drawbacks of AntNet algorithm which considers only cumulative probability for packet transmission. We compare performance of AntNet-LA with AntNet, Ad-hoc On Demand Distance Vector (AODV), Ad-hoc On Demand Multipath Distance Vector (AOMDV), Dynamic Source Routing (DSR) and Destination-Sequenced Distance-Vector Routing (DSDV) protocols. We also compare performance of AntNet-LA with distance-aware protocols such as Location Aided Routing (LAR), Geographical AODV GeoAODV and Position Based ANT colony optimization (PBANT)

Performance Analysis of AntNet-LA Protocol for Ad-hoc Networks based on Disaster Area Mobility Model

Availability of cheap positioning instruments like GPS receivers makes it possible for routing algorithms to use the position of nodes in an ad hoc mobile network. Regular position based routing algorithms fail to find a route from a source to a destination in some cases when the network contains nodes with irregular transmission ranges or they find a route that is much longer than the shortest path. On the other hand routing algorithms based on Ant Colony Optimization (ACO) find routing paths that are close to the shortest paths even if the nodes in the network have different transmission ranges. The drawback of these algorithms is the large number of messages that needs to be sent or the long delay before the routes are established. In this paper, we propose a novel protocol AntNet-LA which combines the idea of ACO with information about position of all nodes. In this technique the distance between the nodes is considered to transmit the packets, hence overcomes the drawbacks of AntNet algorithm which considers only cumulative probability for packet transmission. We compare performance of AntNet-LA with AntNet, Ad-hoc On Demand Distance Vector (AODV), Ad-hoc On Demand Multipath Distance Vector (AOMDV), Dynamic Source Routing (DSR) and Destination-Sequenced Distance-Vector Routing (DSDV) protocols. We also compare performance of AntNet-LA with distance-aware protocols such as Location Aided Routing (LAR), Geographical AODV GeoAODV and Position Based ANT colony optimization (PBANT)

OPTIMUM ROUTING OF AERIAL VEHICLES AND AMBULANCES IN DISASTER LOGISTICS

One of the most vital aspects of emergency management studies is the development and examination of post-disaster search and rescue activities and treatment facilities. One of such issues to be considered while performing these operations is to reach the disaster victims within minimum time and to plan disaster logistics in the most efficient manner possible. In this study, the problem of planning debris scanning activities with Unmanned Aerial Vehicles after an earthquake and transporting the injured people to the hospitals by ambulances within minimum time was discussed, and mathematical models were developed to solve the problem. The ambulance routing problem and the mathematical model to be used in the solution to the problem are discussed for the first time in the literature. The developed model was tested on the problem sets created by taking into account the data of the province under investigation

Route Optimization System

Congestion has been the main factor for the traveler to plan their destination. The traveler needs to consider the time and even cancel their planning to one place because of this factor. With the advancement of the technology that can guides in decision making, it can solve one of the traveler problem. Route optimization system is a stand-alone system that can give the traveler the shortest route upon user request. This system can be an important resource for the traveler to reach their destination within their planning schedule. This project will highlight the usage of GIS in implementing the system. The objective of this project is focusing on the integration of Geographical Information System (GIS) and Artificial Intelligence (AI). The main purpose is to concentrate in displaying the map along with the database, searching and enable user to retrieve the shortest path. This is due to enhance the capability of the user to choose another route. The method used in this project is Rapid Application Development (RAD) methodology which consists of four stages; requirement planning, user design, construction and cutover. This research also details the study on current system that has already implemented in Europe, which with the same objective is to find the shortest path. While in Malaysia, the car manufacturer is doing this system which motivates me to do this route optimization system as well. The result from the research will be the proposed framework for route optimization system, the discussion on the GIS and AI as well as the prototype of this system. This study proved that Route Optimization System has great potential to be commercially implemented to get the shortest path as today's community is eager of getting free from congestion on the road