Stochastic Programming Based on Traveling Salesman Problem with Stochastic Cost

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 functi...

Full description

Saved in:
Bibliographic Details
Published inApplied Mechanics and Materials Vol. 321-324; pp. 2076 - 2079
Main Authors Zhou, Lei, Yang, Xiao Zheng, Li, Qing Chun, Hui, Hong Qi
Format Journal Article
LanguageEnglish
Published Zurich Trans Tech Publications Ltd 01.06.2013
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary: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.
Bibliography:Selected, peer reviewed papers from the 2013 International Conference on Mechatronics and Industrial Informatics 1st ICMII 2013, March 13-14, 2013, Guangzhou, China
ISBN:3037856947
9783037856949
ISSN:1660-9336
1662-7482
1662-7482
DOI:10.4028/www.scientific.net/AMM.321-324.2076