Articlehybrid2018

An Improved Shuffled Frog Leaping Algorithm and Its Application in Dynamic Emergency Vehicle Dispatching

Xiaohong Duan · Tianyong Niu · Qi ping Huang

16 citations0/0 files storedMathematical Problems in Engineering

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Facility Location and Emergency Management Metaheuristic Optimization Algorithms Research Vehicle Routing Optimization Methods

Abstract

The traditional method for solving the dynamic emergency vehicle dispatching problem can only get a local optimal strategy in each horizon. In order to obtain the dispatching strategy that can better respond to changes in road conditions during the whole dispatching process, the real-time and time-dependent link travel speeds are fused, and a time-dependent polygonal-shaped link travel speed function is set up to simulate the predictable changes in road conditions. Response times, accident severity, and accident time windows are taken as key factors to build an emergency vehicle dispatching model integrating dynamic emergency vehicle routing and selection. For the unpredictable changes in road conditions caused by accidents, the dispatching strategy is adjusted based on the real-time link travel speed. In order to solve the dynamic emergency vehicle dispatching model, an improved shuffled frog leaping algorithm (ISFLA) is proposed. The global search of the improved algorithm uses the probability model of estimation of distribution algorithm to avoid the partial optimal solution. Based on the Beijing expressway network, the efficacy of the model and the improved algorithm were tested from three aspects. The results have shown the following: (1) Compared with SFLA, the optimization performance of ISFLA is getting better and better with the increase of the number of decision variables. When the possible emergency vehicle selection strategies are 815, the objective function value of optimal selection strategies obtained by the base algorithm is 210.10% larger than that of ISFLA. (2) The prediction error of the travel speed affects the accuracy of the initial emergency vehicle dispatching. The prediction error of ±10 can basically meet the requirements of the initial dispatching. (3) The adjustment of emergency vehicle dispatching strategy can successfully bypassed road sections affected by accidents and shorten the response time.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 16 citations exist upstream.

References

2008Path selection model and algorithm for emergency logistics management 1996A network flow approach to a city emergency evacuation planning 1972Response Areas for Two Emergency Units 2017A multi-objective evolutionary algorithm for multi-period dynamic emergency resource scheduling problems 2002A real-time decision support system for roadway network incident response logistics 2004Simulation Model for Real-Time Emergency Vehicle Dispatching and Routing 1999Opportunity Cost-Based Models for Traffic Incident Response Problems 2017Solving a grey project selection scheduling using a simulated shuffled frog leaping algorithm

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

Imported from OpenAlex (CC0) — nothing here is generated.