A conflict-based path-generation heuristic for evacuation planning

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Conflict-Based Path-Generation Heuristic for Evacuation Planning

5 Evacuation planning and scheduling is a critical aspect of disaster management and national security applications. This paper proposes a conflict-based path-generation approach for evacuation planning. Its key idea is to decompose the evacuation planning problem into a master and a subproblem. The subproblem generates new evacuation paths for each evacuated area, while the master problem opti...

متن کامل

A Path-Generation Matheuristic for Large Scale Evacuation Planning

In this study we present a general matheuristic that decomposes the problem being solved in a master and a subproblem. In contrast with the column generation technique, the proposed approach does not rely on the explicit pricing of new columns but instead exploits features of the incumbent solution to generate one or more columns in the master problem. We apply this approach to large scale evac...

متن کامل

A Guide to Heuristic-based Path Planning

We describe a family of recently developed heuristicbased algorithms used for path planning in the real world. We discuss the fundamental similarities between static algorithms (e.g. A*), replanning algorithms (e.g. D*), anytime algorithms (e.g. ARA*), and anytime replanning algorithms (e.g. AD*). We introduce the motivation behind each class of algorithms, discuss their use on real robotic sys...

متن کامل

Potential functions based sampling heuristic for optimal path planning

Rapidly-exploring Random Tree Star(RRT*) is a recently proposed extension of Rapidly-exploring Random Tree (RRT) algorithm that provides a collisionfree, asymptotically optimal path regardless of obstacles geometry in a given environment. However, one of the limitation in the RRT* algorithm is slow convergence to optimal path solution. As a result it consumes high memory as well as time due to ...

متن کامل

Optimal Pedestrian Path Planning in Evacuation Scenario

Simulation of evacuation plans is a relatively complex problem. It is necessary to simulate a number of separate processes which interact in the result. Namely, they are pedestrian-pedestrian interactions, pedestrian-static object (e.g. wall) interactions and pedestrian-environment (fire, smoke, etc.) interactions. In this case, the evacuation simulation is controled on the microscopic level. M...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Transportation Research Part B: Methodological

سال: 2016

ISSN: 0191-2615

DOI: 10.1016/j.trb.2015.09.008