满意度优化运输问题

运筹学学报 ›› 2014, Vol. 18 ›› Issue (4): 36-44.

满意度优化运输问题

胡勋锋¹, 李登峰^1,*

1. 福州大学经济与管理学院, 福州 350108

收稿日期:2014-03-05 出版日期:2014-12-15 发布日期:2014-12-15
通讯作者: 李登峰 E-mail:lidengfeng@fzu.edu.cn
基金资助:
国家自然科学基金(Nos. 71231003, 71171055, 70871117), 高等学校博士学科点专项科研基金(No. 20113514110009), 国家教育部新世纪优秀人才支持计划~(No. NCET-10-0020)

Satisfaction optimization transportation problem

HU Xunfeng¹, LI Dengfeng^1,*

1. School of Economics and Management, Fuzhou University, Fuzhou 350108, China

Received:2014-03-05 Online:2014-12-15 Published:2014-12-15

摘要/Abstract

摘要： 传统运输问题只考虑配送方案的效率, 而不考虑参与者对配送方案的满意度. 通过引入参与者对配送方案的满意度这一概念, 提出了满意度优化运输问题, 构建了以最大化相对公平为目标的满意度优化运输模型, 并证明了: (1) 当运输问题的可行域不空时, 新模型的解集非空; (2) 从满意度的角度来看, 新模型的解是唯一的. 另外, 还给出了新模型的求解方法. 研究结果进一步丰富了运输问题的类型, 可为解决其他类型运输问题提供借鉴.

关键词: 运输问题, 满意度, 存在性, 唯一性

Abstract: Traditional transportation problem only considers the efficiency of the distribution scheme rather than the members' satisfaction. After introducing the notion of member's satisfaction to the distribution scheme, this paper introduces the satisfaction optimization transportation problem, and proposes the satisfaction optimization transportation model aiming at maximizing the relative equalities among the members. Some further results are given, including: (1) If the feasible domain of the transportation problem is not empty, so does the solution set of the new model; (2) From the perspective of satisfaction, the model has a unique solution. Additionally, this paper gives a calculation method for the new model. Research results further enrich types of transportation problems, and can be taken as reference to solve other types of transportation problems.

Key words: transportation problem, satisfaction, existence, uniqueness

中图分类号:

O221

胡勋锋, 李登峰. 满意度优化运输问题[J]. 运筹学学报, 2014, 18(4): 36-44.

HU Xunfeng, LI Dengfeng. Satisfaction optimization transportation problem[J]. Operations Research Transactions, 2014, 18(4): 36-44.

参考文献

Hitchcock F L. The distribution of a product from several sources to numerous locations [J]. Journal of Mathematical Physics, 1941, 20: 224-230.

李昆鹏, 马士华. ATO供应链中航空运输及并行机生产协调调度问题 [J]. 系统工程理论与实践, 2007, 27(12): 8-15.

白国仲, 朱小琨. JIT运输问题及其与其它运输问题的关系 [J]. 华中师范大学学报: 自然科学版, 2014, 48(3): 326-329.

靳鹏, 左春荣, 杨善林, 等. 下料问题与运输问题联合优化建模 [J]. 中国管理科学, 2013, 21(2): 91-97.

清华大学《运筹学》教材编写组. 运筹学 [M]. 北京: 清华大学出版社, 2005.

臧运华. 运输问题的一种图上解法 [J]. 运筹与管理, 2002, 11(4): 81-85.
Hitchcock F L. The distribution of a product from several sources to numerous locations [J]. Journal of Mathematical Physics, 1941, 20: 224-230.
陈方年. 一类运输问题的启发式算法 [J]. 数学杂志, 2001, 21: 307-310.

Haley K B. New methods in mathematical programming-The solid transportation problem [J]. Operations Research, 1962, 10: 448-463.

Ojha A, Das B, Mondal S, et al. A solid transportation problem for an item with fixed charge, vehicle cost and price discounted varying charge using genetic algorithm [J]. Applied Soft Computing, 2010, 10: 100-110.

Tao Z M, Xu J P. A class of rough multiple objective programming and its application to solid transportation problem [J]. Information Sciences, 2012, 188: 215-235.
Boffi G, Rossi F. Gr\"obner bases related to 3-dimensional transportation problems [EB/OL]. [2014-06-27]. http://citeseerx.ist.psu.edu/viewdoc/versions?doi=10.1.1.22.4660.

Boffi G, Rossi F. Lexicographic Gr\"obner bases of 3-dimensional transportation problems [J]. Contemporary Mathematics, 2001, 286: 145-168.

Boffi G, Rossi F. Lexicographic Gr\"obner bases for transportation problems of format r\times3\times3 [J]. Journal of Symbolic Computation, 2006, 41: 336-356.

Mosca R. A time expanded version of the (Hitchcock-)transportation problem [J]. European Transport Research Review, 2011, 3: 161-166.

Hammer P L. Time minimizing transportation problems [J]. Naval Research Logistics Quarterly, 1969, 16: 345-357.

Garfinkel R S, Rao M R. The bottleneck transportation problem [J]. Naval Research Logistics, 1971, 18: 465-472.

Sharma J K, Swarup K. Time minimizing transportation problems [J]. Proceedings Mathematical Sciences, 1977, 86: 513-518.

Jain M, Saksena P K. Time minimizing transportation problem with fractional bottleneck objective function [J]. Yugoslav Journal of Operations Research, 2012, 22: 115-129.
Charnes A, Klingman D. The more-for-less paradox in the distribution model [J]. Cahiers de Centre d'Etudes Recharche Operationelle, 1971, 13: 11-22.
林耘. 谈运输问题“悖论”产生的条件 [J]. 运筹学杂志, 1984, 3(1): 79-80.
仇海全, 曹炳元, 潘花. 需求区间型运输间题的模糊优化模型 [J]. 重庆文理学院学报: 自然科学版, 2011, 30(6): 5-8.
Chanas S, Kuehta D. A concept of the optimal solution of the transportation problem with fuzzy cost coefficients [J]．Fuzzy Sets and Systems, 1996, 82: 299-305．
谢凡荣. 需求区间型运输问题的求解算法 [J]. 运筹与管理, 2005, 14(1): 23-27.
Rudin W. Principles of Mathematical Analysis [M]. New York: McGraw-Hill, 1976.

[1]	侯丽娜, 孙海琳. 交通网络下的多厂商两阶段随机非合作博弈问题——基于随机变分不等式[J]. 运筹学学报, 2019, 23(3): 91-108.
[2]	喻科, 张晓青, 赵克全. 最优绩效分配的多目标优化方法[J]. 运筹学学报, 2018, 22(4): 89-98.
[3]	邓喜才，向淑文，左羽. 不确定性下强Berge均衡的存在性[J]. 运筹学学报, 2013, 17(3): 101-107.
[4]	闻振卫. 依赖机器的两台机自由作业排序问题[J]. 运筹学学报, 2011, 15(4): 65-74.