Abstract Greedy Randomised Adaptive Search Procedure (GRASP) is one of the best-known metaheuristics to solve complex combinatorial optimisation problems (COPs). This paper proposes two extensions of the typical GRASP framework. On the one hand, applying biased randomisation techniques during the solution construction phase enhances the efficiency of the GRASP solving approach compared to the traditional use of a restricted candidate list. On the other hand, the inclusion of simulation at certain points of the GRASP framework constitutes an efficient simulation–optimisation approach that allows to solve stochastic versions of COPs. To show the effectiveness of these GRASP improvements and extensions, tests are run with both deterministic and stochastic problem settings related to flow shop scheduling, vehicle routing, and facility location.
Enhancing and extending the classical GRASP framework with biased randomisation and simulation
D. Ferone,Aljoscha Gruler,P. Festa,A. Juan
Published 2018 in Journal of the Operational Research Society
ABSTRACT
PUBLICATION RECORD
- Publication year
2018
- Venue
Journal of the Operational Research Society
- Publication date
2018-10-17
- Fields of study
Computer Science
- Identifiers
- External record
- Source metadata
Semantic Scholar
CITATION MAP
EXTRACTION MAP
CLAIMS
- No claims are published for this paper.
CONCEPTS
- No concepts are published for this paper.
REFERENCES
Showing 1-63 of 63 references · Page 1 of 1
CITED BY
Showing 1-66 of 66 citing papers · Page 1 of 1