检索结果-南通市图书馆

Efficient contraflow algorithms for quickest evacuation planning

Science China Mathematics 2018年第11期61卷 2079-2100页

作者： Urmila Pyakurel Hari Nandan nath tanka nath dhamala Central Department of Mathematics Tribhuvan University Department of Mathematics Bhaktapur Multiple Campus Tribhuvan University

The optimization models and algorithms with their implementations on flow over time problems have been an emerging field of research because of largely increasing human-created and natural disasters *** an optimal use of transportation network to shift affected people and normalize the disastrous situation as quickly and efficiently as possible,contraflow configuration is one of the highly applicable operations research(OR)*** increases the outbound road capacities by reversing the direction of arcs towards the safe destinations that not only minimize the congestion and increase the flow but also decrease the evacuation time *** this paper,we sketch the state of quickest flow solutions and solve the quickest contraflow problem with constant transit times on arcs proving that the problem can be solved in strongly polynomial time O(nm^2(long n)~2)where n and m are number of nodes and number of arcs,respectively in the *** contraflow solution has the same computational time bound as that of the best min-cost flow ***,we also introduce the contraflow approach with load dependent transit times on arcs and present an efficient algorithm to solve the quickest contraflow problem *** the claim,our computational experiments on Kathmandu road network and on randomly generated instances perform very well matching the theoretical *** a sufficiently large number of evacuees,about double flow can be shifted with the same evacuation time and about half time is sufficient to push the given flow value with contraflow reconfiguration.

关键词： evacuation planning contraflow flow over time quickest flow load dependent transit time

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

An Efficient Frontier for Sum Deviation JIT Sequencing Problem in Mixed-model Systems via Apportionment

引用

International Journal of Automation and computing 2012年第1期9卷 87-97页

作者： tanka nath dhamala Gyan Bahadur Thapa Hong-Nian Yu Central Department of Mathematics Institute of Science and Technology Tribhuvan University Nepal Department of Mathematics Pulchowk Campus Institute of Engineering Tribhuvan University Nepal Faculty of Computing Engineering and Technology Staffordshire University Stafford UK

In this paper, the sum deviation just-in-time （JIT） sequencing problem in mixed-model production systems is studied relating with the discrete apportionment problem together with their respective mathematical formulations. The assignment formulation for the first problem is briefly discussed followed by the existence of JIT cyclic sequences. Presenting the concise discussion on divisor methods for the discrete apportionment problem, we have proposed two mean-based divisor functions for this problem claiming that they are better than the existing divisors; hence, we found a better bound for the JIT sequencing problem. The linkage of both the problems is characterized in terms of similar type of objective functions. The problems are shown equivalent via suitable transformations and similar properties. The joint approaches for the two problems are discussed in terms of global and local deviations proposing equitably efficient solution.

关键词： Just-in-time sequencing sum deviation assignment apportionment divisor methods mean-based divisor methods

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

欢迎您,

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：