Taxonomy and categorization of evacuation and similar problems
| Demand | Type of fleet | Trip type | Travel times | Type of clients | Number of depots | Depot Capacity | Routes | Visits to Clients | Mathematical Model | Solutions | Solution approach | Case Study | |||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Authors | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | Exact | Heuristic | |||
Bish (2011) | X | X | X | X | X | X | X | X | X | MIP | X | Constructive Heuristic | No | ||||||||||
Gocrigk and Grün 2012 | X | X | X | X | X | X | X | X | X | MIP | X | Tabu search | No | ||||||||||
Perkins et al. (2001) | X | X | X | X | X | X | Not defined | X | X | BIP | X | Simulations | Yes | ||||||||||
Margulis et al. (2006) | X | X | X | X | X | X | X | X | X | BIP | X | Not defined | Yes | ||||||||||
Goerigk et al. (2013) | X | X | X | X | X | X | X | X | X | MILP | X | Branch and Bound | No | ||||||||||
Sayyady and Eksioglu (2010) | X | X | X | X | X | X | X | X | X | MILP | X | Tabu Search | Yes | ||||||||||
Dikas and Minis (2016) | X | X | X | X | X | X | X | X | X | MIP | X | Hybrid Solution Techniques | No | ||||||||||
Zheng (2014) | X | X | X | X | X | X | X | X | X | MIP | X | Lagrangian-relaxation | No | ||||||||||
Goerigk et al. (2014) | X | X | X | X | X | X | X | X | X | MILP | X | Branch-and-Price | No | ||||||||||
Bard et al. (1998) | X | X | X | X | X | X | X | X | X | MILP | X | Branch-and-Cut | No | ||||||||||
Brandao and Mercer (1998) | X | X | X | X | X | X | Not defined | X | X | Not defined | X | Tabu Search | No | ||||||||||
Petch and Salhi (2003) | X | X | X | X | X | X | X | X | Not defined | X | Constructive heuristic | No | |||||||||||
Salhi and Petch (2007) | X | X | X | X | X | X | Not defined | X | X | Not defined | X | Hybrid Genetic Algorithm | No | ||||||||||
Crevier et al. (2007) | X | X | X | X | X | X | X | X | X | MILP | X | Tabu Search | No | ||||||||||
Tarantilis et al. (2008) | X | X | X | X | X | X | X | X | X | Not defined | X | VNS, Tabu Search, GLS | No | ||||||||||
Belenguer et al. (2011) | X | X | X | X | X | X | X | X | X | BIP | X | Branch-and-Cut | No | ||||||||||
Escobar et al. (2013) | X | X | X | X | X | X | X | X | X | ILP | X | two-phase hybrid heuristic | No | ||||||||||
Prins et al. (2006) | X | X | X | X | X | X | X | X | X | BIP | X | Metaheuristic | No | ||||||||||
He et al. (2009) | X | X | X | X | X | X | X | X | X | Not defined | X | hybrid genetic algorithms, artificial neural network and hill climbing heuristic | Yes | ||||||||||
PEFHP | X | X | X | X | X | X | X | X | X | MILP | X | Heuristic | Yes | ||||||||||
Notes: A: deterministic, B: stochastic, C: homogeneous, D: heterogeneous, E: single, F: multiple, G: constant, H: dynamic, I: single, J: multiple, K: single, L: multiple, M: finite, N: infinite, O: constant, P: dynamic, Q: single, R: multiple, S: exact, T: heuristic | |||||||||||||||||||||||
| Demand | Type of fleet | Trip type | Travel times | Type of clients | Number of depots | Depot Capacity | Routes | Visits to Clients | Mathematical Model | Solutions | Solution approach | Case Study | |||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Authors | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | Exact | Heuristic | |||
Bish (2011) | X | X | X | X | X | X | X | X | X | MIP | X | Constructive Heuristic | No | ||||||||||
Gocrigk and Grün 2012 | X | X | X | X | X | X | X | X | X | MIP | X | Tabu search | No | ||||||||||
Perkins | X | X | X | X | X | X | Not defined | X | X | BIP | X | Simulations | Yes | ||||||||||
Margulis | X | X | X | X | X | X | X | X | X | BIP | X | Not defined | Yes | ||||||||||
Goerigk | X | X | X | X | X | X | X | X | X | MILP | X | Branch and Bound | No | ||||||||||
Sayyady and Eksioglu (2010) | X | X | X | X | X | X | X | X | X | MILP | X | Tabu Search | Yes | ||||||||||
Dikas and Minis (2016) | X | X | X | X | X | X | X | X | X | MIP | X | Hybrid Solution Techniques | No | ||||||||||
Zheng (2014) | X | X | X | X | X | X | X | X | X | MIP | X | Lagrangian-relaxation | No | ||||||||||
Goerigk | X | X | X | X | X | X | X | X | X | MILP | X | Branch-and-Price | No | ||||||||||
Bard | X | X | X | X | X | X | X | X | X | MILP | X | Branch-and-Cut | No | ||||||||||
Brandao and Mercer (1998) | X | X | X | X | X | X | Not defined | X | X | Not defined | X | Tabu Search | No | ||||||||||
Petch and Salhi (2003) | X | X | X | X | X | X | X | X | Not defined | X | Constructive heuristic | No | |||||||||||
Salhi and Petch (2007) | X | X | X | X | X | X | Not defined | X | X | Not defined | X | Hybrid Genetic Algorithm | No | ||||||||||
Crevier | X | X | X | X | X | X | X | X | X | MILP | X | Tabu Search | No | ||||||||||
Tarantilis | X | X | X | X | X | X | X | X | X | Not defined | X | VNS, Tabu Search, GLS | No | ||||||||||
Belenguer | X | X | X | X | X | X | X | X | X | BIP | X | Branch-and-Cut | No | ||||||||||
Escobar | X | X | X | X | X | X | X | X | X | ILP | X | two-phase hybrid heuristic | No | ||||||||||
Prins | X | X | X | X | X | X | X | X | X | BIP | X | Metaheuristic | No | ||||||||||
He | X | X | X | X | X | X | X | X | X | Not defined | X | hybrid genetic algorithms, artificial neural network and hill climbing heuristic | Yes | ||||||||||
PEFHP | X | X | X | X | X | X | X | X | X | MILP | X | Heuristic | Yes | ||||||||||
Sharing content requires targeting cookies to be enabled. Please update your cookie preferences to use this feature.