haku: @indexterm Algorithms / yhteensä: 403
viite: 8 / 403
| Tekijä: | Delorme, X. Gandibleux, X. Rodriguez, J. |
| Otsikko: | GRASP for set packing problems |
| Lehti: | European Journal of Operational Research
2004 : MAR, VOL. 153:3, p. 564-580 |
| Asiasana: | Combinatorial optimization Rail transport Algorithms |
| Kieli: | eng |
| Tiivistelmä: | The principles of the Greedy Randomized Adaptative Search Procedure (GRASP) metaheuristic are installed for the set packing problems. The authors investigated several construction phases, and evaluated improvements based on advanced strategies. These improvements include a self-tuning procedure, an intensification procedure and a procedure involving the diversification of the selection. Two sets of various numerical instances were used to perform the computational experiments. The analysis, based on the average performances observed, shows the impact of the suggested strategies, and indicates the configuration that produces the best results. |
SCIMA