Results 121 to 130 of about 4,843,664 (223)

A modified generative adversarial networks with Yolov5 for automated forest health diagnosis from aerial imagery and Tabu search algorithm. [PDF]

open access: yesSci Rep
Jayagopal P   +6 more
europepmc   +1 more source

Implementing Tabu Search to Exploit Sparsity in ATSP Instances [PDF]

open access: yes
Real life traveling salesman problem (TSP) instances are often large,sparse, and asymmetric. Conventional tabu search implementations for the TSP that have been reported in the literature, almost always deals with small, dense and symmetric instances. In
Sumanta Basu   +2 more
core  

A Novel Binary Hunger Games Search Algorithm with Data-Driven Repair for the Set Covering Problem. [PDF]

open access: yesBiomimetics (Basel)
Crawford B   +7 more
europepmc   +1 more source

Tabu Search for the Single Row Facility Layout Problem in FMS using a 3-opt Neighborhood [PDF]

open access: yes
Since material handling agents in a FMS are most efficient when moving in straight lines, a common layout of machines in a FMS is a single row layout. This allows a floor designer to model the problem of generating an optimal machine layout in a FMS as a
Kothari, Ravi, Ghosh, Diptesh
core  

Adaptive approach heuristics for the generalized assignment problem [PDF]

open access: yes
The Generalized Assignment Problem consists in assigning a set of tasks to a set of agents with minimum cost. Each agent has a limited amount of a single resource and each task must be assigned to one and only one agent, requiring a certain amount of the
Helena Ramalhinho-Lourenço   +1 more
core  

A tabu search procedure for generating robust project baseline schedules under stochastic resource availabilities. [PDF]

open access: yes
The majority of research efforts in project scheduling assume a static and deterministic environment with complete information. In practice, however, these assumptions will hardly, if ever, be satisfied.
Lambrechts, Olivier   +2 more
core  

A tabu search heuristic based on k-diamonds for the weighted feedback vertex set problem

open access: yes
Given an undirected and vertex weighted graph G = (V,E,w), the Weighted Feedback Vertex Problem (WFVP) consists of finding a subset F ⊆ V of vertices of minimum weight such that each cycle in G contains at least one vertex in F.
Gentili, Monica   +3 more
core   +1 more source

Home - About - Disclaimer - Privacy