IDEAS home Printed from https://ideas.repec.org/a/spr/joheur/v25y2019i4d10.1007_s10732-018-9368-y.html
   My bibliography  Save this article

Intensification, diversification, and learning via relaxation adaptive memory programming: a case study on resource constrained project scheduling

Author

Listed:
  • R. Christopher L. Riley

    (Delta State University)

  • Cesar Rego

    (University of Mississippi)

Abstract

Learning, clearly, can only occur in the presence of memory. Moreover, intensification and diversification strategies are widely recognized for their importance in the metaheuristics literature as the building blocks for adaptive memory programming (AMP). It is safe to say that any metaheuristic approach that isn’t blindly mechanistic uses some sort of adaptive memory to guide the search beyond local optimality, during which intensification and diversification always take place explicitly or implicitly. From this perspective, adaptive memory lies in the heart of what may be generally called the intensification, diversification, and learning (IDL) triangle. This paper focuses on the importance of solution landscape information in the design of AMP structures based on the IDL triangle. More specifically, we argue that a metaheuristic algorithm can only perform as good as the quality of information it is provided about the search space. To illustrate, we consider the computationally intractable Resource Constrained Project Scheduling Problem as a benchmark and take the approach of adding Lagrangian dual information to a rudimentary tabu search approach and integrate the two approaches via the Relaxation Adaptive Memory Programming (RAMP) framework. We show that while our simple tabu search component alone is not competitive with the best performing tabu search algorithms of the literature, when dual information is added to the procedure the resulting integrated RAMP algorithm outperforms all of them, thus supporting our premise.

