A comparative study of heuristic algorithms for the multiple target access problem

References

• AkayAESessionsJApplying the decision support system, TRACER, to forest road designWest J Appl For200520184191
   Web of Science ®Google Scholar
• AndersonAENelsonJProjecting vector-based road networks with a shortest path algorithmCan J For Res2004341444145710.1139/x04-030
   Web of Science ®Google Scholar
• ArugaKSessionsJAkayAEApplication of an airborne laser scanner to forest road design with accurate earthwork volumesJ For Res20051011312310.1007/s10310-004-0116-9
   Web of Science ®Google Scholar
• BondyJMurtyUGraph theory (graduate texts in mathematics vol 244), volume 244 of graduate texts in mathematics2008New YorkSpringer
   Google Scholar
• Chen N (1983) New algorithms for Steiner tree on graphs. In: Proceedings of the IEEE International Symposium on Circuits and Systems, 1217–1219
   Google Scholar
• Chung W, Sessions J (2001) Designing a forest road network using heuristic optimization techniques. In: MWJ Wang and J McNeel (Eds.) Proceedings of the 24th Meeting of the Council of Forest Engineering Snowshoe, Wyo, 15–19 July
   Google Scholar
• ChungWSessionsJHeinimannHAn application of a heuristic network algorithm to cable logging layout designInt J For Eng2004151124
   Google Scholar
• ChungWStückelbergerJArugaKCundyTWForest road network design using a trade-off analysis between skidding and road construction costsCan J For Res20083843944810.1139/X07-170
   Web of Science ®Google Scholar
• ChurchRLMurrayATWeintraubALocational issues in forest managementLocat Sci1998613715310.1016/S0966-8349(98)00051-5
   Google Scholar
• DeanDJFinding optimal routes for networks of harvest site access roads using GIS-based techniquesCan J For Res199727112210.1139/x96-144
   Web of Science ®Google Scholar
• DuinCWVolgenantAReduction tests for the steiner problem in grapshNetworks19891954956710.1002/net.3230190506
   Web of Science ®Google Scholar
• EsbensenHComputing near-optimal solutions to the steiner problem in a graph using a genetic algorithmNetworks19952617318510.1002/net.3230260403
   Web of Science ®Google Scholar
• FeremansCLabbéMLaporteGGeneralized network design problemsEur J Oper Res200314811310.1016/S0377-2217(02)00404-6
   Web of Science ®Google Scholar
• GareyMRJohnsonDSComputers and intractability: a guide to the theory of Np-completeness1979San FranciscoFreeman
   Google Scholar
• Geospatial Information Authority of Japan (2012) Fundamental geospatial data [online]. http://www.gsi.go.jp/kiban/index.html. Accessed 20 Aug 2013
   Google Scholar
• GucinskiHFurnissMZiemerRBrookesMForest roads: a synthesis of scientific information2001PortlandTechnical report, USDA Forest Service
   Google Scholar
• Hwang FK, Richards DS, Winter P (1992) The Steiner tree problem (annals of discrete mathematics), North-Holland, Amsterdam. (ISBN 9780444890986)
   Google Scholar
• Koch T, Martin A, Voß S (2013) SteinLib: an updated library on Steiner tree problems in graphs, tech. Rep. ZIB-Report 00–37, Konrad-Zuse-Zentrum für Informationstechnik Berlin, Takustr. 7, Berlin, 2000. http://elib.zib.de/steinlib. Accessed 20 Aug
   Google Scholar
• KouLMarkowskyGBermanLA fast algorithm for Steiner treesActa Inform19811514114510.1007/BF00288961
   Web of Science ®Google Scholar
• KruskalJBOn the shortest spanning subtree of a graph and the traveling salesman problemProc Am Math Soc19567485010.1090/S0002-9939-1956-0078686-7
   Google Scholar
