Research on Neighbor Search Algorithms for Discrete Manufacturing System Based on Bogie Frame

Article Preview

Abstract:

The concept of "detailed search" near the extreme value by local search function of neighborhood search algorithm for operation optimization problem of discrete manufacturing system on train bogie is raised for the first time; the optimal solution of objective function based on process constraints genetic algorithm is taken as the initial value of neighbor function to search better solutions than it in the current neighbor, and the global optimal solution.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 791-793)

Pages:

1053-1056

Citation:

Online since:

September 2013

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Ling Wang. Job-shop scheduling with genetic algorithm, Tsinghua University press, (2003).

Google Scholar

[2] Ling Wang. Intelligent optimization algorithm and its application, Tsinghua University press, (2001).

Google Scholar

[3] Shufeng Wang, Yiren Zou. Concise Review for the Job Shop Scheduling Problem, Systems Engineering theory & Practice, 2003. 1.

Google Scholar

[4] Ming Zhou, Shudong Sun. Principle and application of genetic algorithm, Academic Press, (1999).

Google Scholar

[5] Quanke Pan, Zhijun Sun, Jianying Zhu. Job Shop Scheduling Optimization based on Genetic Algorithms, Mechanical Science and Technology, (2002).

Google Scholar

[6] Frederick S. Hillier, Gerald J. Lieberman. Introduction to operations research (the sixth edition in English), Mechanical industry press, (1999).

Google Scholar

[7] Xiaobing Liu, Qiunan Meng. Research on Flexible Manufacturing Execution System based on soft component Computer Integrated Manufacturing Systems, Vol. 9, No2, 2003. 2.

Google Scholar