Proceedings of the 2021 5th International Conference on Intelligent Systems, Metaheuristics & Swarm Intelligence最新文献_第2页

A new efficient tour construction heuristic for the Traveling Salesman Problem 一种新的高效的旅行商问题的构造启发式方法

Proceedings of the 2021 5th International Conference on Intelligent Systems, Metaheuristics & Swarm Intelligence Pub Date : 2021-04-10 DOI: 10.1145/3461598.3461610

A. J. Ibada, Boldizsar Tuu-Szabo, L. Kóczy

引用次数: 2

Multiobjective Optimization of the Train Staff Planning Problem Using NSGA-II 基于NSGA-II的列车人员规划问题多目标优化

Proceedings of the 2021 5th International Conference on Intelligent Systems, Metaheuristics & Swarm Intelligence Pub Date : 2021-04-10 DOI: 10.1145/3461598.3461604

Simon Girardin, Fabian Baumann, Rolf Dornberger, T. Hanne

引用次数: 0

Biased random-key genetic algorithms using path-relinking as a progressive crossover strategy 使用路径链接作为渐进交叉策略的有偏随机密钥遗传算法

Proceedings of the 2021 5th International Conference on Intelligent Systems, Metaheuristics & Swarm Intelligence Pub Date : 2021-04-10 DOI: 10.1145/3461598.3461603

C. Ribeiro, José A. Riveaux, J. Brandão

{"title":"Biased random-key genetic algorithms using path-relinking as a progressive crossover strategy","authors":"C. Ribeiro, José A. Riveaux, J. Brandão","doi":"10.1145/3461598.3461603","DOIUrl":"https://doi.org/10.1145/3461598.3461603","url":null,"abstract":"In a biased random-key genetic algorithm, a deterministic decoder algorithm takes a solution represented by a vector of real numbers (random-keys) and builds a feasible solution for the problem at hand. Selection is said to be biased not only because one parent is always a high-quality solution, but also because it has a higher probability of passing its characteristics to its offspring. Path-relinking is a search intensification strategy to explore trajectories connecting high-quality solutions. In this work, we show how path-relinking can be applied in the space of the random-keys and successfully explored as a progressive crossover strategy in biased random-key genetic algorithms. The efficiency of the newly proposed improved crossover strategies, combining multiple crossover operators with the progressive crossover strategy by path-relinking, is illustrated by applications on two problems: the single-round divisible load scheduling problem and the multi-round divisible load scheduling problem. The computational results show that the improved crossover strategies, combining multiple crossover operators with the progressive crossover strategy by path-relinking, are able not only to improve the running times of the original BRKGA, but also to find better solutions in the same running times.","PeriodicalId":408426,"journal":{"name":"Proceedings of the 2021 5th International Conference on Intelligent Systems, Metaheuristics & Swarm Intelligence","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115425602","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}

引用次数: 0

Hand-Crafted and Learned Spatiotemporal Filters to Inform and Track Visual Saliency 手工制作和学习的时空过滤器来通知和跟踪视觉显著性

Proceedings of the 2021 5th International Conference on Intelligent Systems, Metaheuristics & Swarm Intelligence Pub Date : 2021-04-10 DOI: 10.1145/3461598.3461605

Khaled Aboumerhi, R. Etienne-Cummings, Jonah P. Sengupta, J. Rattray

{"title":"Hand-Crafted and Learned Spatiotemporal Filters to Inform and Track Visual Saliency","authors":"Khaled Aboumerhi, R. Etienne-Cummings, Jonah P. Sengupta, J. Rattray","doi":"10.1145/3461598.3461605","DOIUrl":"https://doi.org/10.1145/3461598.3461605","url":null,"abstract":"This paper describes an event-tracking algorithm based on an unsupervised learning method to follow salient features. By learning spatiotemporal filters using computationally inexpensive distance metrics such as determinant comparisons, we show that salient features are captured by the learned activation prototypes, known as spatiotemporal templates. First, we discuss previous hand-crafted filter methods to capture spike-based data. While spatial and temporal filters are easily crafted for obvious features, hand-crafted filters are not robust and exhaustive templates for detecting events that may not be so obvious. It becomes clear that learning filters is a more diverse, rectifying method in identifying important features while remaining independent from human observations. We then show how spatiotemporal filters are learned through a series of prototype clustering. In order to handle information over time, we propose a series of decision trees in the form of a random forest inspired by lifelong learning. Finally, we conclude promising results on feature tracking, as well as the need for a ground-truth spike-based data-set to validate saliency algorithms.","PeriodicalId":408426,"journal":{"name":"Proceedings of the 2021 5th International Conference on Intelligent Systems, Metaheuristics & Swarm Intelligence","volume":"636 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123346828","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}

引用次数: 0

Proceedings of the 2021 5th International Conference on Intelligent Systems, Metaheuristics & Swarm Intelligence 2021年第五届智能系统、元启发式和群体智能国际会议论文集

Proceedings of the 2021 5th International Conference on Intelligent Systems, Metaheuristics & Swarm Intelligence Pub Date : 1900-01-01 DOI: 10.1145/3461598

引用次数: 0