Authors:
Kaouthar Deghdak
;
Vincent T'kindt
and
Jean-Louis Bouquard
Affiliation:
Université Franc¸ois–Rabelais Tours, France
Keyword(s):
Scheduling evacuation, Branch and Bound, Greedy heuristic, Matheuristic
Related
Ontology
Subjects/Areas/Topics:
Applications
;
Artificial Intelligence
;
Knowledge Discovery and Information Retrieval
;
Knowledge-Based Systems
;
Methodologies and Technologies
;
Operational Research
;
Optimization
;
Pattern Recognition
;
Scheduling
;
Software Engineering
;
Symbolic Systems
Abstract:
In this paper, we consider a large-scale evacuation problem after an important disaster. We model the evacuation
of a region from a set of collection points to a set of capacitated shelters with the help of buses, thus
leading to scheduling the evacuation operations by buses (Bus Evacuation Problem, BEP). The goal is twofold;
first, minimizing the total evacuation time needed to bring the resident out of the endangered region, and secondly,
minimizing the total exposure to danger. The resulting problem is a bicriteria problem. We propose a
time-indexed formulation, as well as several approaches for finding both upper and lower bounds for BEP used
within a branch and bound algorithm. In computational experiments, we analyse and evaluate the efficiency
of the proposed solution algorithms.