Results 271 to 280 of about 2,693,622 (341)
Some of the next articles are maybe not open access.
Computers & industrial engineering, 2021
The general distributed flexible job shop scheduling problem (DFJSP) involves three sub-problems: (1) operation-sequencing, (2) job-to-cell assignment, and (3) operation-to-machine assignment.
Wenxiang Xu +4 more
semanticscholar +1 more source
The general distributed flexible job shop scheduling problem (DFJSP) involves three sub-problems: (1) operation-sequencing, (2) job-to-cell assignment, and (3) operation-to-machine assignment.
Wenxiang Xu +4 more
semanticscholar +1 more source
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
, 2018 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
Journal of Computational Chemistry, 2006
AbstractThis paper presents a modification of the tabu search called gradient tabu search (GTS). It uses analytical gradients for a fast minimization to the next local minimum and analytical diagonal elements of the Hessian to escape local minima. For an efficient blocking of already visited areas tabu regions and tabu directions are introduced into ...
Svetlana Stepanenko, Bernd Engels
openaire +2 more sources
AbstractThis paper presents a modification of the tabu search called gradient tabu search (GTS). It uses analytical gradients for a fast minimization to the next local minimum and analytical diagonal elements of the Hessian to escape local minima. For an efficient blocking of already visited areas tabu regions and tabu directions are introduced into ...
Svetlana Stepanenko, Bernd Engels
openaire +2 more sources
Proceedings of the 9th annual conference on Genetic and evolutionary computation, 2007
Recombination in the Genetic Algorithm (GA) is supposed to extract the component characteristics from two parents and reassemble them in different combinations hopefully producing an offspring that has the good characteristics of both parents. Symbiotic Combination is formerly introduced as an alternative for sexual recombination operator to overcome ...
Ramin Halavati +3 more
openaire +1 more source
Recombination in the Genetic Algorithm (GA) is supposed to extract the component characteristics from two parents and reassemble them in different combinations hopefully producing an offspring that has the good characteristics of both parents. Symbiotic Combination is formerly introduced as an alternative for sexual recombination operator to overcome ...
Ramin Halavati +3 more
openaire +1 more source
Computers & Operations Research, 2019
With the goal of integrating drones in last-mile delivery, the Vehicle Routing Problem with Drones (VRPD) uses a fleet of vehicles, each of them equipped with a set of drones, for serving a set of customers with minimal makespan.
D. Schermer, M. Moeini, O. Wendt
semanticscholar +1 more source
With the goal of integrating drones in last-mile delivery, the Vehicle Routing Problem with Drones (VRPD) uses a fleet of vehicles, each of them equipped with a set of drones, for serving a set of customers with minimal makespan.
D. Schermer, M. Moeini, O. Wendt
semanticscholar +1 more source