A decomposition-based heuristic for a multicrew coordinated road restoration problem

Modeling Multi-Objective Optimization with Updating Information on Humanitarian Response to Flood Disasters

“…An efficient task does depend on the coordination between emergency evacuation and reliefs allocation, but addressing the multi-stage stochastic programming model with updating information in parallel gives a challenge in comparison to the single-objective case. Several studies in recent years have focused on the model and algorithm to improve the capability of humanitarian service after disruptive events, such as the heuristic algorithm [36,37], the random search algorithm [38] or other approaches [39]. Nevertheless, these methodologies are less used in a multi-objective collaborative model with the updated flood information.…”

A Greedy Randomized Adaptive Search Procedure (GRASP) for the multi-vehicle prize collecting arc routing for connectivity problem

“…Akbari & Salman (2017b) study the case of multiple crews and multiple start points and name the problem as K-ARCP, where K stands for multiple teams. Akbari et al (2021a) analyze K-ARCP further and suggest an alternative solution method called Mixed Integer Programming based heuristic with Rich Local Search (MIP-RLS). According to Akbari et al (2021a), the MIP-RLS has a better performance than the matheuristic proposed by Akbari & Salman (2017b).…”

“…Akbari et al (2021a) analyze K-ARCP further and suggest an alternative solution method called Mixed Integer Programming based heuristic with Rich Local Search (MIP-RLS). According to Akbari et al (2021a), the MIP-RLS has a better performance than the matheuristic proposed by Akbari & Salman (2017b). In the MIP-RLS, an initial solution is generated by pre-processing the problem and solving a binary program.…”

Routing multiple work teams to minimize latency in post-disaster road network restoration

“…The authors developed a matheuristic approach to solve larger instances, which is based on the relaxation of their mathematical model, followed by a procedure to restore feasibility along with local search as the final step. In another study, Akbari et al (2021a) developed a decomposition-based heuristic algorithm and successfully applied it to solve larger instances of this problem with multiple work teams. For the generalization of the second problem with multiple work teams that was defined in Kasaei and Salman (2016), Akbari and Salman (2017a) formulated a mathematical model and derived an efficient heuristic based on Lagrangian relaxation.…”