Suggested Citation

  • R. Christopher L. Riley & Cesar Rego, 2019. "Intensification, diversification, and learning via relaxation adaptive memory programming: a case study on resource constrained project scheduling," Journal of Heuristics, Springer, vol. 25(4), pages 793-807, October.
  • Handle: RePEc:spr:joheur:v:25:y:2019:i:4:d:10.1007_s10732-018-9368-y
    DOI: 10.1007/s10732-018-9368-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10732-018-9368-y
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10732-018-9368-y?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Kolisch, R. & Padman, R., 2001. "An integrated survey of deterministic project scheduling," Omega, Elsevier, vol. 29(3), pages 249-272, June.
    2. Hartmann, Sonke & Kolisch, Rainer, 2000. "Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 127(2), pages 394-407, December.
    3. Christofides, Nicos & Alvarez-Valdes, R. & Tamarit, J. M., 1987. "Project scheduling with resource constraints: A branch and bound approach," European Journal of Operational Research, Elsevier, vol. 29(3), pages 262-273, June.
    4. Valls, Vicente & Ballestin, Francisco & Quintanilla, Sacramento, 2005. "Justification and RCPSP: A technique that pays," European Journal of Operational Research, Elsevier, vol. 165(2), pages 375-386, September.
    5. Kolisch, Rainer & Hartmann, Sönke, 1998. "Heuristic algorithms for solving the resource-constrained project scheduling problem: Classification and computational analysis," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 469, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    6. Carlton, William B. & Barnes, J. Wesley, 1996. "A note on hashing functions and tabu search algorithms," European Journal of Operational Research, Elsevier, vol. 95(1), pages 237-239, November.
    7. Rolf H. Möhring & Andreas S. Schulz & Frederik Stork & Marc Uetz, 2003. "Solving Project Scheduling Problems by Minimum Cut Computations," Management Science, INFORMS, vol. 49(3), pages 330-350, March.
    8. Cesar Rego & Frank Mathew & Fred Glover, 2010. "RAMP for the capacitated minimum spanning tree problem," Annals of Operations Research, Springer, vol. 181(1), pages 661-681, December.
    9. Hartmann, Sönke & Kolisch, R., 2000. "Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 11180, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    10. Hartmann, Sönke & Briskorn, Dirk, 2010. "A survey of variants and extensions of the resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 207(1), pages 1-14, November.
    11. Brucker, Peter & Drexl, Andreas & Mohring, Rolf & Neumann, Klaus & Pesch, Erwin, 1999. "Resource-constrained project scheduling: Notation, classification, models, and methods," European Journal of Operational Research, Elsevier, vol. 112(1), pages 3-41, January.
    12. Artigues, Christian & Michelon, Philippe & Reusser, Stephane, 2003. "Insertion techniques for static and dynamic resource-constrained project scheduling," European Journal of Operational Research, Elsevier, vol. 149(2), pages 249-267, September.
    13. Taillard, Eric D. & Waelti, Philippe & Zuber, Jacques, 2008. "Few statistical tests for proportions comparison," European Journal of Operational Research, Elsevier, vol. 185(3), pages 1336-1350, March.
    14. Kolisch, Rainer & Schwindt, Christoph & Sprecher, Arno, 1999. "Benchmark instances for project scheduling problems," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 9500, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    15. Harvey J. Greenberg & William P. Pierskalla, 1970. "Surrogate Mathematical Programming," Operations Research, INFORMS, vol. 18(5), pages 924-939, October.
    16. Kolisch, Rainer & Hartmann, Sonke, 2006. "Experimental investigation of heuristics for resource-constrained project scheduling: An update," European Journal of Operational Research, Elsevier, vol. 174(1), pages 23-37, October.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Valls, Vicente & Ballestin, Francisco & Quintanilla, Sacramento, 2008. "A hybrid genetic algorithm for the resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 185(2), pages 495-508, March.
    2. Weglarz, Jan & Józefowska, Joanna & Mika, Marek & Waligóra, Grzegorz, 2011. "Project scheduling with finite or infinite number of activity processing modes - A survey," European Journal of Operational Research, Elsevier, vol. 208(3), pages 177-205, February.
    3. Tseng, Lin-Yu & Chen, Shih-Chieh, 2006. "A hybrid metaheuristic for the resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 175(2), pages 707-721, December.
    4. F. Perez & T. Gomez, 2016. "Multiobjective project portfolio selection with fuzzy constraints," Annals of Operations Research, Springer, vol. 245(1), pages 7-29, October.
    5. Hartmann, Sönke & Briskorn, Dirk, 2010. "A survey of variants and extensions of the resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 207(1), pages 1-14, November.
    6. Guo, Weikang & Vanhoucke, Mario & Coelho, José, 2023. "A prediction model for ranking branch-and-bound procedures for the resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 306(2), pages 579-595.
    7. Hartmann, Sönke & Briskorn, Dirk, 2008. "A survey of variants and extensions of the resource-constrained project scheduling problem," Working Paper Series 02/2008, Hamburg School of Business Administration (HSBA).
    8. Hartmann, Sönke & Briskorn, Dirk, 2022. "An updated survey of variants and extensions of the resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 297(1), pages 1-14.
    9. Servranckx, Tom & Vanhoucke, Mario, 2019. "A tabu search procedure for the resource-constrained project scheduling problem with alternative subgraphs," European Journal of Operational Research, Elsevier, vol. 273(3), pages 841-860.
    10. Alexander Tesch, 2020. "A polyhedral study of event-based models for the resource-constrained project scheduling problem," Journal of Scheduling, Springer, vol. 23(2), pages 233-251, April.
    11. Moumene, Khaled & Ferland, Jacques A., 2009. "Activity list representation for a generalization of the resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 199(1), pages 46-54, November.
    12. Kolisch, Rainer & Hartmann, Sonke, 2006. "Experimental investigation of heuristics for resource-constrained project scheduling: An update," European Journal of Operational Research, Elsevier, vol. 174(1), pages 23-37, October.
    13. André Schnabel & Carolin Kellenbrink & Stefan Helber, 2018. "Profit-oriented scheduling of resource-constrained projects with flexible capacity constraints," Business Research, Springer;German Academic Association for Business Research, vol. 11(2), pages 329-356, September.
    14. Song, Jie & Martens, Annelies & Vanhoucke, Mario, 2021. "Using Schedule Risk Analysis with resource constraints for project control," European Journal of Operational Research, Elsevier, vol. 288(3), pages 736-752.
    15. Chen, Jiaqiong & Askin, Ronald G., 2009. "Project selection, scheduling and resource allocation with time dependent returns," European Journal of Operational Research, Elsevier, vol. 193(1), pages 23-34, February.
    16. Dieter Debels & Mario Vanhoucke, 2007. "A Decomposition-Based Genetic Algorithm for the Resource-Constrained Project-Scheduling Problem," Operations Research, INFORMS, vol. 55(3), pages 457-469, June.
    17. Cédric Verbeeck & Vincent Peteghem & Mario Vanhoucke & Pieter Vansteenwegen & El-Houssaine Aghezzaf, 2017. "A metaheuristic solution approach for the time-constrained project scheduling problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(2), pages 353-371, March.
    18. Bouleimen, K. & Lecocq, H., 2003. "A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version," European Journal of Operational Research, Elsevier, vol. 149(2), pages 268-281, September.
    19. Van Peteghem, Vincent & Vanhoucke, Mario, 2014. "An experimental investigation of metaheuristics for the multi-mode resource-constrained project scheduling problem on new dataset instances," European Journal of Operational Research, Elsevier, vol. 235(1), pages 62-72.
    20. Lova, Antonio & Tormos, Pilar & Cervantes, Mariamar & Barber, Federico, 2009. "An efficient hybrid genetic algorithm for scheduling projects with resource constraints and multiple execution modes," International Journal of Production Economics, Elsevier, vol. 117(2), pages 302-316, February.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:joheur:v:25:y:2019:i:4:d:10.1007_s10732-018-9368-y. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.