利用网络2000进行林产品运输规划

Hande Egemen Suslu
{"title":"利用网络2000进行林产品运输规划","authors":"Hande Egemen Suslu","doi":"10.33904/ejfe.427547","DOIUrl":null,"url":null,"abstract":"The construction and maintenance of forest roads are the activities that require the highest financial investment in the extraction of forest products. In addition, the cost of transporting forest products from landing to storage area can be significant proportion of the total extraction cost. For this reason, forest engineers are obliged not only to reduce the cost of road construction and maintenance, but also to prepare the most appropriate transportation plan to minimize total costs. Computer aided models can be used to solve complex transportation problems that require the evaluation of many alternative routes and selection of the alternative with least cost. In this study, the Network 2000 program based on the shortest path algorithm was used in transportation planning of forest product, and then the solution capacity of the method was examined in a sample application. As a study area, two Forest Enterprise Chiefs (FECs) of Pasalar and Sarnic were selected from Mustafakemalpasa Forest Enterprise Directorate (FED) in the border of Bursa Forest Regional Directorate. The transportation cost of the road sections, forest product types, location of landing and forest depots were entered into the Network 2000 program after being digitized with ArcGIS 10.2 software. In the solution process, firstly, the route that minimized the transportation cost was investigated, and then, the route with the maximum net profit was determined by taking the sale prices of forest products into consideration. According to results, the transportation cost mostly depends on the transportation time, hourly truck cost and load capacity of the truck.","PeriodicalId":36173,"journal":{"name":"European Journal of Forest Engineering","volume":" ","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2018-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Using Network 2000 Program for Transportation Planning of Forest Products\",\"authors\":\"Hande Egemen Suslu\",\"doi\":\"10.33904/ejfe.427547\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The construction and maintenance of forest roads are the activities that require the highest financial investment in the extraction of forest products. In addition, the cost of transporting forest products from landing to storage area can be significant proportion of the total extraction cost. For this reason, forest engineers are obliged not only to reduce the cost of road construction and maintenance, but also to prepare the most appropriate transportation plan to minimize total costs. Computer aided models can be used to solve complex transportation problems that require the evaluation of many alternative routes and selection of the alternative with least cost. In this study, the Network 2000 program based on the shortest path algorithm was used in transportation planning of forest product, and then the solution capacity of the method was examined in a sample application. As a study area, two Forest Enterprise Chiefs (FECs) of Pasalar and Sarnic were selected from Mustafakemalpasa Forest Enterprise Directorate (FED) in the border of Bursa Forest Regional Directorate. The transportation cost of the road sections, forest product types, location of landing and forest depots were entered into the Network 2000 program after being digitized with ArcGIS 10.2 software. In the solution process, firstly, the route that minimized the transportation cost was investigated, and then, the route with the maximum net profit was determined by taking the sale prices of forest products into consideration. According to results, the transportation cost mostly depends on the transportation time, hourly truck cost and load capacity of the truck.\",\"PeriodicalId\":36173,\"journal\":{\"name\":\"European Journal of Forest Engineering\",\"volume\":\" \",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-06-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"European Journal of Forest Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.33904/ejfe.427547\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"Engineering\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"European Journal of Forest Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.33904/ejfe.427547","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Engineering","Score":null,"Total":0}
引用次数: 0

摘要

森林道路的建设和维护是在森林产品开采中需要最高财政投资的活动。此外,将林产品从着陆点运送到储存区的成本可能占总开采成本的很大比例。因此,森林工程师不仅有义务降低道路建设和维护的成本,而且还要制定最合适的运输计划,以尽量减少总成本。计算机辅助模型可以用于解决复杂的运输问题,这些问题需要对许多备选路线进行评估并选择成本最低的备选路线。本文将基于最短路径算法的Network 2000程序应用于林产品运输规划中,并通过实例验证了该方法的求解能力。作为研究区域,从布尔萨森林区域局边界的穆斯塔法克马尔帕萨森林企业局(FED)中选出了帕萨拉和萨尼奇的两名森林企业负责人。通过ArcGIS 10.2软件数字化后,将路段运输成本、林产品种类、登陆点位置、林场仓库等信息输入到Network 2000程序中。在求解过程中,首先考察运输成本最小的路线,然后考虑林产品销售价格,确定净利润最大的路线。结果表明,运输成本主要取决于运输时间、每小时卡车成本和卡车的载重量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Using Network 2000 Program for Transportation Planning of Forest Products
The construction and maintenance of forest roads are the activities that require the highest financial investment in the extraction of forest products. In addition, the cost of transporting forest products from landing to storage area can be significant proportion of the total extraction cost. For this reason, forest engineers are obliged not only to reduce the cost of road construction and maintenance, but also to prepare the most appropriate transportation plan to minimize total costs. Computer aided models can be used to solve complex transportation problems that require the evaluation of many alternative routes and selection of the alternative with least cost. In this study, the Network 2000 program based on the shortest path algorithm was used in transportation planning of forest product, and then the solution capacity of the method was examined in a sample application. As a study area, two Forest Enterprise Chiefs (FECs) of Pasalar and Sarnic were selected from Mustafakemalpasa Forest Enterprise Directorate (FED) in the border of Bursa Forest Regional Directorate. The transportation cost of the road sections, forest product types, location of landing and forest depots were entered into the Network 2000 program after being digitized with ArcGIS 10.2 software. In the solution process, firstly, the route that minimized the transportation cost was investigated, and then, the route with the maximum net profit was determined by taking the sale prices of forest products into consideration. According to results, the transportation cost mostly depends on the transportation time, hourly truck cost and load capacity of the truck.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
European Journal of Forest Engineering
European Journal of Forest Engineering Agricultural and Biological Sciences-Forestry
CiteScore
1.30
自引率
0.00%
发文量
6
期刊最新文献
Developing a new harvester head for tree felling Heat-Resilient Workforce: Unveiling the Relationships Between Heat-related Knowledge, Risk Perception, and Precautionary Behavior in Indonesian Pine Forest Workers An Internet of Things Platform for Forest Protection Potential of Geospatial technologies in Mechanized Timber harvesting planning Productivity Analysis of Mid-Size Cable Yarding Operation based on UAV-captured Video Sequences
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1