Enhancing and extending the classical GRASP framework with biased randomisation and simulation

Daniele Ferone, Aljoscha Gruler, Paola Festa and Angel Juan

Journal of the Operational Research Society, 2019, vol. 70, issue 8, 1362-1375

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.

Date: 2019
References: Add references at CitEc
Citations: View citations in EconPapers (7)

Downloads: (external link)
http://hdl.handle.net/10.1080/01605682.2018.1494527 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:taf:tjorxx:v:70:y:2019:i:8:p:1362-1375

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/tjor20

DOI: 10.1080/01605682.2018.1494527

Access Statistics for this article

Journal of the Operational Research Society is currently edited by Tom Archibald

More articles in Journal of the Operational Research Society from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().