Showing 1-25 of 5,452 resultsfor "Index Terms":tabu search
"Index Terms":tabu search
- Sort
Get notified when new research is published matching your search criteria.
Sort By
Results
A Novel Hybrid Tabu Search Algorithm With Binary Differential Operator for Knapsack Problems
2020 16th International Conference on Computational Intelligence and Security (CIS)
Year: 2020 | Conference Paper |
The knapsack problem (KP) is a typical NP- complete problem. In this paper, a novel tabu search (TS) algorithm with the elite set is presented to solve the KPs. The algorithm is a hybrid TS with a binary differential operator (BDO), which is denoted by TSBDO. The binary differential operator is employed to mutate individuals which are generated randomly from the list EliteSol. To validate the prop...Show More
Fuzzy rule base optimization of fuzzy controller using Hybrid Tabu Search and Particle Swarm Optimization learning algorithm
2011 World Congress on Information and Communication Technologies
Year: 2011 | Conference Paper |
Cited by: Papers (3)
In this paper, Hybrid Tabu Search (TS) and Particle Swarm Optimization (PSO) is proposed to generate Fuzzy Controller with only three rules. The algorithm dynamically adjusts the membership functions and fuzzy rules according to different environments. At each iteration of PSO algorithm, we calculate the best solution and we seek the best neighbor by Tabu search, this operation minimizes the numbe...Show More
A Tabu Search Approach for Optimizing Server Placement in Distributed Systems
2011 Second International Conference on Networking and Distributed Computing
Year: 2011 | Conference Paper |
Cited by: Papers (1)
In distributed systems, the server placement problem in which a new server has to compete with existing servers for user requests is important in planning of constructing new business service sites. In addition to minimizing cost, competition-aware server placement also needs to maximize the benefit of building a new server. This paper proposes a Tabu Search approach to optimize the problem in gen...Show More
Comparative study of metaheuristic algorithms using Knapsack Problem
2017 7th International Conference on Cloud Computing, Data Science & Engineering - Confluence
Year: 2017 | Conference Paper |
Cited by: Papers (8)
This paper aims to discuss and compare various metaheuristic algorithms applied to the “Knapsack Problem”. The Knapsack Problem is a combinatorial optimization maximization problem which requires to find the number of each weighted item to be included in a hypothetical knapsack, so the total weight is less than or equal to the required weight. To come to an optimized solution for such a problem, a...Show More
Genetic tabu search for the Multi-Objective knapsack problem
Tsinghua Science and Technology
Cited by: Papers (2)
We introduce a hybrid algorithm for the 0–1 multidimensional multi-objective knapsack problem. This algorithm, called GTSMOKP, combines a genetic procedure and a tabu search operator. The algorithm is evaluated on 9 well-known benchmark instances and shows highly competitive results compared with two state-of-the-art algorithms.Show More
An Evolutionary Tabu Search Algorithm for Matching Biomedical Ontologies
2018 14th International Conference on Computational Intelligence and Security (CIS)
Year: 2018 | Conference Paper |
Since these biomedical ontologies are mostly developed independently and many of them cover overlapping domains, establishing meaningful links between them, so-called biomedical ontology matching, is critical to ensure inter-operability and has the potential to unlock biomedical knowledge by bridging related data. Due to the complexity of the biomedical ontology matching problem (large-scale optim...Show More
A Comparison of Heuristic Search Algorithms for Predicting the Effort Component of Software Projects
2008 International Conference on Computational Intelligence for Modelling Control & Automation
Year: 2008 | Conference Paper |
This paper presents a new model to calculate the effort component of a software project. To find the optimal values of the parameters of the proposed model, this study used genetic algorithm (GA), simulated annealing (SA) and tabu search (TS) based algorithms. The results of the heuristic algorithms used are also compared.Show More
A Modified Tabu Search Method Applied to Inverse Problems
IEEE Transactions on Magnetics
Cited by: Papers (15)
A modified tabu search method for global optimizations of inverse problems is presented. In the proposed algorithm, the whole search procedure is divided into three different phases: intensification, diversification, and refinement. Two “new point generating mechanisms” as well as a “dynamic parameters updating” rule are proposed to improve the searching efficiency without compromising the solutio...Show More
Channel assignment problem in cellular networks: A reactive tabu search approach
2009 24th International Symposium on Computer and Information Sciences
Year: 2009 | Conference Paper |
Cited by: Papers (7)
The channel assignment problem (CAP) in cellular networks is concerned with the allocation and reuse of the frequency spectrum to the base stations in such a way that both the interference constraints and the traffic requirements of the cells are met. In this paper, we apply a reactive tabu search based method to solve the CAP and compare this approach with the classical tabu search as well as gen...Show More
Transit network design using improved Tabu search
Proceedings 2011 International Conference on Transportation, Mechanical, and Electrical Engineering (TMEE)
Year: 2011 | Conference Paper |
This paper proposes a Tabu search-based method to transit network design problem. The whole design is performed in two phases. Firstly, the method of shortest path is used to produce a good initial solution. Then, Tabu search generates new solutions to realize the objective of decreasing user cost. And the computation result shows its good usability in Transit network design and optimization solut...Show More
Aerial Path Planning for Multi-Vehicles
Rizwan Asif;Hendrik Löffel;Vorapol Assavasangthong;Giulio Martinelli;Phillip Gajland;Borja Gálvez
2019 IEEE Second International Conference on Artificial Intelligence and Knowledge Engineering (AIKE)
Year: 2019 | Conference Paper |
Unmanned Aerial Vehicles (UAV) are a potential solution to fast and cost efficient package delivery services. There are two types of UAVs, namely fixed wing (UAV-FW) and rotor wing (UAV-RW), which have their own advantages and drawbacks. In this paper we aim at providing different solutions to a collaborating multi-agent scenario combining both UAVs types. We show the problem can be reduced to the...Show More
Tabu Search Algorithm: Optimizing the Search Runtime
Abdul Nayeem Khalid;Naga Malleswara Rao Baki;Tarun Sai Phani Varma;Adnan Khan;Nilu Singh
2024 5th International Conference for Emerging Technology (INCET)
Year: 2024 | Conference Paper |
Cited by: Papers (1)
In the realm of combinatorial optimization, the Tabu Search algorithm has proven to be a powerful tool for solving complex problems. However, its practical implementation often encounters computational challenges, particularly in managing the frequently accessed” tabu list.” In this paper, authors introduced the Drop-set data structure, a novel approach designed to streamline the management of the...Show More
Optimization for the maximum circle inside a quasi-circle profile
2011 IEEE International Conference on Signal Processing, Communications and Computing (ICSPCC)
Year: 2011 | Conference Paper |
For increasing the utility rate of the log material, it is very important to obtain the maximum cylinder cut from round logs. The cross-section of a log can be viewed as a quasi-circle. In this paper, three novel methods for finding the maximum circle in a single quasi-circle closed profile are proposed and their performance is compared with that of using the local search (LS). In order to evaluat...Show More
On the mathematical program in theater anti-aircraft distribution problem
2017 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM)
Year: 2017 | Conference Paper |
The military theater anti-aircraft distribution problem is associated with determining positions of defender's missiles within a potential geographic area of operation. This research focuses on formulating and solving a mathematical model to aid decision makers to maximize defender's efficient course of actions assuming that an aircraft attacking plan is observed. The developed model is a Mixed In...Show More
Multi-interceptor Target Allocation Based on Improved Particle Swarm Optimization Algorithm
2019 IEEE 9th Annual International Conference on CYBER Technology in Automation, Control, and Intelligent Systems (CYBER)
Year: 2019 | Conference Paper |
Cited by: Papers (3)
Firstly, aiming at the tactical relationship between multiple interceptors and targets, this paper proposes an indicator function and establishes a target allocation model for multiple interceptors. Then it designs an improved hybrid particle swarm optimization algorithm. This algorithm uses the linear decreasing weight method to solve the contradiction between global search ability and convergenc...Show More
Research on 0–1 Backpack Problem based on Improved Quantum Tabu Genetic Algorithm
2023 3rd International Symposium on Computer Technology and Information Science (ISCTIS)
Year: 2023 | Conference Paper |
The 0–1 backpack problem(0-1KP) is one of the very common combinatorial optimization problems, and is also a widely studied NP-complete problem. In this paper, we propose a Dynamic Strategy Tabu Search Operator Based Quantum Genetic Algorithm (DTS-QGA), which introduces the tabu search operator on the basis of the quantum genetic algorithm. To verify the feasibility and superiority of the algorith...Show More
A Hybrid Tabu Search Algorithm for the Distributed Assembly Flowshop Scheduling Problem with Sequence Dependent Setup Times
2024 43rd Chinese Control Conference (CCC)
Year: 2024 | Conference Paper |
In this paper, a Hybrid Tabu Search (HTS) algorithm is proposed to solve the Distributed Assembly Permutation Flowshop Scheduling Problem with Sequence Dependent Setup Times (DAPFSP-SDST). For the objective of minimizing the maximal completion time (makespan), the optimization process is divided into two steps to minimize the Sum of Assembly Setup Times (SAST) and the Sum of Idle Time for Assembly...Show More
Use of VNS and TS in classification: variable selection and determination of the linear discrimination function coefficients
In this paper, we discuss the problem of variable selection and the determination of the coefficients for these variables that provide the best linear discrimination function with the objective of obtaining a high classification success rate. Given the relation that exists between both problems, they will be performed simultaneously. In order to resolve them, two algorithms based on the metaheuris...Show More
Multiobjective Tabu Search Algorithms for Optimal Design of Electromagnetic Devices
IEEE Transactions on Magnetics
Cited by: Papers (22)
In this paper, an original algorithm to solve multiobjective optimization problems, which makes use of the tabu search meta-heuristic, is presented. Scalarization of the vector problem is performed by introducing fitness functions that take under control both the Pareto optimality of the solutions, and the uniformity in the Pareto front sampling. The performance of the proposed algorithm is compar...Show More
Multi-objective assembly line balancing via adaptive tabu search method with partial random permutation technique
2008 IEEE International Conference on Industrial Engineering and Engineering Management
Year: 2008 | Conference Paper |
Cited by: Papers (7)
This paper proposes a novel intelligent approach for solving the assembly line balancing (ALB) problems. The adaptive tabu search (ATS) method and the partial random permutation (PRP) technique are combined to provide optimal solutions for the ALB problems. In this work, the ATS is used to address the number of tasks assigned for each workstation, while the PRP is conducted to assign the sequence ...Show More
In this paper a new multi-objective approach is presented to find the optimal placement of phasor measurement units (PMUs). The proposed method is based on a new parallel tabu search (TS) algorithm, and the lack of communication in substations can be considered, as a constraint. Finally, the solution for different cases are given and discussed.Show More
A comparative analysis of memory using and memory less algorithms for Quadratic Assignment Problem
2014 5th International Conference - Confluence The Next Generation Information Technology Summit (Confluence)
Year: 2014 | Conference Paper |
Cited by: Papers (3)
Several real life problem in areas like parallel computing, distributed computing, facilities location, and combinatorial data analysis can be modeled as Quadratic Assignment Problem (QAP). It belongs to the N-P Hard class of problems. Large instances of these problems cannot be solved with exact method in reasonable amount of time. Approximation methods and soft computing approaches are therefore...Show More
Adaptive initial beam search for sparse millimeter wave channels
2017 26th Wireless and Optical Communication Conference (WOCC)
Year: 2017 | Conference Paper |
Cited by: Papers (9)
Narrow beamforming solutions for millimeter wave cellular networks require mobile and base stations to exhaustively search all angular space. This scanning is mandatory in order to detect the unique optimum beamforming and combining vectors prior to control and data signaling. However exhaustive search yields large computational complexity and increases beam discovery time and control plane latenc...Show More
Optimizing Tabu List in Tabu Search Algorithm for Efficient and Optimal Scheduling
Herri Akhmad Bukhori;Tiksno Widyatmoko;S Sunarti;Irawan Dwi Wahyono;Amira Eza Febrian Putri;Dwi Sudarno Putra;Ahmad Awaluddin Baiti;Muhammad Zenda Rud;Diana Putri
2023 Sixth International Conference on Vocational Education and Electrical Engineering (ICVEE)
Year: 2023 | Conference Paper |
Cited by: Papers (2)
Scheduling is one of the essential processes that every organization must carry out to achieve organizational goals. Scheduling problems can occur in various organizations, especially with significant resources such as companies, governments, and educational institutions. SMP IT As Salam Malang has 8 classes, scheduling subjects is a complicated problem that always occurs at the beginning of each ...Show More
IEEE Account
Purchase Details
Profile Information
Need Help?
- US & Canada: +1 800 678 4333
- Worldwide: +1 732 981 0060
- Contact & Support
- About IEEE Xplore
- Contact Us
- Help
- Accessibility
- Terms of Use
- Nondiscrimination Policy
- Sitemap
- Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest technical professional organization dedicated to advancing technology for the benefit of humanity.
© Copyright 2025 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.