Stochastic Programming Based on Traveling Salesman Problem with Stochastic Cost

被引:0
作者
Yang, Xiaozheng [1 ]
Li, Qingchun [2 ]
Zhou, Lei [1 ]
Hui, Hongqi [1 ]
机构
[1] Hebei Univ Sci & Technol, Sch Econ & Management, Shijiazhuang, Hebei, Peoples R China
[2] Hebei Univ Sci & Technol, Financial Dept, Shijiazhuang, Hebei, Peoples R China
来源
MECHATRONICS AND INDUSTRIAL INFORMATICS, PTS 1-4 | 2013年 / 321-324卷
关键词
Traveling salesman problem; Stochastic programming; Synthesizing effect; Expectation model; OPTIMIZATION;
D O I
10.4028/www.scientific.net/AMM.321-324.2076
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
The research of traveling salesman problem (TSP) is important in logistics distribution. Because many stochastic cost factors affecting logistics distribution in real life, a class of stochastic programming model is considered in TSP in this paper. Through given a class of synthesizing effect functions which synthesis expectation and variance of cost factors, stochastic programming model of TSP with stochastic cost can be converted into a class of crisp programming models. A genetic algorithm based on real coding is used in an illustrative example. It is provided to show the effectiveness of the proposed model and method.
引用
收藏
页码:2076 / +
页数:2
相关论文
共 6 条
[1]  
Applegate D. L., 2007, Princeton Series in Applied Mathematics
[2]   CHANCE-CONSTRAINED PROGRAMMING [J].
CHARNES, A ;
COOPER, WW .
MANAGEMENT SCIENCE, 1959, 6 (01) :73-79
[3]  
LAWLER EL, 1985, SERIES DISCRETE MATH
[4]   Dependent-chance programming: A class of stochastic optimization [J].
Liu, BD .
COMPUTERS & MATHEMATICS WITH APPLICATIONS, 1997, 34 (12) :89-104
[5]   Modelling stochastic decision systems using dependent-chance programming [J].
Liu, BD ;
Iwamura, K .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1997, 101 (01) :193-203
[6]  
Zhou L, 2008, INT C WAVEL ANAL PAT, P783, DOI 10.1109/ICWAPR.2008.4635883