To meet the multi-cooperation production demand of enterprises,the distributed permutation flow shop scheduling problem(DPFSP)has become the frontier research in the field of manufacturing systems.In this paper,we inv...To meet the multi-cooperation production demand of enterprises,the distributed permutation flow shop scheduling problem(DPFSP)has become the frontier research in the field of manufacturing systems.In this paper,we investigate the DPFSP by minimizing a makespan criterion under the constraint of sequence-dependent setup times.To solve DPFSPs,significant developments of some metaheuristic algorithms are necessary.In this context,a simple and effective improved iterated greedy(NIG)algorithm is proposed to minimize makespan in DPFSPs.According to the features of DPFSPs,a two-stage local search based on single job swapping and job block swapping within the key factory is designed in the proposed algorithm.We compare the proposed algorithm with state-of-the-art algorithms,including the iterative greedy algorithm(2019),iterative greedy proposed by Ruiz and Pan(2019),discrete differential evolution algorithm(2018),discrete artificial bee colony(2018),and artificial chemical reaction optimization(2017).Simulation results show that NIG outperforms the compared algorithms.展开更多
为了更好地解决分布式遥感数据检索的问题,提出了基于REST Web Services的分布式检索实现方法。根据分布式数据检索的需求和遥感数据检索系统的特点,研究了分布式数据检索的实现技术、REST的基本概念、目标与设计原则、主要思想以及实...为了更好地解决分布式遥感数据检索的问题,提出了基于REST Web Services的分布式检索实现方法。根据分布式数据检索的需求和遥感数据检索系统的特点,研究了分布式数据检索的实现技术、REST的基本概念、目标与设计原则、主要思想以及实现方式,在此基本上设计了基于REST Web Services分布式遥感数据检索原型系统,并实现了基于REST Web Services分布式遥感数据检索原型系统。展开更多
On one hand, compared with traditional rela- tional and XML models, graphs have more expressive power and are widely used today. On the other hand, various ap- plications of social computing trigger the pressing need ...On one hand, compared with traditional rela- tional and XML models, graphs have more expressive power and are widely used today. On the other hand, various ap- plications of social computing trigger the pressing need of a new search paradigm. In this article, we argue that big graph search is the one filling this gap. We first introduce the ap- plication of graph search in various scenarios. We then for- malize the graph search problem, and give an analysis of graph search from an evolutionary point of view, followed by the evidences from both the industry and academia. After that, we analyze the difficulties and challenges of big graph search. Finally, we present three classes of techniques to- wards big graph search： query techniques, data techniques and distributed computing techniques.展开更多
Collaborative coverage for target search using a group of unmanned aerial vehicles(UAVs)has received increasing attention in recent years.However,the design of distributed control strategy and coordination mechanisms ...Collaborative coverage for target search using a group of unmanned aerial vehicles(UAVs)has received increasing attention in recent years.However,the design of distributed control strategy and coordination mechanisms remains a challenge.This paper presents a distributed and online heuristic strategy to solve the problem of multi-UAV collaborative coverage.As a basis,each UAV maintains a probability grid map in the form of a locally stored matrix,without shared memory.Then we design two evaluation functions and related technical strategies to enable UAVs to make state transfer or area transfer decisions in an online self-organizing way.The simulation results show that the algorithm integrates geometric features such as parallel search and internal spiral search,and is not interfered by factors such as sudden failure of UAVs,changes in detection range,and target movement.Compared with other commonly used methods for target search,our strategy has high search e±ciency,good robustness,and fault tolerance.展开更多
基金This work was jointly supported by the National Natural Science Foundation of China(Nos.61803192,61973203,61966012,61773192,61603169,61773246,and 71533001)Thanks for the support of Shandong province colleges and universities youth innovation talent introduction and education program.
文摘To meet the multi-cooperation production demand of enterprises,the distributed permutation flow shop scheduling problem(DPFSP)has become the frontier research in the field of manufacturing systems.In this paper,we investigate the DPFSP by minimizing a makespan criterion under the constraint of sequence-dependent setup times.To solve DPFSPs,significant developments of some metaheuristic algorithms are necessary.In this context,a simple and effective improved iterated greedy(NIG)algorithm is proposed to minimize makespan in DPFSPs.According to the features of DPFSPs,a two-stage local search based on single job swapping and job block swapping within the key factory is designed in the proposed algorithm.We compare the proposed algorithm with state-of-the-art algorithms,including the iterative greedy algorithm(2019),iterative greedy proposed by Ruiz and Pan(2019),discrete differential evolution algorithm(2018),discrete artificial bee colony(2018),and artificial chemical reaction optimization(2017).Simulation results show that NIG outperforms the compared algorithms.
文摘为了更好地解决分布式遥感数据检索的问题,提出了基于REST Web Services的分布式检索实现方法。根据分布式数据检索的需求和遥感数据检索系统的特点,研究了分布式数据检索的实现技术、REST的基本概念、目标与设计原则、主要思想以及实现方式,在此基本上设计了基于REST Web Services分布式遥感数据检索原型系统,并实现了基于REST Web Services分布式遥感数据检索原型系统。
基金This work was supported in part by 973 program （2014CB340300）, National Natural Science Foundation of China （Grant No. 61322207） and the Fundamental Research Funds for the Central Universi- ties.
文摘On one hand, compared with traditional rela- tional and XML models, graphs have more expressive power and are widely used today. On the other hand, various ap- plications of social computing trigger the pressing need of a new search paradigm. In this article, we argue that big graph search is the one filling this gap. We first introduce the ap- plication of graph search in various scenarios. We then for- malize the graph search problem, and give an analysis of graph search from an evolutionary point of view, followed by the evidences from both the industry and academia. After that, we analyze the difficulties and challenges of big graph search. Finally, we present three classes of techniques to- wards big graph search： query techniques, data techniques and distributed computing techniques.
基金This study was supported by the Science and Technology Innovation Foundation of China(Grant No.18-163-11).
文摘Collaborative coverage for target search using a group of unmanned aerial vehicles(UAVs)has received increasing attention in recent years.However,the design of distributed control strategy and coordination mechanisms remains a challenge.This paper presents a distributed and online heuristic strategy to solve the problem of multi-UAV collaborative coverage.As a basis,each UAV maintains a probability grid map in the form of a locally stored matrix,without shared memory.Then we design two evaluation functions and related technical strategies to enable UAVs to make state transfer or area transfer decisions in an online self-organizing way.The simulation results show that the algorithm integrates geometric features such as parallel search and internal spiral search,and is not interfered by factors such as sudden failure of UAVs,changes in detection range,and target movement.Compared with other commonly used methods for target search,our strategy has high search e±ciency,good robustness,and fault tolerance.
