Bin-Packing Multi-Depots Vehicle Scheduling Problem and its Ant Colony Optimization

摘要：

In order to solve bin-packing multi-depots vehicle scheduling problem (BPMDVSP), BPMDVSP model bases on goods is established. A tabu matrix bases on goods is established for ant colony optimization (ACO). Matrix has three rows, first row corresponds to goods start depot visit state, second row corresponds to goods end depot visit state, and third row corresponds to vehicle that ferries the goods. Tabu matrixs every column corresponds to goods, if goods qualities overload vehicle capacity, the goods column changes to goods bale numbers columns, and every column corresponds to a bale. The depot visit states in tabu matrix are set to avoid goods consignment mistake and single goods is ferried by different vehicles. State transfer rules are set when the two adjacent nodes are the same. According to ants tabu matrix, all the vehicle routs are searched by ants and satisfy the vehicle constrain. The illustration result shows model and algorithm can solve vehicle scheduling problem regardless goods whether in vehicle capacity.

关键词： Multi-Depots Bin-Packing Problem Vehicle Scheduling Problem Ant Colony Optimization

作者: Suxin Wang Leizhen Wang Yanying Niu Meng Ge

作者单位: Northeastern University at Qinhuangdao, Qinhuangdao Hebei 066004, China Northeastern University at Qinhuangdao, Qinhuangdao Hebei 066004, China College of Information Scien Yanshan University, Qinhuangdao Hebei 066004, China

会议类型: 国际会议

会议名称: 2009年中国控制与决策会议(2009 Chinese Control and Decision Conference)

会议地点: 广西桂林

会议语种:英文

页码: 3722-3725

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