This study aims at developing a stochastic hierarchical multimodal hub location modeling framework for cargo delivery systems to capture uncertainty in hub construction cost and travel time at the strategic level. From a ring-star-star type network design perspective, a stochastic model is established to formulate this problem formally via the expected value and chance-constrained programming techniques. In particular, three types of chance constraints are proposed to ensure that the on-time delivery with pre-specified confidence levels in their respective layer networks. For normal distributions, the original stochastic model can be reformulated as a crisp equivalent mixed-integer linear programming (MILP) model by invoking the central limit theorem. Since the number of constraints and variables increases drastically with the size of cargo delivery distribution network, a memetic algorithm (MA) is designed. This algorithm incorporates genetic search and local intensification to obtain optimal/near-optimal solutions for realistic instance size within a reasonable time limit. For general distributions, it is difficult to convert the stochastic model into its deterministic counterpart. Hence, a hybrid methodology is further designed by combining the MA and Monte Carlo (MC) simulation to solve the proposed stochastic model. To demonstrate the properties of the proposed model and the performance of the designed algorithm, a series of numerical experiments are set up based on the Civil Aeronautics Board (CAB) and Turkish network data sets. Computational results indicate as the confidence level increases, the airport hubs are located further apart in the cargo delivery distribution network for gaining a greater time advantage. In addition, comparative results demonstrate that the MA algorithm proposed herein performs better than the genetic algorithm (GA) in terms of computing speed and quality of the solution.

Purpose: This paper studies the location-inventory problem (LIP) in pallet pooling systems to improve resource utilization and save logistics costs, which is a new extension of the classical LIP and also an application of the LIP in pallet pooling systems. Design/methodology/approach: A mixed-integer linear programming is established, considering the location problem of pallet pooling centers (PPCs) with multi-level capacity, multi-period inventory management and bi-directional logistics. Owing to the computational complexity of the problem, a hybrid genetic algorithm (GA) is then proposed, where three local searching strategies are designed to improve the problem-solving efficiency. Lastly, numerical experiments are carried out to validate the feasibility of the established model and the efficiency of the proposed algorithm. Findings: The results of numerical experiments show that (1) the proposed model can obtain the integrated optimal solution of the location problem and inventory management, which is better than the two-stage model and the model with single-level capacity; (2) the total cost and network structure are sensitive to the number of PPCs, the unit inventory cost, the proportion of repairable pallets and the fixed transportation cost and (3) the proposed hybrid GA shows good performance in terms of solution quality and computational time. Originality/value: The established model extends the classical LIP by considering more practical factors, and the proposed algorithm provides support for solving large-scale problems. In addition, this study can also offer valuable decision support for managers in pallet pooling systems.

The integration of passenger and freight transport by urban–rural buses is an effective approach to address two critical issues: the inefficiency of parcel delivery services and the financial struggles of public transport operators. This paper studies the county–township–village station location-routing problem for the integration of passenger and freight transport by urban–rural buses, aiming to develop an efficient transport network by establishing rational stations and designing optimal operation routes. A three-level county–township–village station network is proposed for the integration of passenger and freight transport, and a mixed-integer linear programming model is developed, including the constraints of location, allocation, capacity, and routing. A comprehensive series of numerical experiments is conducted on a randomly generated dataset to evaluate the feasibility and advantages of the proposed model. Lastly, key managerial insights are discussed.

The intermodal express network of high-speed railways and highways can fully utilize the flexibility of highways and the advantages of high-speed railways, such as low cost, high efficiency, and low carbon emission. This paper studies the hub location and flow assignment problem in the intermodal express network of high-speed railways and highways, which can not only increase the transportation efficiency but also provide door-to-door service. Considering the characteristics of multiple modes, flow balance, carbon emission, capacity constraints, and time constraints in the intermodal express network, a mixed-integer linear programming model is proposed with the objective of minimizing the total cost by determining the hub locations, allocations, mode selections, and flow assignments. Owing to the NP-hard computational complexity, an improved genetic algorithm with local search is designed by combining the genetic operators and two optimization strategies to solve the problem effectively. Lastly, numerical experiments are conducted to validate the feasibility of the model and the effectiveness of the algorithm.