首页> 外文学位 >Optimization of cable logging layout using a heuristic algorithm for network programming.
【24h】

Optimization of cable logging layout using a heuristic algorithm for network programming.

机译:使用启发式算法对网络编程进行电缆记录布局的优化。

获取原文
获取原文并翻译 | 示例

摘要

This study develops a methodology with the purpose of assisting the planners in designing cable logging unit layout. The methodology combines a cable logging operation planning problem with a road network planning problem and optimizes them simultaneously. It incorporates modern computer software languages, Geographic Information System (GIS) technology, and optimization techniques that have become available during the last two decades. The methodology includes logging feasibility and cost analysis to evaluate alternative cable roads and yarding equipment. Once the feasible cable road alternatives are identified, the methodology formulates two cost minimization network problems. The networks represent variable and fixed costs associated with yarding and truck transportation activities to move logs from the stump to the mill. The methodology uses a heuristic network algorithm as an optimization technique to solve the network problems. One of the two cost minimization network problems is for cable logging operation planning and the other is for truck transportation planning. Each of the network problems is solved separately using the heuristic network algorithm while being connected to the other by a feedback mechanism.; The methodology is implemented in a computerized model that can be used as a decision support system. The model is applied to an actual harvest area of 93 ha. A total of 40 candidate landing locations with 2,880 cable roads from 2 yarding equipment alternatives were evaluated. The model found 1,719 feasible cable road alternatives by conducting the logging feasibility and cost analysis. Two cost minimization network problems were developed. A total of 141,139 links and 1,926 timber parcels were developed in the network problem for cable logging paths. In the network for solving road location problem, a total of 95,904 links were developed to connect 13,522 grid cells included in the planning area. After 47.2 hours for 10 repetitions on Pentium III 1GHz speed desktop computer, the heuristic network algorithm solved these network problems and selected a total of 19 landings and 155 cable roads to harvest 8,064 m3 of logs from 1,926 timber parcels over the planning area. A total of 2.85 kilometers of new access roads were proposed as a part of the solution for this application. Overall yarding and road costs for timber harvest in the planning area was {dollar}416,675 ({dollar}51.67/m3).* (Abstract shortened by UMI.); *This dissertation is a multimedia document (contains text and other applications not available in printed format). The CD requires the following system requirements: Windows 95 or higher; Microsoft Paint.
机译:本研究开发了一种方法,旨在协助规划人员设计电缆测井仪的布局。该方法将电缆测井运营规划问题与道路网络规划问题结合在一起,并同时对其进行优化。它结合了过去二十年来可用的现代计算机软件语言,地理信息系统(GIS)技术和优化技术。该方法包括测井可行性和成本分析,以评估替代的电缆路和堆场设备。一旦确定了可行的电缆路替代方案,该方法就可以解决两个成本最小化网络问题。该网络代表与将原木从树桩转移到工厂的堆放和卡车运输活动相关的可变和固定成本。该方法使用启发式网络算法作为优化技术来解决网络问题。成本最小化网络的两个问题之一是电缆测井作业计划,另一个是卡车运输计划。使用启发式网络算法分别解决每个网络问题,同时通过反馈机制将它们连接在一起。该方法在可以用作决策支持系统的计算机化模型中实现。该模型适用于93公顷的实际收获面积。总共评估了40个候选着陆点,其中包括2个替代装备的2880条电缆路。该模型通过进行测井可行性和成本分析,找到了1,719个可行的电缆路替代方案。开发了两个成本最小化网络问题。针对电缆测井路径的网络问题,共开发了141,139条链接和1,926个木材包裹。在用于解决道路位置问题的网络中,总共开发了95,904条链接以连接规划区域中包括的13,522个网格单元。在奔腾III 1GHz速度台式计算机上进行了47.2小时的10次重复之后,启发式网络算法解决了这些网络问题,总共选择了19个着陆点和155条电缆路,以从1,926块木材中收获8064 m 3 在规划区域上的包裹。提出了总共2.85公里的新通道,作为此应用程序解决方案的一部分。该规划区域内木材采伐的总码数和道路成本为{416,675美元({51,67 / m 3 )}。*(由UMI缩短); *本论文是多媒体文件(包含文本和其他应用程序,这些文件无法以印刷格式提供)。 CD需要满足以下系统要求:Windows 95或更高版本; Windows 95或更高版本; Windows 95或更高版本。 Microsoft画图。

著录项

  • 作者

    Chung, Woodam.;

  • 作者单位

    Oregon State University.;

  • 授予单位 Oregon State University.;
  • 学科 Agriculture Forestry and Wildlife.
  • 学位 Ph.D.
  • 年度 2003
  • 页码 206 p.
  • 总页数 206
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类 森林生物学;
  • 关键词

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号