Have a nice trip: an algorithm for identifying excess routes under satisfaction constraints

Skov-Petersen, Hans; Zachariasen, Martin; Kefaloukos, Pimin Konstantin

doi:10.1080/13658810903514180

Cited by 4 publications

(4 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Evacuation route planning is complicated due to the complex data integration, dynamic data updating, critical time to solve the problem, and multiple constraints . In this paper, we have developed a GA‐based framework that can support the dynamic representation and updating of networks.…”

Section: Discussionmentioning

confidence: 99%

“…Evacuation route planning is complicated due to the complex data integration, dynamic data updating, critical time to solve the problem, and multiple constraints. 22,23 In this paper, we have developed a GA-based framework that can support the dynamic representation and updating of networks. The separation of the network topology and weights makes the data updating direct and convenient, which makes the integrating of the complex dynamic model simulation model in the evacuation much easier compared with classical topological network representation.…”

Section: Discussionmentioning

confidence: 99%

See 1 more Smart Citation

Multisource multisink optimal evacuation routing with dynamic network changes: A geometric algebra approach

Zhu

et al. 2017

Math Methods in App Sciences

View full text Add to dashboard Cite

In this paper, we introduced geometric algebra to develop a new multisource multisink optimal evacuation route planning method. A dynamically updatable data structure and a matrix‐based greedy searching algorithm were developed to support the dynamic evacuation route searching for multiple evacuees. Unlike most existing methods, which iteratively search the optimal path for each evacuee, our method can search all the possible evacuation routes synchronously. The dynamic updating of the network topography, weights, and constraints during the route searching is direct and flexible, thus can support the evacuation in dynamic cases. The method is demonstrated and tested by an evacuation case in the city of Changzhou, China. The simulation experiments suggest that the method can well support the dynamic route searching in large scales with dynamic weight changes.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Discussionmentioning

confidence: 99%

Multisource multisink optimal evacuation routing with dynamic network changes: A geometric algebra approach

Zhu

et al. 2017

Math Methods in App Sciences

View full text Add to dashboard Cite

show abstract

“…A abordagem carpooling deve facilitar de forma fácil e rápida o agendamento das viagens com base nas preferências e necessidades de um viajante [22,23].…”

Section: Factores De Incentivounclassified

MoCaS: Mobile Carpooling System

Ribeiro

Silva

Abreu

2015

New Contributions in Information Systems and Technologies

View full text Add to dashboard Cite

“…For instance, in a typical scenario of a long-distance self-driving tour, the navigation may first start from route planning with a start point and an end point. During the travel, users may add location constraints [16], reliability constraints [17], turn constraints [18] for intercity traffic and cycle routes [19], or satisfaction constraints [20]. Certain emergency cases may also exist that require the planned route to be dynamically adjusted in a short amount of time according to a series of constraints.Previous initial studies have addressed the solution of DMCOP with type I dynamics (i.e., network status changes) [21].…”

mentioning

confidence: 99%

Optimal Route Searching with Multiple Dynamical Constraints—A Geometric Algebra Approach

Luo

et al. 2018

IJGI

View full text Add to dashboard Cite

The process of searching for a dynamic constrained optimal path has received increasing attention in traffic planning, evacuation, and personalized or collaborative traffic service. As most existing multiple constrained optimal path (MCOP) methods cannot search for a path given various types of constraints that dynamically change during the search, few approaches for dynamic multiple constrained optimal path (DMCOP) with type II dynamics are available for practical use. In this study, we develop a method to solve the DMCOP problem with type II dynamics based on the unification of various types of constraints under a geometric algebra (GA) framework. In our method, the network topology and three different types of constraints are represented by using algebraic base coding. With a parameterized optimization of the MCOP algorithm based on a greedy search strategy under the generation-refinement paradigm, this algorithm is found to accurately support the discovery of optimal paths as the constraints of numerical values, nodes, and route structure types are dynamically added to the network. The algorithm was tested with simulated cases of optimal tourism route searches in China's road networks with various combinations of constraints. The case study indicates that our algorithm can not only solve the DMCOP with different types of constraints but also use constraints to speed up the route filtering.Two different types of dynamics can increase the complexity of the DMCOP problem. With type I dynamics, the network condition, such as the weight or topology, changes during optimal path searching; the constraints are not altered. For example, in adaptive dynamic traffic navigation, the optimal path should be dynamically generated with the traffic conditions, where the weights are dynamically changed according to the current traffic status. With type II dynamics, the network conditions are not changed; however, the constraints used to restrict the searching of the optimal path change with time. One example is event-forced constraints, which are not determined unless a certain kind of event (e.g., emergency or user interactions) occurs. In this way, the constraints should be changed according to the specific schedule of the event dynamically occurring. Since these different constraints cannot be known in advance, these constraints should be added dynamically during route planning [15]. For instance, in a typical scenario of a long-distance self-driving tour, the navigation may first start from route planning with a start point and an end point. During the travel, users may add location constraints [16], reliability constraints [17], turn constraints [18] for intercity traffic and cycle routes [19], or satisfaction constraints [20]. Certain emergency cases may also exist that require the planned route to be dynamically adjusted in a short amount of time according to a series of constraints.Previous initial studies have addressed the solution of DMCOP with type I dynamics (i.e., network status changes) [21]. Schott and Staples ...

show abstract

Have a nice trip: an algorithm for identifying excess routes under satisfaction constraints

Cited by 4 publications

References 11 publications

Multisource multisink optimal evacuation routing with dynamic network changes: A geometric algebra approach

Multisource multisink optimal evacuation routing with dynamic network changes: A geometric algebra approach

MoCaS: Mobile Carpooling System

Optimal Route Searching with Multiple Dynamical Constraints—A Geometric Algebra Approach

Contact Info

Product

Resources

About