Auswahl der wissenschaftlichen Literatur zum Thema „Encodings and local search operators“
Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an
Inhaltsverzeichnis
Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "Encodings and local search operators" bekannt.
Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.
Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.
Zeitschriftenartikel zum Thema "Encodings and local search operators"
Raidl, Günther R., und Jens Gottlieb. „Empirical Analysis of Locality, Heritability and Heuristic Bias in Evolutionary Algorithms: A Case Study for the Multidimensional Knapsack Problem“. Evolutionary Computation 13, Nr. 4 (Dezember 2005): 441–75. http://dx.doi.org/10.1162/106365605774666886.
Der volle Inhalt der QuelleVarnamkhasti, M. Jalali. „A genetic algorithm rooted in integer encoding and fuzzy controller“. IAES International Journal of Robotics and Automation (IJRA) 8, Nr. 2 (01.06.2019): 113. http://dx.doi.org/10.11591/ijra.v8i2.pp113-124.
Der volle Inhalt der QuelleGao, Yilong, Zhiqiang Xie, Xinyang Liu, Wei Zhou und Xu Yu. „Integrated scheduling algorithm based on the priority constraint table for complex products with tree structure“. Advances in Mechanical Engineering 12, Nr. 12 (Dezember 2020): 168781402098520. http://dx.doi.org/10.1177/1687814020985206.
Der volle Inhalt der QuelleJalali Varnamkhasti, M., und L. S. Lee. „A Fuzzy Genetic Algorithm Based on Binary Encoding for Solving Multidimensional Knapsack Problems“. Journal of Applied Mathematics 2012 (2012): 1–23. http://dx.doi.org/10.1155/2012/703601.
Der volle Inhalt der QuelleJiang, Tianhua. „A Hybrid Grey Wolf Optimization for Job Shop Scheduling Problem“. International Journal of Computational Intelligence and Applications 17, Nr. 03 (September 2018): 1850016. http://dx.doi.org/10.1142/s1469026818500165.
Der volle Inhalt der QuelleYang, Jinfeng, und Hua Xu. „Hybrid Memetic Algorithm to Solve Multiobjective Distributed Fuzzy Flexible Job Shop Scheduling Problem with Transfer“. Processes 10, Nr. 8 (01.08.2022): 1517. http://dx.doi.org/10.3390/pr10081517.
Der volle Inhalt der QuelleWeise, Thomas. „Software - motipy: the Metaheuristic Optimization in Python Library“. ACM SIGEVOlution 16, Nr. 4 (Dezember 2023): 1–2. http://dx.doi.org/10.1145/3638461.3638464.
Der volle Inhalt der QuelleZhang, L., und U. Kleine. „A novel bottom-left packing genetic algorithm for analog module placement“. Advances in Radio Science 1 (05.05.2003): 191–96. http://dx.doi.org/10.5194/ars-1-191-2003.
Der volle Inhalt der QuelleSalcedo-Sanz, S., J. Del Ser und Z. W. Geem. „An Island Grouping Genetic Algorithm for Fuzzy Partitioning Problems“. Scientific World Journal 2014 (2014): 1–15. http://dx.doi.org/10.1155/2014/916371.
Der volle Inhalt der QuelleYu, Zhenao, Peng Duan, Leilei Meng, Yuyan Han und Fan Ye. „Multi-objective path planning for mobile robot with an improved artificial bee colony algorithm“. Mathematical Biosciences and Engineering 20, Nr. 2 (2022): 2501–29. http://dx.doi.org/10.3934/mbe.2023117.
Der volle Inhalt der QuelleDissertationen zum Thema "Encodings and local search operators"
Tsogbetse, Israël. „Etude de codages et voisinages d'un espace de recherche. Application à l'ordonnancement de tâches dans des cas contraints“. Electronic Thesis or Diss., Bourgogne Franche-Comté, 2024. http://www.theses.fr/2024UBFCA001.
Der volle Inhalt der QuelleMetaheuristics are optimization problem-solving methods that primarily rely on an abstract representation of solutions in the form of direct or indirect encoding. Improving a solution or a set of solutions in parallel is achieved through manipulations of these encodings and algorithms evaluating the quality of associated solutions. The transition from one solution to another involves the use of one or more operators to explore the search space. Generally, metaheuristics utilize these operators to iteratively enhance solutions until reaching a local (or global) optimum. A plethora of metaheuristics has been proposed to address combinatorial optimization problems, including task scheduling problems. These ones are often dedicated to specific classes of instances. In this context, researchers frequently propose algorithms that combine various methods, striving to optimize parameters across different parts of their algorithms. However, the achieved performance is often comparable, and efficiency depends on the class of instances addressed. While solution encodings and neighborhood operators are recognized as essential components within metaheuristics, they are rarely jointly examined in an analytical and scientific manner.This thesis aims to characterize solution encodings and neighborhood operators commonly used in scheduling, particularly for the job shop problem and for one of its variants, in which the objective is to minimize the makespan. The ambition is to exploit the properties of the search spaces induced by these encodings and operators to enhance the design of metaheuristics. The approach applied in our study is structured into two main parts, with a gradation in the complexity of the job shop problem. The first part focuses on characterizing search spaces through a fitness landscape analysis, using metrics from the literature. The second part involves evaluating the performance of various combinations of encodings and neighborhood operators with the aim of identifying potential correlations with landscape properties. This is done to provide recommendations for the design of metaheuristics. This approach is initially applied to a basic job shop and then to a more constrained variant: the flexible job shop with transportation constraints. Our work highlights the challenge of linking the performance of tested combinations with standard metrics. The comparison of results obtained for the basic problem and its more constrained variant leads us to express reservations about a systematic generalization of encoding and operator characteristics for this category of optimization problems
Buchteile zum Thema "Encodings and local search operators"
Kordos, Mirosław, Rafał Kulka, Tomasz Steblik und Rafał Scherer. „Local Search in Selected Crossover Operators“. In Computational Science – ICCS 2022, 369–82. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-08757-8_31.
Der volle Inhalt der QuelleChen, Yujie, Philip Mourdjis, Fiona Polack, Peter Cowling und Stephen Remde. „Evaluating Hyperheuristics and Local Search Operators for Periodic Routing Problems“. In Evolutionary Computation in Combinatorial Optimization, 104–20. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-30698-8_8.
Der volle Inhalt der QuelleFreisleben, Bernd, und Peter Merz. „New genetic local search operators for the traveling salesman problem“. In Parallel Problem Solving from Nature — PPSN IV, 890–99. Berlin, Heidelberg: Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/3-540-61723-x_1052.
Der volle Inhalt der QuelleAboutaib, Brahim, Sébastien Verel, Cyril Fonlupt, Bilel Derbel, Arnaud Liefooghe und Belaïd Ahiod. „On Stochastic Fitness Landscapes: Local Optimality and Fitness Landscape Analysis for Stochastic Search Operators“. In Parallel Problem Solving from Nature – PPSN XVI, 97–110. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-58115-2_7.
Der volle Inhalt der QuelleNigam, Vivek, Giselle Reis, Samar Rahmouni und Harald Ruess. „Proof Search and Certificates for Evidential Transactions“. In Automated Deduction – CADE 28, 234–51. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-79876-5_14.
Der volle Inhalt der QuelleBansal, Jagdish Chand, Prathu Bajpai, Anjali Rawat und Atulya K. Nagar. „Advancements in the Sine Cosine Algorithm“. In Sine Cosine Algorithm for Optimization, 87–103. Singapore: Springer Nature Singapore, 2023. http://dx.doi.org/10.1007/978-981-19-9722-8_5.
Der volle Inhalt der QuelleDurgut, Rafet, und Mehmet Emin Aydin. „Multi Strategy Search with Crow Search Algorithm“. In Optimization Algorithms [Working Title]. IntechOpen, 2022. http://dx.doi.org/10.5772/intechopen.102862.
Der volle Inhalt der QuelleOuld Sidi, Hamed, Rachid Ellaia, Emmanuel Pagnacco und Ahmed Tchvagha Zeine. „An Immune Multiobjective Optimization with Backtracking Search Algorithm Inspired Recombination“. In Search Algorithm - Essence of Optimization. IntechOpen, 2023. http://dx.doi.org/10.5772/intechopen.100306.
Der volle Inhalt der QuelleKonferenzberichte zum Thema "Encodings and local search operators"
Yin, Shuo, und Guoqiang Zhong. „LGI-GT: Graph Transformers with Local and Global Operators Interleaving“. In Thirty-Second International Joint Conference on Artificial Intelligence {IJCAI-23}. California: International Joint Conferences on Artificial Intelligence Organization, 2023. http://dx.doi.org/10.24963/ijcai.2023/501.
Der volle Inhalt der QuelleTanigaki, Yuki, Hiroyuki Masuda, Yu Setoguchi, Yusuke Nojima und Hisao Ishibuchi. „Algorithm structure optimization by choosing operators in multiobjective genetic local search“. In 2015 IEEE Congress on Evolutionary Computation (CEC). IEEE, 2015. http://dx.doi.org/10.1109/cec.2015.7256980.
Der volle Inhalt der QuelleGreen, Jeremy R., Anthony Francis, Parikshit Junnarkar, Miao Chuan, Thomas Rae und Hartmut Wittig. „Search for a bound H-dibaryon using local six-quark interpolating operators“. In The 32nd International Symposium on Lattice Field Theory. Trieste, Italy: Sissa Medialab, 2015. http://dx.doi.org/10.22323/1.214.0107.
Der volle Inhalt der QuellePourhassan, Mojgan, und Frank Neumann. „On the Impact of Local Search Operators and Variable Neighbourhood Search for the Generalized Travelling Salesperson Problem“. In GECCO '15: Genetic and Evolutionary Computation Conference. New York, NY, USA: ACM, 2015. http://dx.doi.org/10.1145/2739480.2754656.
Der volle Inhalt der QuelleDomınguez-Isidro, Saul, Efren Mezura-Montes und Guillermo Leguizamon. „Performance comparison of local search operators in differential evolution for constrained numerical optimization problems“. In 2014 IEEE Symposium on Differential Evolution (SDE). IEEE, 2014. http://dx.doi.org/10.1109/sde.2014.7031530.
Der volle Inhalt der QuelleGao, Kaizhou, Yicheng Zhang, Yi Zhang und Rong Su. „A meta-heuristic with ensemble of local search operators for urban traffic light optimization“. In 2017 IEEE Symposium Series on Computational Intelligence (SSCI). IEEE, 2017. http://dx.doi.org/10.1109/ssci.2017.8285317.
Der volle Inhalt der QuelleLiu, Xin-Xin, Dong Liu, Qiang Yang, Xiao-Fang Liu, Wei-Jie Yu und Jun Zhang. „Comparative Analysis of Five Local Search Operators on Visiting Constrained Multiple Traveling Salesmen Problem“. In 2021 IEEE Symposium Series on Computational Intelligence (SSCI). IEEE, 2021. http://dx.doi.org/10.1109/ssci50451.2021.9659963.
Der volle Inhalt der QuelleRodrigues da Cruz, André, Rodrigo Tomás Nogueira Cardoso, Elizabeth Fialho Wanner und Ricardo Takahashi. „Local Search Operators Based on Linear-Quadratic Approximations for Multiobjective Problems on a Budget Scenario“. In ANAIS DO SIMPóSIO BRASILEIRO DE PESQUISA OPERACIONAL. Rio de Janeiro - Rio de Janeiro, Brasil: Galoa, 2018. http://dx.doi.org/10.59254/sbpo-2018-85409.
Der volle Inhalt der QuelleDominguez-Isidro, Saul, und Efren Mezura-Montes. „Study of direct local search operators influence in memetic differential evolution for constrained numerical optimization problems“. In 2017 International Conference on Electronics, Communications and Computers (CONIELECOMP). IEEE, 2017. http://dx.doi.org/10.1109/conielecomp.2017.7891831.
Der volle Inhalt der QuelleKatayama, Kengo, Yuto Akagi, Elis Kulla, Hideo Minamihara und Noritaka Nishihara. „New Kick Operators in Iterated Local Search Based Metaheuristic for Solving the Node Placement Problem in Multihop Networks“. In 2014 17th International Conference on Network-Based Information Systems (NBiS). IEEE, 2014. http://dx.doi.org/10.1109/nbis.2014.35.
Der volle Inhalt der Quelle