Stochastic Programming Based on Traveling Salesman Problem with Stochastic Cost

Xiao Zheng Yang; Qing Chun Li; Lei Zhou; Hong Qi Hui

doi:10.4028/www.scientific.net/AMM.321-324.2076

Paper Titles

Optimization Algorithms of PERT Network Diagram in Software Project Management System
p.2056

A Route Optimizing Model and Algorithm for Pickup and Delivery Problem with Time Window
p.2060

Genetic Algorithm Applied to the Selection of Factors in Principal Component: ASQR Study of Aromatic Hydrocarbons Toxicity to Chlorella Vulgaris
p.2065

Research on Chronic Disease Network Question-Answering System and Similarity Matching Algorithm
p.2071

Stochastic Programming Based on Traveling Salesman Problem with Stochastic Cost
p.2076

Application and Research of the Granular Evolutionary Neural Network Algorithms for the Complex Network
p.2080

Automatic Automotive Panel Drawing Direction Algorithm Based on Genetic Algorithm
p.2085

Maximum Sampling Sequence Design in Teaching Management Application Based on Genetic Algorithm
p.2089

Automatic Algorithm of Effectiveness of Accounting Management Systems Based on Genetic Algorithm
p.2093

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 321-324Stochastic Programming Based on Traveling Salesman...

Stochastic Programming Based on Traveling Salesman Problem with Stochastic Cost

Abstract:

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.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 321-324)

Pages:

2076-2079

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.321-324.2076

Citation:

Cite this paper

Online since:

June 2013

Authors:

Xiao Zheng Yang, Qing Chun Li, Lei Zhou, Hong Qi Hui

Keywords:

Expectation Model, Stochastic Programming, Synthesizing Effect, Traveling Salesman Problem (TSP)

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] D. L., Applegate, R. E. Bixby, V. Chvátal and W. J. Cook, in: Traveling salesman problem: A computational study. New Jersey: Princeton University Press. (2007).

DOI: 10.1145/1556154.1556162

Google Scholar

[2] E. L. Lawler, J. K. Lenstra and D. B. Shmoys, in: The traveling salesman problem: A guided tour of combinatorial optimization. Series in discrete mathematics & optimization. Chichester: Wiley. Laarhoven, P. J. M. V., & Aarts, E. H. (1985).

DOI: 10.2307/2582681

Google Scholar

[3] A. Charnes and W. W. Cooper: Chance-constrained programming. Management Science Vol. 6 (1959), p.73.

Google Scholar

[4] B. Liu: Dependent-chance programming: A class of stochastic programming. Computers and Mathematics with Applications Vol. 34 (1997), p.89.

DOI: 10.1016/s0898-1221(97)00237-x

Google Scholar

[5] B. Liu and K. Iwamura: Modelling stochastic decision systems using dependent-chance programming. European Journal of Operational Research Vol. 101 (1997), p.193.

DOI: 10.1016/0377-2217(95)00371-1

Google Scholar

[6] L. Zhou and F. C. Li: Compound dynamic constraint of stochastic optimization model and algorithm. Proceedings of 2008 International Conference on Wavelet Analysis and Pattern Recognition, Hong Kong (2008), p.783.

DOI: 10.1109/icwapr.2008.4635883

Google Scholar