Model and Algorithm for Container Allocation Problem with Random Freight Demands in Synchromodal Transportation

Yan Xu, Chengxuan Cao, Bin Jia and Guangzhi Zang

Mathematical Problems in Engineering, 2015, vol. 2015, 1-13

Abstract:

This paper aims to investigate container allocation problem with random freight demands in synchromodal transportation network from container carriers’ perspective. Firstly, the problem is formulated as a stochastic integer programming model where the overall objective is to determine a container capacity allocation plan at operational level, so that the expected total transportation profit is maximized. Furthermore, by integrating simulated annealing with genetic algorithm, a problem-oriented hybrid algorithm with a novel gene encode method is designed to solve the optimization model. Some numerical experiments are carried out to demonstrate the effectiveness and efficiency of the proposed model and algorithm.

Date: 2015
References: Add references at CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2015/986152.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2015/986152.xml (text/xml)

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:hin:jnlmpe:986152

DOI: 10.1155/2015/986152

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().