Treffer: Multi-Objective Metaheuristics for Hub Location Problem: A Case Study of Rail Network Planning.

Purpose: Hub location problems have been utilized in various applications including rail transportation network planning, where hub serves as a key transit point within the network. In this paper, we focus on determining the optimal location for a rail transportation hub, where cost and service are trade-off. Design/methodology/approach: The problem is formulated as a multi-objective programming model with the objectives of minimizing total transportation costs and minimizing maximum travel time. A case study of rail transportation network hub planning in Thailand is presented. Given the complexity and large scale of the real-world case study, we develop and compare the Multi-Objective Tabu Search (MOTS) and Non-Dominated Sorting Genetic Algorithm II (NSGA-II) to solve the problem. Findings: The proposed algorithms yield efficient performance in terms of computational time and solution quality. Performance comparison is further analyzed to see the difference in both algorithms. Originality/value: The results offer valuable managerial insights for decision-makers in rail transportation hub network design. [ABSTRACT FROM AUTHOR]

Copyright of Journal of Industrial Engineering & Management is the property of Omnia Science and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)