Hub competition and travel times in the world-wide airport network

The aim of this work is to measure the competition between airport hubs based on an analysis of travel times in the world-wide airport network. By considering the minimum travel time required to connect each pair of airports, it is possible to create new measures of hub competition, separating the effects of hub position and temporal coordination. This analysis was carried out at the global level, considering all 232 airports with more than 3 million seats yearly offered in departure flights in 2008, and also in relevant geographic markets. The results show a high level of competition among the most important world airports, but the major airports of Europe have a geographical advantage in relation to world markets over the major American and Asian airports. We also show that airports located in different continents often compete for the same origin–destination markets. Geographical position appears to be the most important variable explaining hub performance. Secondary hubs show a higher degree of specialization towards specific markets.     

Robust hub network design problem

This paper presents a robust formulation for the uncapacitated single and multiple allocation hub location problem where demand is uncertain and its distribution is not fully specified. The proposed robust model is formulated as a mixed integer nonlinear program and then transformed into a mixed integer conic quadratic program. An efficient linear relaxation strategy is proposed which is found to deliver the optimal solutions for all the cases considered in this paper. Numerical experiments suggest location of more number of hubs when accounting for demand uncertainty using robust optimization compared to the deterministic setting.     

Hub location problems in transportation networks

In this paper we propose a 4-index formulation for the uncapacitated multiple allocation hub location problem tailored for urban transport and liner shipping network design. This formulation is very tight and most of the tractable instances for MIP solvers are optimally solvable at the root node. While the existing state-of-the-art MIP solvers fail to solve even small size instances of problem, our accelerated and efficient primal (Benders) decomposition solves larger ones. In addition, a very efficient greedy heuristic, proven to be capable of obtaining high quality solutions, is proposed. We also introduce fixed cost values for Australian Post (AP) dataset.     

Decomposition approach for integrated intermodal logistics network design

The integrated intermodal logistics network design problem consists of determining terminal locations and selecting regular routes and transportation modes for loads. This problem was formulated using a path-based formulation and a decomposition-based search algorithm has been proposed for its solution. Computational results show that this approach is able to obtain optimal solutions for non-trivial problem instances of up to 150 nodes in reasonable computational times. Previous studies have only been able to obtain approximate solutions for network problems of this size. A few general insights about the effects of design parameters on solution characteristics were also obtained.     

Multi-period hub location problems in transportation

Many transport service providers operate on hub-and-spoke network structures. Major operators may have several dedicated hub facilities that are leased for a time horizon rather than being owned or constructed. For a given discrete planning horizon, service providers must decide on the location of the hub ports (i.e. terminals), the period when the lease contract starts, the period when the existing contracts must be terminated and the flow routing over the entire planning horizon so as to minimize the total operational cost. Thus, we propose a mathematical model for a Multi-period Uncapacitated Multiple Allocation Hub Location Problem with Budget Constraint. The proposed model incorporates several features of practice, particularly from maritime and land transport practices. We also propose a meta-heuristic solution algorithm that produces high-quality solutions in a reasonable amount of time. By exploiting the decomposable structure of the model, we extended a Benders decomposition approach by proposing several improvements. Extensive computational experiments confirm the efficiency of the proposed methods and also show its limitations.     

A supply chain network design considering transportation cost discounts

This study addresses an integrated facility location and inventory allocation problem considering transportation cost discounts. Specifically, this article considers two types of transportation discounts simultaneously: quantity discounts for inbound transportation cost and distance discounts for outbound transportation cost. This study uses an approximation procedure to simplify DC distance calculation details, and develops an algorithm to solve the aforementioned supply chain management (SCM) problems using nonlinear optimization techniques. Numerical studies illustrate the solution procedures and the effects of the model parameters on the SCM decisions and total costs. Results of this study serve as a reference for business managers and administrators.     

肯尼亚基苏木铁路枢纽分工布局研究

肯尼亚内马铁路二期引入基苏木后,将与既有米轨铁路共同形成基苏木铁路枢纽,形成基苏木铁路枢纽内各铁路系统功能分工布局。基于基苏木铁路枢纽构成,结合既有米轨铁路现状、城市功能规划及客货运量分析,提出基苏木铁路枢纽客货分设方案和客货合设方案,经比选推荐采用客货分设方案;同时,提出港区支线接入基苏木北站南侧接轨和北侧接轨方案,经比选推荐采用南侧接轨方案。基苏木铁路枢纽分工布局符合基苏木城市功能和规划,有利于形成基苏木地区的综合交通枢纽。     

The congested multicommodity network design problem

