Abstract
A Multi-Objective Evolutionary Algorithm (MOEA) for solving Traveling Salesman Problems (TSP) was developed and used in the design of screws for twin screw polymer extrusion. Besides the fact that MOEA for TSP have already been developed, this paper constitutes an important and original contribution, since in this case, they are applied in the design of machines. The Twin- Screw Configuration Problem (TSCP) can be formulated as a TSP. A different MOEA is developed, in order to take into account the discrete nature of the TSCP. The algorithm proposed was applied to some case studies where the practical usefulness of this approach was demonstrated. Finally, the computational results are confronted with experimental data showing the validity of the approach proposed.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
White, J.L. (1990) Twin Screw Extrusion, Technology and Principles, Hanser, Munich
White, J.L., Coran A.Y., Moet A. (2001) Polymer Mixing: Technology and Engineering, Hanser, Munich
Potente, H., Ansahl, J., Wittemeier R. (1990) Throughput characteristics of Tightly Intermeshing Corotating Twin Screw Extruders. Intern. Polym. Proa, 5:208–216
Potente, H., Ansahl, J., Klarholtz, B. (1994) Design of Tightly Intermesing Co-Rotating Twin Screw Extruders. Intern. Polym. Proa, 9: 11–25
Gaspar-Cunha, A., Poulesquen, A., Vergnes, B., Covas, J.A. (2002) Optimization of processing conditions for polymer twin-screw extrusion. Intern. Polym. Process., 17: 201–213
Gaspar-Cunha, A., Vergnes, B., Covas, J.A., (2004) submitted to Polym. Eng. Sci.
Baraglia, R., Hidalgo, J.L, Perego, R. (2001) A hybrid heuristic for the traveling salesman problem. IEEE Trans. On Evolut. Computation, 5: 613–622
Padberg, M., Rinaldi, G. (1987) Optimization of a 532-city symmetric genetic salesman problem by branch and cut. Oper. Research Letters, 6: 1–7
Johnson, D.S., MvGeoch, L.A. (1996) Local Search in Combinatorial Optimization, Wiley, New York
Croes, G.A. (1958) A method for solving traveling salesman problems. Oper. Research, 6: 791–812
Lin, S., Kernighan, B.W. (1973) An effective heuristic algorithm for the traveling salesman problem. Operational Research, 21: 498–516
Lin, S., (1965) Computer solution of the traveling salesman problem. Bell Systems Technology Journal, 44: 2245–2269
Applegate, D., Bixby, R., Chvátal, V., Cook, W. (1998) On the solution of traveling salesman problems, in Documenta Mathematica: Proc. Int. Cogr. Mathematicians, 3: 645–656
Gaspar-Cunha, A., Covas, J.A, (2004)-RPSGAe-A Multiobjective Genetic Algorithm with Elitism: Application to Polymer Extrusion. In: Gandibleux, X.; Sevaux, M.; Sörensen, K.; T’kindt, V. (Eds.) Metaheuristics for Multi objective Optimisation, Lecture Notes in Economics and Mathematical Systems, Springer, Wien, pp. 221–249
Goldberg, D.E. (1989) Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley
Tao, G., Michalewicz, Z. (1998) Inver-over operator for TSP. Proceedings of the 5th Parallel Problem Solving from Nature, Amsterdam
Deb, K., (2001) Multi-Objective Optimization using Evolutionary Algorithms, Wiley
Coello Coello, C.A., Van Veldhuizen, D.A., Lamont, G.B., (2002) Evolutionary Algorithms for Solving Multi-Objective Problems, Kluwer
Roseman, M.A., Gero, J.S. (1985) Reducing the Pareto optimal set in multicriteria optimization. Eng. Optim. 8:189–206
Vergnes, B., Delia Valle, G., Delamare, L. (1998) A global computer software for polymer flows in corotating twin screw extruders. Polym. Eng. Sci., 38:1781–1792
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag/Wien
About this paper
Cite this paper
Gaspar-Cunha, A. (2005). A Multi-Objective Evolutionary Algorithm for Solving Traveling Salesman Problems: Application to the Design of Polymer Extruders. In: Ribeiro, B., Albrecht, R.F., Dobnikar, A., Pearson, D.W., Steele, N.C. (eds) Adaptive and Natural Computing Algorithms. Springer, Vienna. https://doi.org/10.1007/3-211-27389-1_45
Download citation
DOI: https://doi.org/10.1007/3-211-27389-1_45
Publisher Name: Springer, Vienna
Print ISBN: 978-3-211-24934-5
Online ISBN: 978-3-211-27389-0
eBook Packages: Computer ScienceComputer Science (R0)