Solving the dynamic ambulance relocation and dispatching problem using approximate dynamic programming (Q1926680): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q41650045, #quickstatements; #temporary_batch_1707161894653
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Commentary / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2011.10.043 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1988963644 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4257216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ambulance location and relocation models. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic solution of an extended double-coverage ambulance location problem for Austria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving an ambulance location model by tabu search / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dynamic model and parallel tabu search heuristic for real-time ambulance relocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximal expected coverage relocation problem for emergency vehicles / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Adaptive Dynamic Programming Algorithm for Dynamic Fleet Management, I: Single Period Travel Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Adaptive Dynamic Programming Algorithm for Dynamic Fleet Management, II: Multiperiod Travel Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Application of the Double Standard Model for Ambulance Location / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Dynamic Programming for Ambulance Redeployment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Dynamic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: <b>Feature Article</b>—Merging AI and OR to Solve High-Dimensional Stochastic Optimization Problems Using Approximate Dynamic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3372287 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A representational paradigm for dynamic resource transformation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multiperiod set covering location model for dynamic redeployment of ambulances / rank
 
Normal rank
Property / cites work
 
Property / cites work: <b>Commentary</b>—Post-Decision States and Separable Approximations Are Powerful Tools of Approximate Dynamic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ambulance location and relocation problems with time-dependent travel times / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Location of Emergency Service Facilities / rank
 
Normal rank

Latest revision as of 01:26, 6 July 2024

scientific article
Language Label Description Also known as
English
Solving the dynamic ambulance relocation and dispatching problem using approximate dynamic programming
scientific article

    Statements

    Solving the dynamic ambulance relocation and dispatching problem using approximate dynamic programming (English)
    0 references
    0 references
    29 December 2012
    0 references
    OR in health services
    0 references
    emergency vehicles
    0 references
    ambulance location
    0 references
    approximate dynamic programming
    0 references
    stochastic optimization
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references