Filters








449 Hits in 5.6 sec

Reconstruction of Function Block Logic Using Metaheuristic Algorithm

Daniil Chivilikhin, Anatoly Shalyto, Sandeep Patil, Valeriy Vyatkin
2017 IEEE Transactions on Industrial Informatics  
An approach for automatic reconstruction of automation logic from execution scenarios using a metaheuristic algorithm is proposed.  ...  IEC 61499 basic function blocks are chosen as implementation language and reconstruction of Execution Control Charts for basic function blocks is addressed.  ...  We also thank Vladimir Ulyantsev and the anonymous reviewers for useful comments.  ... 
doi:10.1109/tii.2017.2710224 fatcat:nw4r2fmeazb7nomga26fhjevai

Reconstruction of function block logic using metaheuristic algorithm: Initial explorations

Daniil Chivilikhin, Anatoly Shalyto, Sandeep Patil, Valeriy Vyatkin
2015 2015 IEEE 13th International Conference on Industrial Informatics (INDIN)  
This paper presents an approach for automatic reconstruction of automation logic from execution scenarios using a metaheuristic algorithm.  ...  The IEC 61499 basic function blocks is chosen as implementation language and reconstruction of Execution Control Charts for basic function blocks is addressed.  ...  ACKNOWLEDGMENT This work was financially supported by the Government of Russian Federation, Grant 074-U01, and also partially by RFBR, research project No. 14-01-00551 a.  ... 
doi:10.1109/indin.2015.7281912 dblp:conf/indin/ChivilikhinSPV15 fatcat:sufmjof6gvbmbjpllhsdkgllgu

Reconstruction of function block controllers based on test scenarios and verification

Daniil Chivilikhin, Ilya Ivanov, Anatoly Shalyto, Valeriy Vyatkin
2016 2016 IEEE 14th International Conference on Industrial Informatics (INDIN)  
The paper addresses the problem of reverse engineering a function block (FB) in situations when its source code is either not available or is too complex to understand.  ...  The proposed approach builds up on a recent method for reconstructing FBs based on testing and a search-based optimization algorithm.  ...  ACKNOWLEDGEMENTS This work was financially supported by the Government of Russian Federation, Grant 074-U01, and also partially funded by RFBR according to the research project No. 16-37-00205 mol a.  ... 
doi:10.1109/indin.2016.7819240 dblp:conf/indin/ChivilikhinISV16 fatcat:u6pjojvcnjcajjrapqjarv7htq

How an optimal observer can collapse the search space

Christophe Philemotte, Hugues Bersini
2006 Proceedings of the 8th annual conference on Genetic and evolutionary computation - GECCO '06  
Many metaheuristics have difficulty exploring their search space comprehensively. Exploration time and efficiency are highly dependent on the size and the ruggedness of the search space.  ...  For instance, the Simple Genetic Algorithm (SGA) is not totally suited to traverse very large landscapes, especially deceptive ones.  ...  This assignment and mapping functions partially reconstruct the encoding of the treated problem. The function works as described in Algorithm 4 and 5.  ... 
doi:10.1145/1143997.1144196 dblp:conf/gecco/PhilemotteB06 fatcat:nqks64x4ifc2hm7ezzk7dfpp4u

General Purpose Optimization Library (GPOL): A Flexible and Efficient Multi-Purpose Optimization Library in Python

Illya Bakurov, Marco Buzzelli, Mauro Castelli, Leonardo Vanneschi, Raimondo Schettini
2021 Applied Sciences  
Some focus on individual optimization algorithms, or limited sets of them, and others focus on limited sets of problems.  ...  search algorithms, through which flexible and modular implementation can allow for solving many different problem types from the fields of continuous and combinatorial optimization and supervised machine  ...  Then, one has to create a reconstruction function, choose the index of the individual to reconstruct, and finally, reconstruct it. Appendix B.6.  ... 
doi:10.3390/app11114774 fatcat:w4wrvvcwfvbqtbpv67tc3uxln4

On the Use of Biased-Randomized Algorithms for Solving Non-Smooth Optimization Problems

Angel Alejandro Juan, Canan Gunes Corlu, Rafael David Tordecilla, Rocio de la Torre, Albert Ferrer
2019 Algorithms  
Hence, they can be used to explore promising areas of the solution space without the limitations of gradient-based approaches, which assume the existence of smooth objective functions.  ...  In this paper, we propose the use of biased-randomized algorithms as an effective methodology to cope with NP-hard and non-smooth optimization problems in many practical applications.  ...  Sona Taheri for inviting us to participate in this special issue in honor of Prof. Dr. Adil M. Bagirov. Conflicts of Interest: The authors declare no conflict of interest. Algorithms 2020, 13, 8  ... 
doi:10.3390/a13010008 fatcat:544u6u63lzeo7lh2dp7evfbwua

An effective iterated greedy algorithm for blocking hybrid flow shop problem with due date window

Ahmed Missaoui, Younès Boujelbene
2021 Reserche operationelle  
In order to prove the robustness of our method, we evaluated it using a new benchmark of more than 1000 instances.  ...  This variant of the hybrid flowshop problem is not investigated to the best of our knowledge. we introduced a new metaheuristic centered on the iterated greedy approach. to evaluate the proposed method  ...  Genetic algorithm is used to solve the problem. For their part, Zeng and Yang [36] proposed a new mixed integer linear program (MILP) and two metaheuristics to study the HFS with a limited storage.  ... 
doi:10.1051/ro/2021076 fatcat:px652z2rvff2hldqac4c5mr4ou

Systematic Boolean Satisfiability Programming in Radial Basis Function Neural Network

