Results 181 to 190 of about 36,831 (214)
Some of the next articles are maybe not open access.
Tabu-Search-Based Pilot Assignment for Cell-Free Massive MIMO Systems
IEEE Transactions on Vehicular Technology, 2020In this correspondence, an efficient pilot assignment scheme based on tabu search (TS) is proposed to mitigate the severe pilot contamination effect caused by pilot reuse in cell-free massive multiple-input multiple-output systems.
Heng Liu +5 more
semanticscholar +1 more source
Tabu Search Algorithm (TSA): A Comprehensive Survey
International Conference Emerging Technologies Computer Engineering: Microservices Big Data Analytics, 2020This paper is presents a Comprehensive Survey on Tabu Search Algorithms (TSA). TSA is a meta heuristics kind of algorithm which works on global optimal solution for a given problem such as vehicle routing problem (VRP), open vehicle routing problem (OVRP)
Vishnudeo Prajapati +2 more
semanticscholar +1 more source
Information Sciences, 2020
The Quadratic Assignment Problem (QAP) is one of the most studied classical combinatorial optimization problems. QAP has many practical applications. Designing enhanced meta-heuristic approaches for the QAP is an active research area.
Huizhen Zhang +3 more
semanticscholar +1 more source
The Quadratic Assignment Problem (QAP) is one of the most studied classical combinatorial optimization problems. QAP has many practical applications. Designing enhanced meta-heuristic approaches for the QAP is an active research area.
Huizhen Zhang +3 more
semanticscholar +1 more source
Granular tabu search for the pickup and delivery problem with time windows and electric vehicles
European Journal of Operational Research, 2019Nowadays, electric vehicles are considered a viable option for goods distribution, especially in urban areas that are heavily burdened by local emissions.
Dominik Goeke
semanticscholar +1 more source
A hybrid binary particle swarm optimization with tabu search for the set-union knapsack problem
Expert systems with applications, 2019The set-union knapsack problem (SUKP) is a generalization of the standard 0–1 knapsack problem. It is NP-hard, and has several industrial applications.
Geng Lin +3 more
semanticscholar +1 more source
An effective hybrid genetic algorithm and tabu search for flexible job shop scheduling problem
, 2016Xinyu Li, Liang Gao
semanticscholar +1 more source
A multi objective Tabu particle swarm optimization for effective cluster head selection in WSN
Cluster Computing, 2018K. Vijayalakshmi, P. Anandan
semanticscholar +1 more source