• LeguesADFerlandJARibeiroCCVeraJRWeintraubAA tabu search approach for solving a difficult forest harvesting machine location problemEur J Oper Res200717978880510.1016/j.ejor.2005.03.071
   Web of Science ®Google Scholar
• LiuKSessionsJPreliminary planning of road systems using digital terrain modelsInt J For Eng199342732
   Google Scholar
• MeignanDFrayretJ-MPesantGBlouinMA heuristic approach to automated forest road locationCan J For Res2012422130214110.1139/x2012-140
   Web of Science ®Google Scholar
• MurrayARoute planning for harvest site accessCan J For Res1998281084108710.1139/x98-122
   Web of Science ®Google Scholar
• PicardNGazullLFreyconVFinding optimal routes for harvesting tree accessInt J For Eng2006173549
   Google Scholar
• Polzin T (2003) Algorithms for the Steiner problem in networks. PhD thesis, Universität des Saarlandes
   Google Scholar
• PrimRCShortest connection networks and some generalizationsBell Syst Tech J1957361389140110.1002/j.1538-7305.1957.tb01515.x
   Google Scholar
• Rayward-SmithVThe computation of nearly minimal Steiner trees in graphsInternat J Math Ed Sci Tech198314152310.1080/0020739830140103
   Google Scholar
• Rayward-SmithVJClareAOn finding steiner verticesNetworks19861628329410.1002/net.3230160305
   Web of Science ®Google Scholar
• RicheyMBParkerRGOn multiple steiner subgraph problemsNetworks19861642343810.1002/net.3230160408
   Web of Science ®Google Scholar
• Stückelberger J, Heinimann H, Chung W (2004) Improving the effectiveness of automatic grid cell based road route location procedures. In: Clark M (Ed) Proceedings of the 12th International Mountain Logging Conference, pp 13–16
   Google Scholar
• StückelbergerJHeinimannHBurletEModeling spatial variability in the life-cycle costs of low-volume forest roadsEur J For Res200612537739010.1007/s10342-006-0123-9
   Web of Science ®Google Scholar
• StückelbergerJHeinimannHRChungWImproved road network design models with the consideration of various link patterns and road design elementsCan J For Res2007372281229810.1139/X07-036
   Web of Science ®Google Scholar
• TakahashiHMatsuyamaAAn approximate solution for the Steiner problem in graphsMath Jap198024573577
   Google Scholar
• TalbiE-GMetaheuristics: from design to implementation20091stNew JerseyWiley
   Google Scholar
• TanJLocating forest roads by a spatial and heuristic procedure using microcomputersInt J For Eng19991091100
   Google Scholar
• The Mathworks (2013) Parallel Computing Toolbox. http://www.mathworks.com/products/parallel-computing/. Accessed 20 Aug 2013
   Google Scholar
• VoßSSteiner's problem in graphs: heuristic methodsDiscrete Appl Math199240457210.1016/0166-218X(92)90021-2
   Web of Science ®Google Scholar
• VoßSResendeMGCPardalosPMSteiner tree problems in telecommunicationsHandbook of optimization in telecommunications2006New YorkSpringer459492
   Google Scholar
• Wang S (1985) A multiple source algorithm for suboptimum Steiner trees in graphs. In: Noltemeier H (Ed) Proceedings of International Workshop on Graphtheoretic Concepts in Computer Science, Trauner, Würzburg, pp 387–396
   Google Scholar
• WeintraubAMurrayATReview of combinatorial problems induced by spatial forest harvesting planningDiscrete Appl Math200615486787910.1016/j.dam.2005.05.025
   Web of Science ®Google Scholar
• WinterPSmithJMPath-distance heuristics for the Steiner problem in undirected networksAlgorithmica1992730932710.1007/BF01758765
   Web of Science ®Google Scholar
• WongRA dual ascent approach for steiner tree problems on a directed graphMath Program19842827128710.1007/BF02612335
   Web of Science ®Google Scholar
• WrightPHHighway engineering19966thNew YorkWiley
   Google Scholar