This paper studies a version of the fixed-charge multicommodity network design problem where in addition to the traditional costs of flow and design, congestion at nodes is explicitly considered. The problem is initially modeled as a nonlinear integer programming formulation and two solution approaches are proposed: (i) a reformulation of the problem as a mixed integer second order cone program to optimally solve the problem for small to medium scale problem instances, and (ii) an evolutionary algorithm using elements of iterated local search and scatter search to provide upper bounds. Extensive computational results on new benchmark problem instances and on real case data are presented.     

Liner hub-and-spoke shipping network design

This paper proposes a liner hub-and-spoke shipping network design problem by introducing the concept of a main port, as well as some container shipping constraints such as multi-type container shipment and transit time constraints, which are seldom considered in the previous studies. It develops a mixed-integer programming model with nonconvex multi-linear terms for the proposed problem. An efficient genetic algorithm embedded with a multi-stage decomposition approach is developed to solve the model. Numerical experiments are carried out to assess the effectiveness of the proposed model and the efficiency of the proposed algorithm.     

Incorporating spatial equity into interurban road network design

Methods for the road network design problem, typically, are based on optimization of the network efficiency measures (e.g. network-wide travel time) under a predefined budget. In these approaches, equity issues are not taken into account and, consequently, most of the road improvements are planned next to large cities. Thus, disparities between large and small cities increase, which does not conform to sustainable development objectives. In this paper, to overcome concerns associated with traditional methods, equity is incorporated into the interurban road network design problem. To this end, accessibility concepts are employed. However, unlike previous studies, instead of maximizing the total accessibility, a new definition is proposed for inaccessibility, and total inaccessibility is minimized throughout the network. Using this new definition not only is more compatible with the equity issue, but also helps to eliminate the nonlinearity of the problem. Average travel time to neighboring opportunities is utilized to propose this definition for inaccessibility, which captures the reality more effectively. With the aim of this definition, equity is incorporated into the road network design problem implicitly. This is another improvement over previous methods, where a new term in the objective function or a new constraint is added to include the equity. The proposed model is formulated as a mixed integer linear programming (MILP) problem, where the objective is to minimize the aggregate inaccessibility over all the population centers in the network. To illustrate the application of the model, the Northwest region of the United States is used as the case study. The respective exact solution of the example is found using a commercial solver (CPLEX). This new solution is also compared with the solutions from the traditional methods.     

2-Stage stochastic programming approach for hub location problem under uncertainty: A case study of air network of Iran

In this paper 2-stage stochastic programming has been developed for formulating stochastic uncapacitated multiple allocation hub location problem. This problem is studied under three cases. The first, stochastic demand, the second, stochastic transportation cost and the third, integrated stochastic, which is compounded of first and second cases. A case of air network in Iran is used to evaluate proposed formulations and computational results obtained by GAMS are presented. The results show that considering uncertainty into formulation could cause in different solutions.     

Embedding economies of scale concepts for hub network design

We explore the idea of endogenous hub location on a network. In contrast to much of the literature, we propose that hub networks may emerge naturally out of a set of assumptions and conditions borrowed from equilibrium traffic assignment. To this end, we focus on applying a nonlinear cost function that rewards economies of scale on all network links. A model is presented and implemented in a GIS environment using both a 100-node intercity matrix and several synthesized interaction matrices. We compare solutions for different assumptions about network costs, and visualize the results. We find that under discounted conditions, network flow is re-routed to take advantage of the cost savings for amalgamation and that several cities emerge as centers through which large amounts of flow pass. Larger cities such as Los Angeles, New York and Chicago serve gateway functions. We also find that smaller cities such as Oklahoma City, Pittsburgh, Indianapolis, and Knoxville serve major gateway functions because of their locational advantages. Our paper should be of interest to the planner of a surface transportation system, or those interested in nodal concepts such as gateways and transport geography. Results are discussed in light of hub and spoke networks and suggestions are made for future research.     

An economic–geographic assessment of the potential for a new air transport hub in post-Gaddafi Libya

Post-war Libya is faced with the challenge of adopting an air transport strategy for the future. One issue is how to address projects inaugurated under the Gaddafi government, such as the terminal extension at Tripoli International Airport. Additionally, the state-owned Afriqiyah Airlines had been establishing a niche hub in Tripoli before the 2011 war, but this development has subsequently been stalled.Against this background, we analyse the prospects of an air transport hub operation in Libya, focusing on traffic between Africa and Europe, from a bird’s-eye economic–geographic view. First, a literature review is undertaken to identify general success factors for air transport hubs. Second, a weighted average distance penalty (WADP) indicator is developed and applied to Tripoli as a potential hub location. This indicator considers all 4755 O&Ds between Europe and Africa with more than 100 passengers in 2012. For sensitivity reasons, alternative WADPs are estimated for the 3209 traffic flows not including North Africa and for (forecasted) future air traffic demand in 2020. The results for Tripoli International Airport are benchmarked against competing hub locations, such as Algiers, Cairo, and the major European airports. We conclude by discussing the implications of the current and anticipated future security and economic situation in the country.     

