A Multi-Objective Evolutionary Algorithm for Solving Traveling Salesman Problems: Application to the Design of Polymer Extruders

  • A. Gaspar-Cunha


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.


Viscous Dissipation Travel Salesman Problem Travel Salesman Problem Twin Screw Extruder Twin Screw 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    White, J.L. (1990) Twin Screw Extrusion, Technology and Principles, Hanser, MunichGoogle Scholar
  2. [2]
    White, J.L., Coran A.Y., Moet A. (2001) Polymer Mixing: Technology and Engineering, Hanser, MunichGoogle Scholar
  3. [3]
    Potente, H., Ansahl, J., Wittemeier R. (1990) Throughput characteristics of Tightly Intermeshing Corotating Twin Screw Extruders. Intern. Polym. Proa, 5:208–216Google Scholar
  4. [4]
    Potente, H., Ansahl, J., Klarholtz, B. (1994) Design of Tightly Intermesing Co-Rotating Twin Screw Extruders. Intern. Polym. Proa, 9: 11–25Google Scholar
  5. [5]
    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–213Google Scholar
  6. [6]
    Gaspar-Cunha, A., Vergnes, B., Covas, J.A., (2004) submitted to Polym. Eng. Sci.Google Scholar
  7. [7]
    Baraglia, R., Hidalgo, J.L, Perego, R. (2001) A hybrid heuristic for the traveling salesman problem. IEEE Trans. On Evolut. Computation, 5: 613–622CrossRefGoogle Scholar
  8. [8]
    Padberg, M., Rinaldi, G. (1987) Optimization of a 532-city symmetric genetic salesman problem by branch and cut. Oper. Research Letters, 6: 1–7MathSciNetCrossRefGoogle Scholar
  9. [9]
    Johnson, D.S., MvGeoch, L.A. (1996) Local Search in Combinatorial Optimization, Wiley, New YorkGoogle Scholar
  10. [10]
    Croes, G.A. (1958) A method for solving traveling salesman problems. Oper. Research, 6: 791–812MathSciNetGoogle Scholar
  11. [11]
    Lin, S., Kernighan, B.W. (1973) An effective heuristic algorithm for the traveling salesman problem. Operational Research, 21: 498–516MathSciNetGoogle Scholar
  12. [12]
    Lin, S., (1965) Computer solution of the traveling salesman problem. Bell Systems Technology Journal, 44: 2245–2269MATHGoogle Scholar
  13. [13]
    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–656Google Scholar
  14. [14]
    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–249Google Scholar
  15. [15]
    Goldberg, D.E. (1989) Genetic Algorithms in Search, Optimization and Machine Learning, Addison-WesleyGoogle Scholar
  16. [16]
    Tao, G., Michalewicz, Z. (1998) Inver-over operator for TSP. Proceedings of the 5th Parallel Problem Solving from Nature, AmsterdamGoogle Scholar
  17. [17]
    Deb, K., (2001) Multi-Objective Optimization using Evolutionary Algorithms, WileyGoogle Scholar
  18. [18]
    Coello Coello, C.A., Van Veldhuizen, D.A., Lamont, G.B., (2002) Evolutionary Algorithms for Solving Multi-Objective Problems, KluwerGoogle Scholar
  19. [19]
    Roseman, M.A., Gero, J.S. (1985) Reducing the Pareto optimal set in multicriteria optimization. Eng. Optim. 8:189–206Google Scholar
  20. [20]
    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–1792CrossRefGoogle Scholar

Copyright information

© Springer-Verlag/Wien 2005

Authors and Affiliations

  • A. Gaspar-Cunha
    • 1
  1. 1.IPC — Institute for Polymer and CompositesUniversity of MinhoGuimarãesPortugal

Personalised recommendations