Transshipment Problem with Penalty in Crossdocking Distribution Networks

摘要：

In this paper we study a new type of transshipment problem, the flows through the crossdock are constrained by fixed transportation schedules and any cargos delayed at the last moment of the time horizon of the problem will incur relative high inventory penalty cost. The problem is known to be NP-complete in the strong sense. We therefore focus on developing efficient heuristics. Based on the problem structure, we propose a Genetic Algorithm to solve the problem efficiently. Computational experiments under different scenarios show that GA outperforms CPLEX solver.

关键词： genetic algorithm transshipment scheduling supply chain

作者: Zhaowei Miao Feng Yang Ke Fu

作者单位: School of Management,Xiamen University,Fujian,China Lingnan College,Sun Yat-sen University,No.135,West Xingang Road,Guangzhou 510275,China

会议类型: 国际会议

会议名称: 2009 6th International Conference on Service Systems and Service Management( 2009 第六届服务系统与服务管理国际会议)

会议地点: 厦门

会议语种:英文

页码: 280-285

在线出版日期: 2009-06-08（万方平台首次上网日期，不代表论文的发表时间）