吉普-加油问题

数学物理学报 ›› 2000, Vol. 20 ›› Issue (1): 85-94.

吉普-加油问题

中国科学院武汉物理与数学研究所武汉 430071 北京师范大学系统科学系北京 100875 | 中国科学院武汉物理与数学研究所武汉 430071

出版日期:2000-01-07 发布日期:2000-01-07

The Jeep-Fuel Station Problems

|

|
(Whuhan Institute of Physics and Mathematics, The Chinese Academy of Sciences, Wuhan 430071)

(Department of Systems Sciences, Beijing Normal University, Beijing 100875)
(Whuhan Institute of Physics and Mathematics, The Chinese Academy of Sciences, Wuhan 430071)

Online:2000-01-07 Published:2000-01-07

摘要/Abstract

摘要：

利用最优序列方法研究了吉普-加油站问题，确定了单向行驶吉普-加油站问题和往返行驶吉普加油站问题的最优序列.

关键词: 吉普问题, 吉普加油站问题, 最优序列, 动态规划原理

Abstract:

The Jeep-Fuel Station problems are studied by the Optimal Sequence method. The Optimal Sequences of the oneway trip JeepFuel Station problem and the round trip Jeep-Fuel station problem are determined.

Key words: Ｊｅｅｐｓｐｒｏｂｌｅｍ, ＪｅｅｐＦｕｅｌｓｔａｔｉｏｎｐｒｏｂｌｅｍ, Ｏｐｔｉｍａｌｓｅｑｕｅｎｃｅ, Ｄｙｎａｍｉｃｐｒｏｇｒａｍｐｒｉｎｃｉｐｌｅ

中图分类号:

范文涛丁义明. 吉普-加油问题[J]. 数学物理学报, 2000, 20(1): 85-94.

Fan Wentao Ding Yiming. The Jeep-Fuel Station Problems[J]. Acta mathematica scientia,Series A, 2000, 20(1): 85-94.

吉普-加油问题

The Jeep-Fuel Station Problems

PDF (PC)

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 1

Metrics

本文评价

推荐阅读 10