Results 11 to 20 of about 35,479 (232)
An ant colony genetic fusion routing algorithm based on soft define network
IET Networks, EarlyView., 2022 Abstract Aiming at the problem that there are many paths in data forwarding in soft define network (SDN) network, and the optimal path is difficult to find, combined with the advantages of ant colony algorithm and Genetic algorithm (GA), a routing control strategy based on the ant colony genetic fusion algorithm is proposed.
Kaixin Zhao, Yong Wei, Yang Zhang
wiley +1 more source
IEEE Access, 2022 Buffer allocation is an important research issue in the design and optimization of manufacturing systems. One objective of buffer allocation is to maximize the throughput subject to the total buffer capacity in manufacturing systems.
Sixiao Gao
doaj +1 more source
A TSSA algorithm based approach to enhance the performance of warehouse system [PDF]
, 2008 In this plethora of increased competitiveness and globalization the effective management of the warehouse system is a challenging task. Realizing that proper scheduling of the warehouses is necessary to outperform the competitors on cost, lead time, and ...
Chan, Felix T.S., Kumar, Vikas
core +1 more source
Application of Heuristic Combinations within a Hyper-Heuristic Framework for Exam Timetabling
Jurnal RESTI (Rekayasa Sistem dan Teknologi Informasi), 2020 Examination Timetabling Problem is one of the optimization and combinatorial problems. It is proved to be a non-deterministic polynomial (NP)-hard problem.
Gabriella Icasia +2 more
doaj +1 more source
Tabu Search and an Exact Algorithm for the Solutions of Resource-constrained Project Scheduling Problems [PDF]
International Journal of Computational Intelligence Systems, 2011 When the project is scheduled with a given set of resources, it is difficult to find the optimal solution. Resourceconstrained scheduling problems (RCPSP) are generally NP-hard.
Omer Atli
doaj +1 more source
Joint multicast routing and channel assignment in multiradio multichannel wireless mesh networks using tabu search [PDF]
, 2009 Copyright @ 2009 IEEE Computer SocietyThis paper proposes a tabu search (TS) based optimization approach to search a minimum-interference multicast tree which satisfies the end-to-end delay constraint and optimizes the usage of the scarce radio network ...
Cheng, H, Yang, S
core +1 more source
Large-scale timetabling problems with adaptive tabu search
Journal of Intelligent Systems, 2022 Timetabling problems are specific types of scheduling problems that deal with assigning certain events to the timeslots. This assigning is subject to certain hard constraints that should be achieved to get a feasible timetable and soft constraints that ...
Awad Fouad H. +2 more
doaj +1 more source
Silva Fennica, 2002 As both spatial and temporal characteristics of desired future conditions are becoming important measures of forest plan success, forest plans and forest planning goals are becoming complex.
Bettinger, Pete +4 more
doaj +1 more source
A Fast and Robust Heuristic Algorithm for the Minimum Weight Vertex Cover Problem
IEEE Access, 2021 The minimum weight vertex cover problem (MWVCP) is a fundamental combinatorial optimization problem with various real-world applications. The MWVCP seeks a vertex cover of an undirected graph such that the sum of the weights of the selected vertices is ...
Yang Wang, Zhipeng Lu, Abraham P. Punnen
doaj +1 more source
A Tabu Search Based Approach for Graph Layout [PDF]
, 2014 This paper describes an automated tabu search based method for drawing general graph layouts with straight lines. To our knowledge, this is the first time tabu methods have been applied to graph drawing.
BAYKASOGLU +32 more
core +1 more source