An efficient distributed optimization and coordination protocol: application to the emergency vehicle management
From MaRDI portal
Publication:2514639
DOI10.3934/JIMO.2015.11.41zbMath1306.93057OpenAlexW2331646524MaRDI QIDQ2514639
Publication date: 3 February 2015
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jimo.2015.11.41
Cites Work
- Bounded approximate decentralised coordination via the max-sum algorithm
- Solving the dynamic ambulance relocation and dispatching problem using approximate dynamic programming
- Distributed stochastic search and distributed breakout: properties, comparison and applications to constraint optimization problems in sensor networks
- The distributed breakout algorithms
- Sensor networks and distributed CSP: communication, computation and complexity
- Adopt: asynchronous distributed constraint optimization with quality guarantees
- The Maximal Expected Covering Location Problem: Revisited
- The maximal expected coverage relocation problem for emergency vehicles
- Decision support tools for ambulance dispatch and relocation
- The Maximum Availability Location Problem
- The Location of Emergency Service Facilities
- A dynamic model and parallel tabu search heuristic for real-time ambulance relocation
This page was built for publication: An efficient distributed optimization and coordination protocol: application to the emergency vehicle management