A Memetic Model Based on Fixed Structure Learning Automata for Solving NP-Hard Problems

DOI10.1007/978-3-030-76291-9_5zbMath1485.68220OpenAlexW3175169580MaRDI QIDQ5861760

No author found.

Publication date: 2 March 2022

Published in: Intelligent Systems Reference Library (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-76291-9_5

Mathematics Subject Classification ID

Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Learning and adaptive systems in artificial intelligence (68T05) Formal languages and automata (68Q45) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• Unnamed Item
• An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem
• Recent advances in learning automata
• A comparison of multiprocessor task scheduling algorithms with communication costs
• A learning automata-based algorithm for determination of the number of hidden units for three-layer neural networks
• Deterministic learning automata solutions to the equipartitioning problem

This page was built for publication: A Memetic Model Based on Fixed Structure Learning Automata for Solving NP-Hard Problems