Mansor, Mohd Jamaludin, Mohd Kasihmuddin, Alzaeemi, Md Basir, Sathasivam
2020 Processes  
Radial Basis Function Neural Network (RBFNN) is a class of Artificial Neural Network (ANN) that contains hidden layer processing units (neurons) with nonlinear, radially symmetric activation functions.  ...  The simulation dynamic was carried out by using the simulated data, randomly generated by the program.  ...  Conflicts of Interest: The authors declare no conflict of interest.  ... 
doi:10.3390/pr8020214 fatcat:75npfsdsmjd55ovtwjn4zalrle

GPU computing applied to linear and mixed-integer programming [chapter]

V. Boyer, D. El Baz, M.A. Salazar-Aguilar
2017 Advances in GPU Research and Practice  
The OR field is rich in complex problems and sophisticated algorithms that can take advantage of parallelization. However, all algorithms in the literature do not fit to the SIMT paradigm.  ...  Therefore, we highlight the main issues tackled by different authors to overcome the difficulties of implementation and the results obtained with their optimization algorithms via GPU computing.  ...  Conflicts of Interest The authors declare that they have no conflicts of interest.  ... 
doi:10.1016/b978-0-12-803738-6.00010-0 fatcat:6zsncjy25ndyxjz646svt7j5le

Bat-Genetic Encryption Technique

Hamdy M. Mousa, Faculty of Computers and Information, Menoufia University, Egypt
2019 International Journal of Intelligent Systems and Applications  
The main stages of B-GET are preprocessing, encryption process, bat algorithm steps, and genetic processes. B-GET also comprises an arithmetic and logical operators that increase encryption quality.  ...  Empirical results show that the reconstructed data is a copy of the original.  ...  BA combines a good mixture of main advantages of metaheuristic algorithms and it is theoretically more powerful than other meta-heuristic algorithms [22] .  ... 
doi:10.5815/ijisa.2019.11.01 fatcat:4m3rgb76zbch5hwuiw7hdfpu4u

Table of contents

2010 2010 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum (IPDPSW)  
Bader Aleksandar I1ic and Leonel Sousa Efficient Exhaustive Verification of the Collatz Conjecture using DSP48E blocks of Xilinx Virtex-S FPGAs Yasuaki Ito and Koji Nakano Modeling and Analysis of Real-Time  ...  and Halim Mahdi pALS: An Object-Oriented Framework for Developing Parallel Cooperative Metaheuristics Andres Bernal and Harold Castro A New Parallel Asynchronous Cellular Genetic Algorithm for Scheduling  ...  Andreas Dittrich and Felix Salfner Analysis of Network Topologies and Fault-Tolerant Routing Algorithms using Binary Decision Diagrams Andreas C.  ... 
doi:10.1109/ipdpsw.2010.5470714 fatcat:cln6cqeiljbvhfbg3pkziyj5fm

Sustainable Aviation Electrification: A Comprehensive Review of Electric Propulsion System Architectures, Energy Management, and Control

Jinning Zhang, Ioannis Roumeliotis, Argyrios Zolotas
2022 Sustainability  
Then, the challenges and technical barriers of electrified aircraft propulsion control system design are discussed, followed by a summary of the control methods frequently used in aircraft propulsion systems  ...  Next, the mainstream energy management strategies are investigated and further utilized to minimize the block fuel burn, emissions, and economic cost.  ...  Metaheuristic algorithms have been extensively used in energy management for electric aircraft.  ... 
doi:10.3390/su14105880 fatcat:3ympviy5k5faplzoi5qgwuz5bu

Classification of SSVEP-based BCIs using Genetic Algorithm

Hamideh Soltani, Zahra Einalou, Mehrdad Dadgostar, Keivan Maghooli
2021 Journal of Big Data  
However, genetic algorithm (GA), as an evolutionary method, is used to select features. Finally, classification was done using the two approaches support vector machine (SVM) and Bayesian method.  ...  Five features were selected and the accuracy of Bayesian classification was measured to be 80% with dimension reduction. Ultimately, the classification accuracy reached 90.4% using SVM classifier.  ...  Fig. 1 1 The block diagram of the proposed algorithm Soltani et al.  ... 
doi:10.1186/s40537-021-00478-y fatcat:fturmjir6fclzglkre5d5adklq

Healthcare scheduling in optimization context: a review

Zahraa A. Abdalkareem, Amiza Amir, Mohammed Azmi Al-Betar, Phaklen Ekhan, Abdelaziz I. Hammouri
2021 Health and Technology  
In the last decades, the healthcare scheduling methods that aim to automate the search for optimal resource management in hospitals by using metaheuristics methods have proliferated.  ...  The development of healthcare scheduling research plays a critical role in optimizing costs and improving the patient flow, providing prompt administration of treatment, and the optimal use of the resources  ...  From an algorithmic point of view, patient admission scheduling problem versions were handled using different heuristics, metaheuristic, or exact method.  ... 
doi:10.1007/s12553-021-00547-5 pmid:33868893 pmcid:PMC8035616 fatcat:bfjp7ftohbbb5a7lqclow3okoe

An ant colony optimization metaheuristic for single-path multicommodity network flow problems

X-Y Li, Y P Aneja, F Baki
2010 Journal of the Operational Research Society  
Owing to computational impracticality of exact algorithms for practical networks, we propose an ant colony optimization-(ACO) based metaheuristic to deal with SMNF.  ...  The proposed algorithms' efficiencies are experimentally investigated on some generated instances of SMNF.  ...  Acknowledgements- The authors thank the editor and the referees for their valuable comments and suggestions that have greatly improved the quality of this paper.  ... 
doi:10.1057/jors.2009.86 fatcat:m4qkzefakzbkvl5r2q74r3bzuq
« Previous Showing results 1 — 15 out of 449 results