Dynamic supply chain network design with capacity planning and multi-period pricing

This paper addresses a new problem in designing and planning a multi-echelon and multi-product supply chain network over a multi-period horizon in which customer zones have price-sensitive demands. Based on price-demand relationships, a generic method is presented to obtain price levels for products and then, a mixed-integer linear programming model is developed. Due to the problem intractability, a simulated annealing algorithm that uses some developed linear relaxation-based heuristics for capacity planning and pricing is presented. Numerical results demonstrate the significance of the model as well as the efficiency of the solution algorithm and linear relaxation-based heuristics.     

Retail supply chain network design under operational and disruption risks

Designing robust and resilient retail networks under operational and disruption risks can create substantial competitive advantage. In this paper, a deterministic multiple set-covering model is first proposed. Then, it is extended to a possibilistic scenario-based robust model by scenario generation and disruption profiling to design a robust and resilient retail network. The developed models are validated through randomly generated examples and a real case study in retailing. Numerical results demonstrate that designing retail chains without considering operational and disruption risks is really misleading. Also, multiple covering of retail stores as the measure of redundancy increases the network’s resilience significantly.     

Mixed fleet dispatching in truckload relay network design optimization

We propose a mathematical formulation for strategic relay network design and dispatching method selection for full truckload transportation. The proposed model minimizes total transportation and installation costs of a mixed fleet dispatching system combining relay network and point-to-point dispatching. Operational constraints such as maximum driver tour length and load circuity are considered within the variable definition using predefined templates to generate feasible routes. High quality solutions for largely-sized problem instances are obtained in reasonable times. Computational results are analyzed to develop insights about the mixed fleet dispatching system and quantify its benefits over relay network-only and point-to-point dispatching.     

综合交通枢纽内换乘班次衔接优化研究

综合交通枢纽内换乘衔接的合理、有效程度是影响整个综合运输体系效率的关键。针对既有研究中对换乘衔接建立模型存在的问题,参照复杂网络理论以结构解释网络功能的思想,建立综合交通枢纽内部的换乘班次衔接网络。以换乘班次衔接网络自身特点为基础,提出反映换乘网络结构的平均路径长度、聚类系数、度3个统计特征,并通过算例对换乘网络整体存在的问题和能力不匹配、时间不接续等实际情况给出解决方案。     

大型铁路客运枢纽设施应急能力匹配度研究

借鉴国内外学者在大型铁路客运枢纽的设施应急能力方面的研究成果,从应急能力与需求匹配度、节点设施匹配度、疏散流线匹配度3个方面,对大型铁路客运枢纽设施应急能力的匹配度进行研究,阐述应急能力与需求匹配度、节点设施匹配度和疏散流线匹配度的概念与测度方法。在此基础上,建立优化模型,在满足疏散流线安全时间的要求下,使大型铁路客运枢纽设施整体协调匹配。     

Measuring the perceived container leasing prices in liner shipping network design with empty container repositioning

This paper aims to measure the perceived container leasing prices at different ports by presenting a two-stage optimization method. In stage I, we propose a practical liner shipping network design problem with empty container repositioning. The proposed problem further considers the use of foldable containers and allows the mutual substitution between empty containers to decrease the number of empty containers to be repositioned. In stage II, the inverse optimization technique is used to determine the perceived container leasing prices at different ports, based on the solution obtained in stage I. Based on a set of candidate liner shipping service routes, a mixed-integer nonlinear programming model is built for the proposed problem in stage I. The nonlinear terms are linearized by introducing the auxiliary variables. Numerical experiments based on a realistic Asia-Europe-Oceania liner shipping network are carried out to account for the effectiveness of our two-stage optimization method.     

A supply chain network design model for biomass co-firing in coal-fired power plants

We propose a framework for designing the supply chain network for biomass co-firing in coal-fired power plants. This framework is inspired by existing practices with products with similar physical characteristics to biomass. We present a hub-and-spoke supply chain network design model for long-haul delivery of biomass. This model is a mixed integer linear program solved using benders decomposition algorithm. Numerical analysis indicates that 100 million tons of biomass are located within 75 miles from a coal plant and could be delivered at $8.53/dry-ton; 60 million tons of biomass are located beyond 75 miles and could be delivered at $36/dry-ton.