Entropy maximising facility location model for port city intermodal terminals

Collins Teye, Michael G.H. Bell and Michiel Bliemer

Transportation Research Part E: Logistics and Transportation Review, 2017, vol. 100, issue C, 1-16

Abstract: This paper employs the principle of entropy maximisation to solve the multi-user intermodal terminal (IMT) location problem in a context where users have the option not to use an IMT. The proposed model is a non-linear mixed integer programming problem, which decomposes into an IMT location sub-problem and an IMT choice sub-problem linked in one direction by the choice of IMT location(s) and in the other by dual variables relating to cost sensitivity and IMT capacity. The principal features of the model are illustrated by a numerical example based on the state of NSW, Australia, where new IMTs are planned.

Keywords: City logistics; Intermodal terminals; Entropy; Facility location; Lagrangian relaxation (search for similar items in EconPapers)
Date: 2017
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (11)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S1366554516304768
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:transe:v:100:y:2017:i:c:p:1-16

Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/bibliographic
http://www.elsevier. ... 600244/bibliographic

DOI: 10.1016/j.tre.2017.01.006

Access Statistics for this article

Transportation Research Part E: Logistics and Transportation Review is currently edited by W. Talley

More articles in Transportation Research Part E: Logistics and Transportation Review from Elsevier
Bibliographic data for series maintained by Catherine Liu ().