Bin-packing multi-depots vehicle scheduling problem and its ant colony optimization

  • Authors:

  • Suxin Wang;Leizhen Wang;Yanying Niu;Meng Ge

  • Affiliations:

  • Northeastern University at Qinhuangdao, Qinhuangdao, Hebei, China;Northeastern University at Qinhuangdao, Qinhuangdao, Hebei, China and College of Information Science and Engineering, Northeastern University, Shenyang, China;Yanshan University, Qinhuangdao, Hebei, China;Northeastern University at Qinhuangdao, Qinhuangdao, Hebei, China

  • Venue:
  • CCDC'09 Proceedings of the 21st annual international conference on Chinese control and decision conference
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

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 matrix's 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.