Open AccessA Car Flow Network Model For Lane-Based Evacuation Routing Problem
Author(s) -
Julianto,
Herman Mawengkang,
Muhammad Zarlis
Publication year - 2019
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1255/1/012040
Subject(s) - shortest path problem , computer science , point (geometry) , flow network , flow (mathematics) , routing (electronic design automation) , trajectory , process (computing) , mathematical optimization , path (computing) , operations research , dijkstra's algorithm , traffic flow (computer networking) , minimum cost flow problem , mathematics , computer network , theoretical computer science , graph , physics , geometry , astronomy , operating system
The problem of evacuation is very important when a disaster occurs. Evacuation must have systematic planning and good calculation. The planning is related to determining the route and flow of the vehicle. The shortest route problem is a matter of how to travel from one point of source through the paths to the destination with the shortest distance. The shortest path is the minimum trajectory needed to reach a certain point. In addition to the trajectory that has passed the shortest route, it needs to be taken into account about the maximum flow of a network. The maximum flow problem aims to maximize the movement of a number of items or objects through certain paths from the point of source to the end point. In this paper, in the future a model of vehicle movement will be developed to evacuate victims with maximum flow and through the shortest evacuation route by taking into account the paths to be followed in order to implement an effective evacuation process.