10 Sequential Parameter Optimization for Mixed-Discrete Problems
355
48. J. Sobieszczanski-Sobieski, Sensitivity analysis and multidisciplinary optimization for
aircraftdesign-recent advances and results. J. Aircraft 27(12), 993–1001 (1990)
49. I. Sobol, Y.L. Levitan, A pseudo-random number generator for personal computers. Comput.
Math. Appl. 37(4–5), 33–40 (1999)
50. C. Teixeira, J. Covas, T. Stützle, A. Gaspar-Cunha, Optimization of co-rotating twin-screw
extruders using pareto local search, in Advances in Intelligent and Soft Computing (Springer
Science + Business Media, Berlin, 2010), pp. 3–10
51. C. Teixeira, J.A. Covas, T. Stützle, A. Gaspar-Cunha, Multi-objective ant colony optimization
for the twin-screw configuration problem. Eng. Optim. 44(3), 351–371 (2012)
52. J. Tu, D. Jones, Variable screening in metamodel design by cross-validated moving least
squares method, in 44th AIAA/ASME/ASCE/AHS/ASC Structures, Structural Dynamics, and
Materials Conference (2003), pp. 1669
53. U. Utecht, K. Trint, Mutation operators for structure evolution of neural networks, in
International Conference on Parallel Problem Solving from Nature (Springer, Berlin, 1994),
pp. 492–501
54. I. Voutchkov, A. Keane, A. Bhaskar, T.M. Olsen, Weld sequence optimization: The use of
surrogate models for solving sequential combinatorial problems. Comput. Methods Appl.
Mech. Eng. 194(30–33), 3535–3551 (2005)
55. T. Weise, M. Zapf, R. Chiong, A.J. Nebro, Why is optimization difficult? in Nature-Inspired
Algorithms for Optimisation (Springer, Berlin, 2009), pp. 1–50
56. T. Westerlund, F. Pettersson, An extended cutting plane method for solving convex minlp
problems. Comput. Chem. Eng. 19, 131–136 (1995)
57. D.H. Wolpert, W.G. Macready, No free lunch theorems for optimization. IEEE Trans. Evol.
Comput. 1(1), 67–82 (1997)
58. M. Zaefferer, J. Stork, T. Bartz-Beielstein, Distance measures for permutations in combinatorial efficient global optimization, in Parallel Problem Solving from Nature–PPSN XIII, ed. by
T. Bartz-Beielstein, J. Branke, B. Filipiˇ c, J. Smith (Springer, Cham, 2014), pp. 373–383
59. M. Zaefferer, J. Stork, M. Friese, A. Fischbach, B. Naujoks, T. Bartz-Beielstein, Efficient
global optimization for combinatorial problems, in Proceedings of the 2014 Conference on
Genetic and Evolutionary Computation, GECCO ’14 (ACM, New York, NY, 2014), pp. 871–
878
355
48. J. Sobieszczanski-Sobieski, Sensitivity analysis and multidisciplinary optimization for
aircraftdesign-recent advances and results. J. Aircraft 27(12), 993–1001 (1990)
49. I. Sobol, Y.L. Levitan, A pseudo-random number generator for personal computers. Comput.
Math. Appl. 37(4–5), 33–40 (1999)
50. C. Teixeira, J. Covas, T. Stützle, A. Gaspar-Cunha, Optimization of co-rotating twin-screw
extruders using pareto local search, in Advances in Intelligent and Soft Computing (Springer
Science + Business Media, Berlin, 2010), pp. 3–10
51. C. Teixeira, J.A. Covas, T. Stützle, A. Gaspar-Cunha, Multi-objective ant colony optimization
for the twin-screw configuration problem. Eng. Optim. 44(3), 351–371 (2012)
52. J. Tu, D. Jones, Variable screening in metamodel design by cross-validated moving least
squares method, in 44th AIAA/ASME/ASCE/AHS/ASC Structures, Structural Dynamics, and
Materials Conference (2003), pp. 1669
53. U. Utecht, K. Trint, Mutation operators for structure evolution of neural networks, in
International Conference on Parallel Problem Solving from Nature (Springer, Berlin, 1994),
pp. 492–501
54. I. Voutchkov, A. Keane, A. Bhaskar, T.M. Olsen, Weld sequence optimization: The use of
surrogate models for solving sequential combinatorial problems. Comput. Methods Appl.
Mech. Eng. 194(30–33), 3535–3551 (2005)
55. T. Weise, M. Zapf, R. Chiong, A.J. Nebro, Why is optimization difficult? in Nature-Inspired
Algorithms for Optimisation (Springer, Berlin, 2009), pp. 1–50
56. T. Westerlund, F. Pettersson, An extended cutting plane method for solving convex minlp
problems. Comput. Chem. Eng. 19, 131–136 (1995)
57. D.H. Wolpert, W.G. Macready, No free lunch theorems for optimization. IEEE Trans. Evol.
Comput. 1(1), 67–82 (1997)
58. M. Zaefferer, J. Stork, T. Bartz-Beielstein, Distance measures for permutations in combinatorial efficient global optimization, in Parallel Problem Solving from Nature–PPSN XIII, ed. by
T. Bartz-Beielstein, J. Branke, B. Filipiˇ c, J. Smith (Springer, Cham, 2014), pp. 373–383
59. M. Zaefferer, J. Stork, M. Friese, A. Fischbach, B. Naujoks, T. Bartz-Beielstein, Efficient
global optimization for combinatorial problems, in Proceedings of the 2014 Conference on
Genetic and Evolutionary Computation, GECCO ’14 (ACM, New York, NY, 2014), pp. 871–
878