A bi-objective, reliable single allocation p-hub maximal covering location problem: Mathematical formulation and solution approach. (May 2018)
- Record Type:
- Journal Article
- Title:
- A bi-objective, reliable single allocation p-hub maximal covering location problem: Mathematical formulation and solution approach. (May 2018)
- Main Title:
- A bi-objective, reliable single allocation p-hub maximal covering location problem: Mathematical formulation and solution approach
- Authors:
- Madani, Seyed Reza
Shahandeh Nookabadi, Ali
Hejazi, Seyed Reza - Abstract:
- Abstract: In the last few years, the p -hub maximal covering problem (pHMCP) has been applied in a variety of applications, including the design of air transportation networks, distribution systems for perishable products, postal delivery networks, and tourism routing. In hub-based systems, disruptions at hubs or unavailability of routes significantly affect service level and result in excessive costs. To tackle these problems, selecting backup hubs for unavailable hubs and rerouting the related flows are often proposed. This paper develops a bi-objective reliable single allocation p -hub maximal covering problem (BRSApHMCP) considering two objectives: maximizing expected covered flows and minimizing congestion. After formulating an initial non-linear model, a linear model is presented; the NP-Completeness of the developed model is proved and a non-dominated sorting genetic algorithm (NSGA-II) is proposed to solve it. In order to show the superior performance of the proposed NSGA-II, a well-known evolutionary algorithm, the multi-objective particle swarm optimization (MOPSO), and the epsilon constraint methods are utilized and the results are analyzed and compared. The parameters of the proposed algorithms are calibrated using the Taguchi approach. Also, a case study and some parametric analyses are done. The results show that NSGA-II is able to find the better solutions in comparison with MOPSO and by opting this proactive strategy in the investigated case study, NSGA-IIAbstract: In the last few years, the p -hub maximal covering problem (pHMCP) has been applied in a variety of applications, including the design of air transportation networks, distribution systems for perishable products, postal delivery networks, and tourism routing. In hub-based systems, disruptions at hubs or unavailability of routes significantly affect service level and result in excessive costs. To tackle these problems, selecting backup hubs for unavailable hubs and rerouting the related flows are often proposed. This paper develops a bi-objective reliable single allocation p -hub maximal covering problem (BRSApHMCP) considering two objectives: maximizing expected covered flows and minimizing congestion. After formulating an initial non-linear model, a linear model is presented; the NP-Completeness of the developed model is proved and a non-dominated sorting genetic algorithm (NSGA-II) is proposed to solve it. In order to show the superior performance of the proposed NSGA-II, a well-known evolutionary algorithm, the multi-objective particle swarm optimization (MOPSO), and the epsilon constraint methods are utilized and the results are analyzed and compared. The parameters of the proposed algorithms are calibrated using the Taguchi approach. Also, a case study and some parametric analyses are done. The results show that NSGA-II is able to find the better solutions in comparison with MOPSO and by opting this proactive strategy in the investigated case study, NSGA-II could recover up to 73% of lost flow in a well-balanced system. Highlights: The pHMCP is extended to the context of disaster situation. A proactive strategy is selected that each hub must have a backup hub. NSGA-II can find better solution in comparison with MOPSO. In an example instance of problem, opting the proposed strategy led to recover 73% of lost flow. Considering congestion avoiding objective function led to establish the balanced system (illustrated in a case study). … (more)
- Is Part Of:
- Journal of air transport management. Volume 68(2018)
- Journal:
- Journal of air transport management
- Issue:
- Volume 68(2018)
- Issue Display:
- Volume 68, Issue 2018 (2018)
- Year:
- 2018
- Volume:
- 68
- Issue:
- 2018
- Issue Sort Value:
- 2018-0068-2018-0000
- Page Start:
- 118
- Page End:
- 136
- Publication Date:
- 2018-05
- Subjects:
- Reliable hub location -- Hub maximal covering -- Congestion -- Air transport management -- NSGA-II -- Hub and route unavailability
Airlines -- Management -- Periodicals
Aeronautics, Commercial -- Management -- Periodicals
387.7068 - Journal URLs:
- http://www.sciencedirect.com/science/journal/09696997 ↗
http://www.elsevier.com/journals ↗ - DOI:
- 10.1016/j.jairtraman.2017.09.001 ↗
- Languages:
- English
- ISSNs:
- 0969-6997
- Deposit Type:
- Legaldeposit
- View Content:
- Available online (eLD content is only available in our Reading Rooms) ↗
- Physical Locations:
- British Library DSC - 4926.550000
British Library DSC - BLDSS-3PM
British Library HMNTS - ELD Digital store - Ingest File:
- 12294.xml