- 标题
- 摘要
- 关键词
- 实验方案
- 产品
-
[IEEE 2020 International Conference on Information Networking (ICOIN) - Barcelona, Spain (2020.1.7-2020.1.10)] 2020 International Conference on Information Networking (ICOIN) - Design of Web-based Monitoring System for Solar Photovoltaic Power Plants
摘要： Fuzzy job-shop scheduling problems (FJSPs) with various imprecise factors are a category of combination optimization problems known as non-deterministic polynomial-hard problems. In this paper, a hybrid algorithm HICATS combining discrete imperialist competition algorithm (ICA) and Tabu search (TS) is proposed to solve FJSPs with fuzzy processing time and fuzzy due date. The objective function is maximizing the minimum agreement index, which is on the basis of the agreement index of fuzzy due date and fuzzy completion time. In the proposed algorithm, ICA conducts the global search and TS performs the local search. The imperialist is used to guide the colonies in the same empire. So, local search approach based on TS is applied to the imperialist to perform ?ne-grained exploitation. The 6 × 6 and 10 × 10 FJSPs with fuzzy processing time and fuzzy due date are tested to evaluate the performance of the proposed algorithm HICATS in this paper. The highly effective performance of HICATS is shown against the best performing algorithms from the literature. Experimental results demonstrate the advantages of our proposed algorithm HICATS on the feasibility and robustness compared with other algorithms.
关键词： fuzzy processing time and fuzzy due date,fuzzy job-shop scheduling problem,Tabu search,Discrete imperialist competition algorithm,maximizing the minimum agreement index
更新于2025-09-16 10:30:52
-
[ACM Press the Genetic and Evolutionary Computation Conference Companion - Prague, Czech Republic (2019.07.13-2019.07.17)] Proceedings of the Genetic and Evolutionary Computation Conference Companion on - GECCO '19 - Immune and genetic hybrid optimization algorithm for data relay satellite with microwave and laser links
摘要： Aiming at the problem of oversubscription of data relay access request of user stars in future Space-Based Information System, the problem of resource scheduling optimization for data relay satellite system with microwave and laser hybrid links is studied. The characteristics of the hybrid links are analyzed. A multi- objective programming model on static resource scheduling constraint satisfaction problem is established, and a hybrid optimization algorithm integration of artificial immune strategies, niche ideas and improved genetic algorithm is put forward to solve the scheduling model. Simulation results show that the hybrid optimization algorithm optimizes the model quickly, and the ability of global optimization and performs well in convergence. The results validate the static resource scheduling model could accurately describe the microwave and laser hybrid links relay satellite system resource scheduling problem with multi-tasking and multi-type antenna1.
关键词： tabu search,resources scheduling,genetic algorithm,niche,Data relay satellite
更新于2025-09-11 14:15:04
-
[Lecture Notes in Networks and Systems] Renewable Energy for Smart and Sustainable Cities Volume 62 (Artificial Intelligence in Renewable Energetic Systems) || Validation of Three Level Solar Inverter Based on Tabu Search Algorithm
摘要： Providing electrical energy for oil and gas extraction sites can be a real challenge especially for a large oil and gas company like Sonatrach. Solar energy can be great solution for this issue. This study presents an ef?cient way to convert electrical energy from DC to AC using a modulation strategy called selective harmonic elimination (SHE); this method will be used to optimize the performance of a three level solar inverter for standalone power system. Harmonic pollution is a very common problem in the ?eld of power electronics, this problem can cause multiple problems for power converters and electrical devices and also reduce their lifespan. The SHE modulation strategy allows the elimination of low order harmonics and also control the amplitude of the fundamental component of the output voltage spectrum. In this paper Tabu Search Algorithm (TSA) is used to determine optimum switching angles for a three level solar inverter. Simulation and experimental results are presented in this work.
关键词： Optimization,Tabu Search Algorithm,Solar inverter,Harmonic elimination
更新于2025-09-10 09:29:36
-
[IEEE 2018 IEEE 23rd International Conference on Emerging Technologies and Factory Automation (ETFA) - Turin (2018.9.4-2018.9.7)] 2018 IEEE 23rd International Conference on Emerging Technologies and Factory Automation (ETFA) - Large-Scale Scheduling with Routing, Batching and Release Dates for Wafer Fabs using Tabu Search
摘要： Semiconductor fabricating facilities (wafer fabs) aim for manageable, heuristics that can reproducibly solve their typical large-scale dynamic complex job shop scheduling problems. Hence, the main contribution of this work is a deterministic tabu search algorithm that sequences, routes and batches the process operations of a continuous reentrant material flow using a large-scale mix of single, flexible (parallel) and batch machines. Due to continuous production, release dates and due dates are considered to minimize job tardiness. Using known large-scale benchmark instances, sixteen neighborhood structures are validated to find a practical compromise between solution quality and computational effort. The result is a novel combination of neighborhoods for simultaneous sequencing, routing and batching that finds good schedules for problem instances of industrial size and complexity in an acceptable time.
关键词： local search,variable neighborhood,due dates,routing,tardiness,large scale,batch,release dates,tabu search,optimization,complex job shop scheduling,flexible machines
更新于2025-09-09 09:28:46
-
Enrutamiento y asignación de longitud de onda: Nueva heurística snake-one para redes WDM bajo tráfico dinámico
摘要： In this paper is shown the simulation results of a new heuristic, called snake-one. The simulation was performed in the National Science Foundation NETwork (NSFNET-USA) under dynamic traffic and compared with other heuristics such as Simulated Annealing, Genetic Algorithms and Tabu Search previously released, using the Blocking Probability indicator and Network Utilization. Comparing these heuristics, we can observe the improvement, of the blocking up to 130 Erlangs. Nevertheless, this results mean an increased and sustained use of the network. This behavior determines a partially good result, which determines the study of a modification of the Snake-one algorithm to improve both indicators.
关键词： snake-one,Simulated annealing,genetic algorithm,tabu search
更新于2025-09-04 15:30:14