Our system is currently under heavy load due to increased usage. We're actively working on upgrades to improve performance. Thank you for your patience.
2005
DOI: 10.3141/1923-01
|View full text |Cite
|
Sign up to set email alerts
|

Online Dispatching and Routing Model for Emergency Vehicles with Area Coverage Constraints

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
25
0

Year Published

2007
2007
2018
2018

Publication Types

Select...
5
3
1

Relationship

1
8

Authors

Journals

citations
Cited by 38 publications
(25 citation statements)
references
References 14 publications
0
25
0
Order By: Relevance
“…This model, takes into account standard coverage and capacity constraints, as well as some dynamic features of the problem such as avoiding to move the same ambulance repeatedly, avoiding round trips and avoiding long trips. Yang et al [26] consider the dispatching and relocation of EVs in a single problem and used an online dispatch framework, in order to improve the EV operations. Maxwell et al [27] presented an approximated dynamic programming approach to decide where to redeploy the idle ambulances to maximize number of calls reached within a delay threshold.…”
Section: Literature Reviewmentioning
confidence: 99%
“…This model, takes into account standard coverage and capacity constraints, as well as some dynamic features of the problem such as avoiding to move the same ambulance repeatedly, avoiding round trips and avoiding long trips. Yang et al [26] consider the dispatching and relocation of EVs in a single problem and used an online dispatch framework, in order to improve the EV operations. Maxwell et al [27] presented an approximated dynamic programming approach to decide where to redeploy the idle ambulances to maximize number of calls reached within a delay threshold.…”
Section: Literature Reviewmentioning
confidence: 99%
“…In the case of emergency vehicles [12] the problem is treated under the assumption that a general vehicle covers a given zone, assigning to the vehicles a sequence of nodes to visit according to the characteristics of the users served.…”
Section: Many To Onementioning
confidence: 99%
“…To solve the one-to-one (shortest path) problem exact or heuristic algorithms [8,9] can be used. Considering the ordinary condition, in the literature there are several applications of these procedures also for ambulance dispatching [10].…”
Section: Introductionmentioning
confidence: 99%
“…The problem generally regards goods distribution. However, few works consider the vehicle routing problem for emergency vehicles in ordinary conditions [10] and under emergency conditions in [11,12]. For an extended review of these topics refer to [4,5].…”
Section: Introductionmentioning
confidence: 99%