A tabu search approach for solving a difficult forest harvesting machine location problem
Author
Abstract
Suggested Citation
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Jeffcoat, David E. & Bulfin, Robert L., 1993. "Simulated annealing for resource-constrained scheduling," European Journal of Operational Research, Elsevier, vol. 70(1), pages 43-51, October.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Antonio Alonso-Ayuso & Laureano Escudero & Monique Guignard & Martín Quinteros & Andres Weintraub, 2011. "Forestry management under uncertainty," Annals of Operations Research, Springer, vol. 190(1), pages 17-39, October.
- Borges, Paulo & Eid, Tron & Bergseng, Even, 2014. "Applying simulated annealing using different methods for the neighborhood search in forest planning problems," European Journal of Operational Research, Elsevier, vol. 233(3), pages 700-710.
- Marta Mesquita & Susete Marques & Marlene Marques & Marco Marto & Miguel Constantino & José G. Borges, 2022. "An optimization approach to design forest road networks and plan timber transportation," Operational Research, Springer, vol. 22(3), pages 2973-3001, July.
- Leo Bont & Hans Heinimann & Richard Church, 2015. "Concurrent optimization of harvesting and road network layouts under steep terrain," Annals of Operations Research, Springer, vol. 232(1), pages 41-64, September.
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.- He, Zesheng & Yang, Taeyong & Tiger, Andy, 1996. "An exchange heuristic imbedded with simulated annealing for due-dates job-shop scheduling," European Journal of Operational Research, Elsevier, vol. 91(1), pages 99-117, May.
- C.K.Y. Lin & Haley, K. B. & Sparks, C., 1995. "A comparative study of both standard and adaptive versions of threshold accepting and simulated annealing algorithms in three scheduling problems," European Journal of Operational Research, Elsevier, vol. 83(2), pages 330-346, June.
- Schirmer, Andreas, 1995. "A guide to complexity theory in operations research," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 381, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
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:eee:ejores:v:179:y:2007:i:3:p:788-805. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.