Paper Info
Title
Integrated Hub Location And Flow Processing Schedule Problem Under Renewable Capacity Constraint
Abstract
Transport and logistics networks are more complex than ever before. Complex networks and limitation of available capacities make flow processing schedule (FPS) a challenging problem to ensure customer satisfaction and profitability. This paper addresses an integrated hub location and flow processing schedule problem (HLFPSP) to determine hub locations, the allocated traffic flows and the optimal FPS at hubs under capacity constraints. Specifically, in an air transport network, the optimal FPS leads to optimal flight scheduling. The problem is formulated as a mixed-integer linear programming (MILP) model to minimize total tardiness costs (at operational level) and hub construction costs (at strategic level), simultaneously. The developed model is utilized to solve small-size hub location-scheduling problems. To provide a good solution in a reasonable time, the Lagrangian relaxation algorithm is employed. Based on the data from 80 airports in Turkey, the application of problem in real world is showed and the efficiency of the proposed solution methods is evaluated. Finally, a number of sensitivity analyses and managerial insights are provided to enrich the computational results.
Year
DOI
Venue
2021
10.1007/s40314-021-01548-w
COMPUTATIONAL & APPLIED MATHEMATICS
Keywords
DocType
Volume
Hub location, Flow processing schedule, Total tardiness, Mixed-integer linear programming, Lagrangian relaxation algorithm, Heuristic algorithm
Journal
40
Issue
ISSN
Citations 
5
2238-3603
0
PageRank 
References 
Authors
0.34
0
2
Name
Order
Citations
PageRank
Mohammad Rostami100.34
Armin Jabbarzadeh200.34