Citation
Scheduling evacuation operations. Journal of Scheduling, 19 (4): 467-478, 2016.
Selected
Abstract
In this paper, we consider a large-scale evacuation problem after a major disaster. The evacuation is assumed to occur by means of a fleet of buses, thus leading to scheduling the evacuation operations by buses [(bus evacuation problem (BEP)]. We propose time-indexed formulations as well as heuristic algorithms such as greedy algorithms and a matheuristic. This matheuristic uses the former formulation to improve the best solution obtained by the greedy heuristics. In computational experiments, we analyze and evaluate the efficiency of the proposed solution algorithms.
There is no pdf available for this paper. You might like to try to obtain the original source (see the doi, for example)
doi
The doi for this publication is 10.1007/s10951-015-0461-x You can link directly to the original paper, via the doi, from here
What is a doi?: A doi (Document Object Identifier) is a unique identifier for sicientific papers (and occasionally other material). This provides direct access to the location where the original article is published using the URL http://dx.doi/org/xxxx (replacing xxx with the doi). See http://dx.doi.org/ for more information
URL
This pubication does not have a URL associated with it.
The URL is only provided if there is additional information that might be useful. For example, where the entry is a book chapter, the URL might link to the book itself.
Bibtex
@ARTICLE{2016-467-478-SI, author = {Deghdak, Kaouthar and T'kindt, Vincent and Bouquard, Jean-Louis},
title = {{Scheduling evacuation operations}},
journal = {Journal of Scheduling},
year = {2016},
volume = {{19}},
pages = {467--478},
number = {4},
note = {Selected},
abstract = {{In this paper, we consider a large-scale evacuation problem after a major disaster. The evacuation is assumed to occur by means of a fleet of buses, thus leading to scheduling the evacuation operations by buses {[}(bus evacuation problem (BEP)]. We propose time-indexed formulations as well as heuristic algorithms such as greedy algorithms and a matheuristic. This matheuristic uses the former formulation to improve the best solution obtained by the greedy heuristics. In computational experiments, we analyze and evaluate the efficiency of the proposed solution algorithms.}},
doi = {{10.1007/s10951-015-0461-x}},
eissn = {{1099-1425}},
issn = {{1094-6136}},
owner = {Graham},
timestamp = {2017.01.18},
unique-id = {{ISI:000379627200008}} }