.png){kind=icon}
Return
GRASP for set packing problems
.png){kind=icon}
OA
AI
DOI：10.1016/S0377-2217(03)00263-7.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The principles of the Greedy Randomized Adaptative Search Procedure (GRASP) metaheuristic are instantiated for the set packing problem. We investigated several construction phases, and evaluated improvements based on advanced strategies. These improvements include a self-tuning procedure (using reactive GRASP), an intensification procedure (using path relinking) and a procedure involving the diversification of the selection (using a learning process). Two sets of various numerical instances were used to perform the computational experiments. The first set contains randomly generated instances, while the second includes instances relating to real problems in railway planning. No metaheuristic has previously been applied to this combinatorial problem. Consequently, we have discussed GRASP's performances both in relation to lower/upper bounds and to the results obtained with Cplex when such results are available. Our analysis, based on the average performances observed, shows the impact of the suggested strategies, and indicates the configuration that produces the best results. (C) 2003 Elsevier B.V. All rights reserved.
Keywords:
combinatorial optimization
set packing problem
metaheuristic
reactive GRASP
path relinking
railway planning problem
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
No organization information available
Cited Papers
Reduced white matter microstructural integrity correlates with cognitive deficits in minimal hepatic encephalopathy.png)
Gut
GutIF0
PREAI
ShareSaveShareSaveShareSave
View more