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

Mathematical Problems in Engineering - Tập 2015 - Trang 1-13 - 2015
Yan Xu1, Chengxuan Cao1, Bin Jia1, Guangzhi Zang1
1State Key Laboratory of Rail Traffic Control and Safety, Beijing Jiaotong University, Beijing 100044, China

Tóm tắt

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.

Từ khóa


Tài liệu tham khảo

10.1016/j.ejor.2013.06.055

10.1007/0-306-48058-1_13

2006, Transportation, 14, 467

10.1287/trsc.34.3.256.12297

10.1287/trsc.32.4.370

10.1002/nav.20254

10.1016/j.trb.2011.04.002

10.1016/j.sbspro.2014.01.141

10.1016/j.ejor.2011.08.023

10.1080/0305215x.2011.632006

10.1007/s10479-013-1312-9

2011

1979

1975

10.1016/j.asoc.2009.12.039

10.1016/j.asoc.2011.01.042

10.1016/j.amc.2009.02.044

10.1126/science.220.4598.671

10.1016/0305-0483(94)90006-x

2011, Microelectronics & Computer, 2

10.1016/j.asoc.2011.02.032

10.1016/j.omega.2007.12.001

10.1016/j.cor.2010.10.022

10.1002/9780470172261

Thông tin
Thông tin xuất bản

Mathematical Problems in Engineering

Tập 2015

1-13

Thông tin tác giả