Metaheuristic for Randomized Priority Search (Meta-RaPS): A Tutorial

Reinaldo J. Moraga ()
Additional contact information
Reinaldo J. Moraga: Northern Illinois University

Chapter Chapter 5 in Heuristics, Metaheuristics and Approximate Methods in Planning and Scheduling, 2016, pp 95-108 from Springer

Abstract: Abstract This chapter presents a metaheuristic named Meta-Heuristic for Randomized Priority Search (Meta-RaPS), which has been applied to different problems in literature. It mainly explains the overall framework by using an example so the reader can understand how the meta-heuristic works. We at the end identify some future opportunities for research.

Keywords: Priority rules; Metaheuristics; Meta-RaPS; Scheduling (search for similar items in EconPapers)
Date: 2016
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

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:spr:isochp:978-3-319-26024-2_5

Ordering information: This item can be ordered from
http://www.springer.com/9783319260242

DOI: 10.1007/978-3-319-26024-2_5

Access Statistics for this chapter

More chapters in International Series in Operations Research & Management Science from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().