S
Saïd Hanafi
Researcher at Centre national de la recherche scientifique
Publications - 146
Citations - 3238
Saïd Hanafi is an academic researcher from Centre national de la recherche scientifique. The author has contributed to research in topics: Knapsack problem & Heuristics. The author has an hindex of 28, co-authored 141 publications receiving 2743 citations. Previous affiliations of Saïd Hanafi include University of Valenciennes and Hainaut-Cambresis & university of lille.
Papers
More filters
Journal ArticleDOI
Variable neighborhood search: basics and variants
TL;DR: In this article, the authors present some of VNS basic schemes as well as several VNS variants deduced from these basic schemes, including parallel implementations and hybrids with other metaheuristics.
Journal ArticleDOI
An efficient tabu search approach for the 0–1 multidimensional knapsack problem
Saïd Hanafi,Arnaud Fréville +1 more
TL;DR: Results confirm the efficiency of the tunneling concept coupled with surrogate information when resource constraints are present and obtains solutions whose quality is at least as good as the best solutions obtained by previous methods, especially with large scale instances.
Journal ArticleDOI
Variable neighborhood search for location routing
TL;DR: This paper proposes various neighborhood search heuristics (VNS) for solving the location routing problem with multiple capacitated depots and one uncapacitated vehicle per depot, and proposes five neighborhood structures which are either of routing or location type.
Journal ArticleDOI
Genetic algorithm with iterated local search for solving a location-routing problem
TL;DR: Numerical experiments show that the hybrid algorithm improves, for all instances, the best known solutions previously obtained by the tabu search heuristic.
Journal ArticleDOI
Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model
TL;DR: In this article, the authors proposed an iterative exact algorithm for vehicle routing with time windows and multiple routes, which considers that a given vehicle can be assigned to more than one route per planning period.