Computational Experiments of Optimizing Transporting Robot Move Sequence in Molds Assembly Using Genetic Algorithm

Xiao Dong Nie; Yu Jun Yang

doi:10.4028/www.scientific.net/AMR.468-471.13

Paper Titles

Preface and Sponsors & Committees

Analysis on Controlling Oil Pressure Regulating Performance of Hydro-Viscous Variable Speed Clutch
p.3

Application of the R-Function Theory for the Bending Problem of Shallow Spherical Shells with a Dodecagon Domain
p.8

Computational Experiments of Optimizing Transporting Robot Move Sequence in Molds Assembly Using Genetic Algorithm
p.13

A New Life Detection System: Integration of Ultra-Wide Band Sensor into Wireless Sensor Networks
p.20

CFD Studies on Velocity Distribution of Air in a Swirling Fluidized Bed
p.25

Design and Realization of Automatic Feed Proportioning System Based on PLC
p.30

Adaptive Internet-Based Online Courses Research
p.34

Biomechanics Simulation of Volleyball Player in Jumping Spike
p.38

HomeAdvanced Materials ResearchAdvanced Materials Research Vols. 468-471Computational Experiments of Optimizing...

Computational Experiments of Optimizing Transporting Robot Move Sequence in Molds Assembly Using Genetic Algorithm

Abstract:

In this paper, in order to optimize the move sequence of material transporting robot in molds assembly, a mathematic model is established, genetic algorithm is used to search, and computational experiments are proposed. At last, it can find that the recommend genetic algorithm has better effective.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Advanced Materials Research (Volumes 468-471)

Pages:

13-19

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.468-471.13

Citation:

Cite this paper

Online since:

February 2012

Authors:

Xiao Dong Nie, Yu Jun Yang

Keywords:

Comparative Experiments, Genetic Algorithm (GA), Material Transporting, Robot

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] V. Kats, Y. L. Lei, and E. Levner. Minimizing the cycle time of multiple-product processing networks with a fixed operation sequence setups and time-window constraints. European Journal of Operational Research, 187, 1196-1211(2008)

DOI: 10.1016/j.ejor.2006.07.030

Google Scholar

[2] D.Whitley, The GENITOR algorithm and selective pressure: why rank-based allocation of reproductive trials is best. In: Proceedings of the Third International Conference on Genetic Algorithms and their Applications(1989).

Google Scholar

[3] I.M. Oliver, D.J. Smith, J.R.C. Holland, A study of permutation crossover operators on travelling salesman problem, in: Proceedings of the Second InternationalConference on Genetic Algorithms(1987), p.224–230

Google Scholar

[4] Jacques Carlier, Mohamed Haouari, Mohamed Kharbeche, Aziz Moukrim, An optimization-based heuristic for the robotic cell problem, European Journal of Operational Research, 202, 636-645(2010)

DOI: 10.1016/j.ejor.2009.06.035

Google Scholar

[5] Ruiz, R., Maroto, C., Alcaraz, J., Two new robust genetic algorithms for the ﬂowshop scheduling problem. Omega 34, 461–476(2006)

DOI: 10.1016/j.omega.2004.12.006

Google Scholar