Intermodal Green p-Hub Median Problem with Incomplete Hub-Network

Abstract

In the literature, hub-networks have often been modeled such as only one mode is considered for all transportation. Also, the consolidated demand flows are assumed to be transferred directly between each origin-destination hub pairs. The previous assumptions impose restrictions on the practical applications of such hub-networks. In fact, various transport modes are usually retained for freight transport, and intermodal terminals (e.g., rail terminals) may not realistically be fully connected. Thus, to assist decision makers, we investigate if the appropriate use of more eco-friendly transportation modes in incomplete networks may contribute to the accomplishment of the significant global reduction goals in carbon emissions. In this paper, we study the intermodal green p-hub median problem with incomplete hub-network. For each p located hub nodes, the hub-network is connected by at most q hub-links. The objective is to minimize the total transportation-based CO2 emission costs incurred through the road- and rail-transportation of each o-d demand flows. We present a MILP formulation for the studied problem and propose a novel genetic algorithm to solve it. A penalty cost is considered on solutions where train capacity is exceeded. Additionally, we present a best-path construction heuristic to generate the initial population. Furthermore, we develop a demand flows routing heuristic to efficiently determine the partition of demand flows in the incomplete road-rail network. And we implement novel crossover and mutation operators to produce new off-springs. Extensive computational experiments show that the proposed solution approach outperforms the exact solver CPLEX. Also, we perform a comparison between the unimodal and intermodal cases, and offer a discussion on the tuning of freight trains.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 13 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.