CAJ | 학술논문

针对订单接收的流水车间调度问题,提出了一种并行变邻域搜索算法( PVNS),该算法采用双串表示方法、新型的邻域结构和并行搜索机制。通过大量的实例将PVNS与遗传算法和蜂群算法进行了比较,实验结果表明,PVNS对所研究的问题具有良好的优化能力和优化效果。
침대정단접수적류수차간조도문제,제출료일충병행변린역수색산법( PVNS),해산법채용쌍천표시방법、신형적린역결구화병행수색궤제。통과대량적실례장PVNS여유전산법화봉군산법진행료비교,실험결과표명,PVNS대소연구적문제구유량호적우화능력화우화효과。
A parallel variable neighborhood search ( PVNS) algorithm was proposed for the flow shop scheduling problem with order acceptance. In PVNS, two string representations, new types of neighborhood structures and special parallel searching mechanism were used. The PVNS was compared with the genetic algorithm and the artificial bee colony algorithm. The experi-mental results show that the PVNS algorithm has good optimization ability and results.