A tabu search approach for solving a difficult forest harvesting machine location problem

Simple item page
dc.contributor.authorLegues, Andres Diaz
dc.contributor.authorFerland, Jacques A.
dc.contributor.authorRibeiro, Celso C.
dc.contributor.authorVera, Jorge R.
dc.contributor.authorWeintraub, Andres
dc.date.accessioned2024-01-10T13:46:13Z
dc.date.available2024-01-10T13:46:13Z
dc.date.issued2007
dc.description.abstractThis paper deals with two main problems in forest harvesting. The first is that of selecting the locations for the machinery to haul logs from the points where they are felled to the roadside. The second consists in designing the access road network connecting the existing road network with the points where machinery is installed. Their combination induces a very important and difficult problem to solve in forest harvesting. It can be formulated as a combination of two difficult optimization problems: a plant location problem and a fixed charge network flow problem. In this paper, we propose a solution approach based on tabu search. The proposed heuristic includes several enhancements of the basic tabu search framework. The main difficulty lies in evaluating neighboring solutions, which involves decisions related to location of machinery and to road network arcs. Hence, the neighborhood is more complex than in typical applications of metaheuristics. Minimum spanning tree algorithms and Steiner tree heuristics are used to deal with this problem. Numerical results indicate that the heuristic approach is very attractive and leads to better solutions than those provided by state-of-the-art integer programming codes in limited computation times, with solution times significantly smaller. The numerical results do not vary too much when typical parameters such as the tabu tenure are modified, except for the dimension of neighborhood. (c) 2005 Elsevier B.V. All rights reserved.
dc.fechaingreso.objetodigital2024-04-16
dc.format.extent18 páginas
dc.fuente.origenWOS
dc.identifier.doi10.1016/j.ejor.2005.03.071
dc.identifier.eissn1872-6860
dc.identifier.issn0377-2217
dc.identifier.urihttps://doi.org/10.1016/j.ejor.2005.03.071
dc.identifier.urihttps://repositorio.uc.cl/handle/11534/79134
dc.identifier.wosidWOS:000243794700014
dc.information.autorucIngeniería;Vera J;S/I;100240
dc.issue.numero3
dc.language.isoen
dc.nota.accesocontenido parcial
dc.pagina.final805
dc.pagina.inicio788
dc.publisherELSEVIER
dc.revistaEUROPEAN JOURNAL OF OPERATIONAL RESEARCH
dc.rightsacceso restringido
dc.subjecttabu search
dc.subjectGRASP
dc.subjectpath relinking
dc.subjectsimulated annealing
dc.subjectSteiner tree
dc.subjectforest harvesting
dc.subjectmachinery location
dc.subjectnetwork design
dc.subject.ods15 Life on Land
dc.subject.odspa15 Vida de ecosistemas terrestres
dc.titleA tabu search approach for solving a difficult forest harvesting machine location problem
dc.typeartículo
dc.volumen179
sipa.codpersvinculados100240
sipa.indexWOS
sipa.indexScopus
sipa.trazabilidadCarga SIPA;09-01-2024
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
A tabu search approach for solving a difficult forest harvesting machine location problem.pdf
Size:
2.91 KB
Format:
Adobe Portable Document Format
Description:
Download
Collections
Artículos de revistas