CAJ | 학술논문

针对强异类集装箱装载问题,设计了一种混合蚁群算法.算法中搜索空间分为货物摆放的优先序列和货物摆放的状态两部分;引入体积大的货物优先放入的启发式规则;将蚂蚁搜索得到的序列与历史最优序列进行交叉,取三者最优序列作为该蚂蚁的搜索路径;在更新信息素时,采取两种挥发系数更新信息素以避免信息素过快饱和,同时分析了算法的复杂度.通过三个强异类实例的测试,表明算法得到的装载方案有较高的空间利用率.
침대강이류집장상장재문제,설계료일충혼합의군산법.산법중수색공간분위화물파방적우선서렬화화물파방적상태량부분;인입체적대적화물우선방입적계발식규칙;장마의수색득도적서렬여역사최우서렬진행교차,취삼자최우서렬작위해마의적수색로경;재경신신식소시,채취량충휘발계수경신신식소이피면신식소과쾌포화,동시분석료산법적복잡도.통과삼개강이류실례적측시,표명산법득도적장재방안유교고적공간이용솔.
@@@@Aiming at the strongly heterogeneous Container Loading Problem(CLP), a mixed Ant Colony Algorithm(ACO)is designed. The solution of problem is divided in two parts, the priority of the goods and the goods’state. Based on heuristic rules, the larger goods have priority to pack in container, so volume is considered as heuristic information. The sequence that ant has searched crosses with historical optimal sequence. The optimal one among the three sequences is choose as the wanted sequence. In order to avoid pheromone over-rapid saturated, pheromone is updated by adopting two volatile coefficients. The complexity of the algorithm is analyzed. Through testing three examples, the space utilization is high by using this algorithm.