Case Studies on the Logical Structure of the Algorithms Tabu Search and Threshold Accepting for Generating Solutions in Searching and Solving the Bin-Packing Problem

The logical structure of approximation algorithms has been identified by the scientific community in four principal parts: tuning parameters, generating initial solutions, generating neighbor solutions, and stopping algorithm execution. A review of the literature specifically for the algorithms Thre...

Celý popis

Podrobná bibliografie

Hlavní autoři:	Vanesa Landero-Nájera, Joaquín Pérez-Ortega, Laura Cruz-Reyes, Claudia Guadalupe Gómez-Santillán, Nelva N. Almanza-Ortega, Carlos Rodríguez-Orta, Carlos Andrés Collazos-Morales
Médium:	Artigo
Jazyk:	Inglês
Vydáno:	MDPI AG 2026-04-01
Edice:	Computers
Témata:	metaheuristics algorithm analysis performance and logical structure of algorithms NP-hard problems
On-line přístup:	https://www.mdpi.com/2073-431X/15/5/274
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!