首页 | 本学科首页   官方微博 | 高级检索  
     检索      

基于分散决策的拥挤型网络流及其变分不等式
引用本文:张子刚,韦司滢,万希宁,邵树良.基于分散决策的拥挤型网络流及其变分不等式[J].华中科技大学学报(自然科学版),1993(5).
作者姓名:张子刚  韦司滢  万希宁  邵树良
作者单位:华中理工大学管理工程系 (张子刚,韦司滢,万希宁),华中理工大学管理工程系(邵树良)
基金项目:国家自然科学基金资助项目
摘    要:以交通网为背景讨论一种基于分散决策的拥挤型网络流,给出并证明了网络流的变分不等式,并进而讨论了选址于弧上的微变特性,得出了一个重要的结果.

关 键 词:网络流规划  网络选址  拥挤型网络  分散决策

The Flows in a Congested Network in View of the Decentralized Decision and Its Variational Inequalities
Zhang Zigang Wei Siying Wan Xining Shao Shuliang.The Flows in a Congested Network in View of the Decentralized Decision and Its Variational Inequalities[J].JOURNAL OF HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY.NATURE SCIENCE,1993(5).
Authors:Zhang Zigang Wei Siying Wan Xining Shao Shuliang
Institution:Zhang Zigang Wei Siying Wan Xining Shao Shuliang
Abstract:A congested network in which the cost of travelling an arc is dependent on the number of users is described. The flows in view of the decentralized decision and the variational inequalities about the flows in a congested network are investigated. A two-level optimization location model is discussed. In this model, users are concentrated at some nodes and the destination is located on the node or on the arc such that the user's total cost is a minimum. In almost all location problems, there is at least one node on which the location is optimal. However, it is shown that in a two-level model this is not true. Based on a perturbation analysis of locating on arcs, the necessary condition for an optimal location of the destination on arcs is given.
Keywords:network flow programming  location on a network  congested network  decentralized decision
本文献已被 CNKI 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号