Using heuristic MCMC method for terminal location planning in intermodal transportation Online publication date: Fri, 27-Jul-2018
by Xiaobin Wu; Lei Cao
International Journal of Operational Research (IJOR), Vol. 32, No. 4, 2018
Abstract: In this paper, we consider the planning of terminal locations for intermodal transportation systems. With a given number of potential locations, we aim to find the most appropriate number of those as terminals to provide the economically most efficient operation when multiple service pairs are needed simultaneously. The problem also has an inherent task to determine the optimal route paths for each service pair. For this NP-hard problem, we present a Markov chain Monte Carlo (MCMC)-based two-layer method to find a suboptimal solution. In the lower layer, the routing for all service pairs given a particular location planning is solved through a table-based heuristic method that considers both efficiency and fairness. In the upper layer, by mapping the cost function into a stationary distribution, the optimal planning is solved based on a MCMC method that integrates advantages of both simulated annealing and slice sampling. Finally, the effectiveness of this heuristic MCMC-based method is demonstrated through computer experiments.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Operational Research (IJOR):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook