Formulation and solution of a multi-commodity, multi-modal network flow model for disaster relief operations

Haghani, Ali; Oh, Sei-Chang

doi:10.1016/0965-8564(95)00020-8

Cited by 281 publications

(182 citation statements)

References 10 publications

Supporting

Mentioning

166

Contrasting

Unclassified

Order By: Relevance

“…Several authors have modeled the problem of transporting vital first-aid commodities and emergency personnel to disaster-affected areas. Haghani and Oh (1996) used a deterministic multicommodity, multimodal network flow model to plan disaster relief. Barbarosoglu and Arda (2004) extended this approach to include random arc capacity, supply, and demand.…”

Section: Disaster Planning and Responsementioning

confidence: 99%

A Survey of Operations Research Models and Applications in Homeland Security

2006

View full text Add to dashboard Cite

Operations research has had a long and distinguished history of work in emergency preparedness and response, airline security, transportation of hazardous materials, and threat and vulnerability analysis. Since the attacks of September 11, 2001 and the formation of the US Department of Homeland Security, these topics have been gathered under the broad umbrella of homeland security. In addition, other areas of OR applications in homeland security are evolving, such as border and port security, cyber security, and critical infrastructure protection. The opportunities for operations researchers to contribute to homeland security remain numerous.

show abstract

Section: Disaster Planning and Responsementioning

confidence: 99%

A Survey of Operations Research Models and Applications in Homeland Security

2006

View full text Add to dashboard Cite

show abstract

“…Numerous papers have been published to address Vehicle Routing Problems (VRP) (Carić and Gold 2008), AGVs fleet assignment (Abara 1989;Hall et al 2001), integrated machine scheduling and vehicle routing with time windows (Ullrich 2013) as well as multimodal network flow models (Haghani and Oh 1996). Because of the NP-hard nature of these problems, the proposed solution methods range from dynamic programming (Maneengam et al 2012;Azi et al 2012), through constraint programming (Kao and Chen 2013;Kilby and Urli 2016) to metaheuristic-driven evolutionary programming (Ullrich 2013;Reed et al 2014).…”

Section: Literature Reviewmentioning

confidence: 99%

Multimodal processes prototyping subject to grid-like network and fuzzy operation time constraints

2017

View full text Add to dashboard Cite

This paper describes a Grid-like Material Transportation Network (GMTN) in which several heterogeneous means of transportation (Automated Guided Vehicles (AGVs), hoists, lifts, etc.) interact with each other via common shared workstations to provide a variety of demand-responsive material handling operations. Different material handling transport modes provide movement of workpieces between workstations along their manufacturing routes in the GMTN and they can be seen as processes realized with synergic utilization of various local periodically acting unimodal processes. The main contribution of this research is the solution of a constraint satisfaction problem addressing AGVs fleet match-up scheduling subject to GMTN and fuzzy operation time constraints. In the presented case both production rate (production takt) and operations execution time are described by imprecise (fuzzy) data. In other words, the research's objective concerns assessing grid-like networks of periodically acting local transportation modes from the perspective of possible mass-customized oriented requirements imposed on scheduling of multimodal flows of jobs assigned to certain technological routes passing through common shared workstations.

show abstract

“…One group of these studies, such as Barbasuglu [18,19] and Haghani and OH [20,21], concentrated on a routing problem and distribution of emergency goods. These studies were to minimize time and cost of transportation and assumed that several relief goods from several depot were shipped by heterogeneous vehicles to the a ected areas.…”

Section: Related Workmentioning

confidence: 99%

“…Constraints (16) and (17) are the capacity limitations of trucks and helicopters. The part considered as sub-tour constraint is represented in Constraints (18) to (23), among which Constraints (18) and (19) are the sub-tour elimination constraints for trucks and helicopters, Constraints (20) and (21) are the sub-tour elimination constraints for axillary variables, U vi and U vf(v;i) , for trucks, and Constraints (22) and (23) (26) where x is the decision variables vector, f 1 (x); :::; f p (x) are the p objective functions, and s is the feasible area. In this method, we optimize one of the objective functions and put the other objective functions in constraints (Eq.…”

Section: Notations and Sets Vmentioning

confidence: 99%

A cluster-based emergency vehicle routing problem in disaster with reliability

et al. 2017

View full text Add to dashboard Cite

Abstract. In the event of natural disasters, relief distribution is the most challenging problem in emergency transportation. What is important in response to disaster is victims' relief in disaster areas with the quick distribution of vital commodity. In this regard, damage to infrastructure (e.g., roads) can make trouble in designing a distribution network. Therefore, this paper considers a problem using a three-stage approach. In the rst stage, pre-processing of model inputs is done through an Arti cial Neural Fuzzy Inference System (ANFIS) followed by investigating the safest route for each cluster using decision-making techniques and graph theory. In the second stage, a heterogeneous multi-depot multimode vehicle routing problem is formulated for minimizing the transportation time and maximizing the reliability. Finally, since the routing problem is NP-hard, 2 multi-objective meta-heuristic algorithms, namely, Non-dominated Sorting Genetic Algorithm (NSGA-II) and Multi-Objective Fire y Algorithm (MOFA), are proposed to obtain the optimal solution and their performances are compared through a set of randomly generated test problems. The results show that for this routing problem, the MOFF gives better solutions than NSGA-II does, and it performs well in terms of accuracy and solution time.

show abstract

Formulation and solution of a multi-commodity, multi-modal network flow model for disaster relief operations

Cited by 281 publications

References 10 publications

A Survey of Operations Research Models and Applications in Homeland Security

A Survey of Operations Research Models and Applications in Homeland Security

Multimodal processes prototyping subject to grid-like network and fuzzy operation time constraints

A cluster-based emergency vehicle routing problem in disaster with reliability

Contact Info

Product

Resources

About