{"title":"Stacker-reclaimer scheduling for raw material yard operation","authors":"Dayong Hu, Z. Yao","doi":"10.1109/IWACI.2010.5585235","DOIUrl":"https://doi.org/10.1109/IWACI.2010.5585235","url":null,"abstract":"Raw material yards at dry bulk terminals act as temporary buffers for inbound and outbound raw materials. Both discharging and charging processes are supported by raw material yards in most cases. Stacker-reclaimers are dedicated equipments in yards for raw material handling. The efficiency of yard operation depends to a great extent on the productivity of stacker-reclaimers. Stacker-reclaimer scheduling problem is discussed in this paper. Given a set of handling operations in a yard, the objective is to find an optimal operation sequence on each stacker-reclaimer so as to minimize the makespan. A mixed integer programming model is formulated. Since the considered problem is NP-hard in nature, a parthenogenetic algorithm is developed to obtain near optimal solutions. Computational experiments are conducted to examine the presented model and the solution algorithm. The computational results show that the proposed parthenogenetic algorithm is effective.","PeriodicalId":196572,"journal":{"name":"International Workshop on Advanced Computational Intelligence","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132117195","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Model of distributed control software based multi-agent system for large-scale laser experiment equipment","authors":"Zhong Tang, Yue Xie, Zhongping Guo","doi":"10.1109/IWACI.2010.5585200","DOIUrl":"https://doi.org/10.1109/IWACI.2010.5585200","url":null,"abstract":"Distributed control system based on the multi-agent system has good extension and opening and reconstruction. For great experiment equipment, a mode of distributed control software system based on the multi-agent system is advanced. The configuration of single agent and collaboration of multi-agent is introduced. Arithmetic of Control flow which is core of control software, is particularly designed.","PeriodicalId":196572,"journal":{"name":"International Workshop on Advanced Computational Intelligence","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116995207","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A parallel Ant Colony Optimization algorithm with GPU-acceleration based on All-In-Roulette selection","authors":"Jie Fu, Lin Lei, Guohua Zhou","doi":"10.1109/IWACI.2010.5585115","DOIUrl":"https://doi.org/10.1109/IWACI.2010.5585115","url":null,"abstract":"Ant Colony Optimization is computationally expensive when it comes to complex problems. The Jacket toolbox allows implementation of MATLAB programs in Graphics Processing Unit (GPU). This paper presents and implements a parallel MAX-MIN Ant System (MMAS) based on a GPU+CPU hardware platform under the MATLAB environment with Jacket toolbox to solve Traveling Salesman Problem (TSP). The key idea is to let all ants share only one pseudorandom number matrix, one pheromone matrix, one taboo matrix, and one probability matrix. We also use a new selection approach based on those matrices, named AIR (All-In-Roulette). The main contribution of this paper is the description of how to design parallel MMAS based on those ideas and the comparison to the relevant sequential version. The computational results show that our parallel algorithm is much more efficient than the sequential version.","PeriodicalId":196572,"journal":{"name":"International Workshop on Advanced Computational Intelligence","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132082029","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}