.png){kind=icon}
返回
An enumeration algorithm for solving the fleet management problem in underground mines
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2004.11.016.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper presents an enumeration algorithm based on dynamic programming for optimally solving the fleet management problem in underground mines. This problem consists of routing and scheduling bidirectional vehicles on a haulage network composed of one-lane bidirectional road segments. The method takes into account the displacement modes of the vehicles, either forward or in reverse, and makes sure that these vehicles move forward when they arrive at their service point. The method has been developed for the underground mine context, but it can be extended to the industrial environment. (c) 2004 Published by Elsevier Ltd.
Keyword:
fleet management
dynamic programming
enumeration tree
bidirectional vehicles
bidirectional segments
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
暂无机构信息
引用论文
.png){kind=icon}
查看更多内容