253
Views
4
CrossRef citations to date
0
Altmetric
Original Articles

A deterministic global approach for mixed-discrete structural optimization

&
Pages 863-879 | Received 16 Oct 2012, Accepted 15 May 2013, Published online: 02 Jul 2013

References

  • Adjiman, C. S., Androulakis, I. P., and C. A. Floudas 2000. “Global Optimization of Mixed-Integer Nonlinear Problems.” AIChE Journal 46: 1769–1797. doi: 10.1002/aic.690460908
  • Bennage, W. A., and A. K. Dhingra 1995. “Optimization of Truss Topology Using Tabu Search.” International Journal for Numerical Methods in Engineering 38: 4035–4052. doi: 10.1002/nme.1620382308
  • Bianchi, L., Dorigo, M., Gambardella, L. M., and W. J. Gutjahr 2009. “A Survey on Metaheuristics for Stochastic Combinatorial Optimization.” Natural Computing 8: 239–287. doi: 10.1007/s11047-008-9098-4
  • Björk, K. M., Lindberg, P. O., and T. Westerlund 2003. “Some Convexifications in Global Optimization of Problems Containing Signomial Terms.” Computers and Chemical Engineering 27: 669–679. doi: 10.1016/S0098-1354(02)00254-5
  • Cai, J., and G. Thierauf 1996. “Evolution Strategies for Solving Discrete Optimization Problems.” Advances in Engineering Software 25: 177–183. doi: 10.1016/0965-9978(95)00104-2
  • Cao, Y. J., Jiang, L., and Q. H. Wu 2000. “An Evolutionary Programming Approach to Mixed-Variable Optimization Problems.” International Journal of Applied Mathematical Modelling 24: 931–942. doi: 10.1016/S0307-904X(00)00026-3
  • Cao, Y. J., and Q. H. Wu 1999. “A Mixed Variable Evolutionary Programming for Optimisation of Mechanical Design.” International Journal of Engineering Intelligent Systems for Electrical Engineering and Communications 7: 77–82.
  • Cardoso, M. F., Salcedo, R. L., and S. Feyo de Azevedo 1996. “The Simplex-Simulated Annealing Approach to Continuous Nonlinear Optimization.” Computer and Chemical Engineering 20: 1065–1080. doi: 10.1016/0098-1354(95)00221-9
  • Chen, T. Y., and H. C. Chen 2009. “Mixed-discrete Structural Optimization Using a Rank-niche Evolution Strategy.” Engineering Optimization 41: 39–58. doi: 10.1080/03052150802344535
  • Coello Coello, C. A., and E. Mezura Montes 2001. “Use of Dominance-based Tournament Selection to Handle Constraints in Genetic Algorithms.” Intelligent Engineering Systems Through Artificial Neural Networks, 177–182.St. Louis, MO: ASME Press.
  • Deb, K. 1997. “Geneas: A Robust Optimal Design Technique for Mechanical Component Design.” In Evolutionary Algorithms in Engineering Applications, edited by D. Dasgupta, and Z. Michalewicz, 497–514.Berlin: Springer.
  • Deb, K., and M. Goyal 1997. “Optimizing Engineering Designs Using a Combined Genetic Search.” In Proceedings of the Seventh International Conference on Genetic Algorithms, edited by T. Back, 512–528.East Lansing, USA
  • Dorigo, M. 1992. “Optimization, Learning and Natural Algorithms.” PhD diss., Politecnico di Milano.
  • Erbatur, F., Hasancebi, O., Tutuncu, I., and H. Kilic 2000. “Optimal Design of Planar and Space Structures with Genetic Algorithms.” Computers & Structures 75: 209–224. doi: 10.1016/S0045-7949(99)00084-X
  • Floudas, C. A. 1999a. “Global Optimization in Design and Control of Chemical Process Systems.” Journal of Process Control 10: 125–134. doi: 10.1016/S0959-1524(99)00019-0
  • Floudas, C. A. 1999b. “Recent Advances in Global Optimization for Process Synthesis, Design and Control: Enclosure of All Solutions.” Computers and Chemical Engineering 23: 963–974. doi: 10.1016/S0098-1354(99)80231-2
  • Floudas, C. A. 2000). Deterministic Global Optimization: Theory, Methods and Application. Boston, MA: Kluwer.
  • Floudas, C. A., and P. M. Pardalos 1996). State of the Art in Global Optimization: Computational Methods and Applications. Boston, MA: Kluwer.
  • Gantovnik, V. B., Anderson-Cook, C. M., Gurdal, Z., and L. T. Watson 2009. “A Genetic Algorithm with Memory for Mixed Discrete-Continuous Design Optimization.” Computers & Structures 81: 2003–. doi: 10.1016/S0045-7949(03)00253-0
  • Glover, F. 1977. “Heuristic for Integer Programming Using Surrogate Constraints.” Decision Science 8: 156–166. doi: 10.1111/j.1540-5915.1977.tb01074.x
  • Glover, F. W., and G. A. Kochenberger 2003). Handbook of Metaheuristics. New York: Springer.
  • Glover, F., and M. Laguna 1997). Tabu search. Boston, MA: Kluwer.
  • He, S., Prempain, E., and Q. H. Wu 2004. “An Improved Particle Swarm Optimizer for Mechanical Design Optimization Problems.” Engineering Optimization 36: 585–605. doi: 10.1080/03052150410001704854
  • Hedar, A. 2004. “Studies on Metaheuristics for Continuous Global Optimization Problems.” PhD diss., Kyoto University.
  • Kirkpatrick, S., Gelatt Jr, C. D., and M. P. Vecchi 1983. “Optimization by Simulated Annealing.” Science 220: 671–680. doi: 10.1126/science.220.4598.671
  • Lampinen, J., and I. Zelinka. 1999. “Mixed Integer-Discrete–Continuous Optimization by Differential Evolution.” In Proceedings of the 5th International Conference on Soft Computing, edited by P. Osmera, 71–76. Brno, Czech Republic.
  • Lee, K. S., and Z. W. Geem 2005. “A New Meta-heuristic Algorithm for Continuous Engineering Optimization: Harmony Search Theory and Practice.” Computer Methods in Applied Mechanics and Engineering 194: 3902–3933. doi: 10.1016/j.cma.2004.09.007
  • Li, H. L., and H. C. Lu 2009. “Global Optimization for Generalized Geometric Programs with Mixed Free-Sign Variables.” Operations Research 57: 701–713. doi: 10.1287/opre.1080.0586
  • Li, H. L., Lu, H. C., Huang, C. H., and N. Z. Hu 2009. “A Superior Representation Method for Piecewise Linear Functions.” INFORMS Journal on Computing 21: 314–321. doi: 10.1287/ijoc.1080.0294
  • Lin, M. H., and J. F. Tsai 2012. “Range Reduction Techniques for Improving Computational Efficiency in Global Optimization of Signomial Geometric Programming Problems.” European Journal of Operational Research 216: 17–25. doi: 10.1016/j.ejor.2011.06.046
  • Lin, M. H., Tsai, J. F., and P. C. Wang 2012. “Solving Engineering Optimization Problems by a Deterministic Global Approach.” Applied Mathematics & Information Sciences 6 (3S): 1101–1107.
  • LINGO Release 11.0. 2004. Chicago, IL: LINDO System.
  • Lundell, A., and T. Westerlund 2009a. “Convex Underestimation Strategies for Signomial Functions.” Optimization Methods and Software 24: 505–522. doi: 10.1080/10556780802702278
  • Lundell, A., and T. Westerlund 2009b. “On the Relationship between Power and Exponential Transformations for Positive Signomial Functions.” Chemical Engineering Transactions 1: 1287–1292.
  • Lundell, A., Westerlund, J., and T. Westerlund 2009. “Some Transformation Techniques with Applications in Global Optimization.” Journal of Global Optimization 43: 391–405. doi: 10.1007/s10898-007-9223-4
  • Maranas, C. D., and C. A. Floudas 1995. “Finding All Solutions of Nonlinearly Constrained Systems of Equations.” Journal of Global Optimization 7: 143–182. doi: 10.1007/BF01097059
  • Maranas, C. D., and C. A. Floudas 1997. “Global Optimization in Generalized Geometric Programming.” Computers and Chemical Engineering 21: 351–369. doi: 10.1016/S0098-1354(96)00282-7
  • Pörn, R., Björk, K. M., and T. Westerlund 2008. “Global Solution of Optimization Problems with Signomial Parts.” Discrete Optimization 5: 108–120. doi: 10.1016/j.disopt.2007.11.005
  • Pörn, R., Harjunkoski, I., and T. Westerlund 1999. “Convexification of Different Classes of Non-convex MINLP Problems.” Computers and Chemical Engineering 23: 439–448. doi: 10.1016/S0098-1354(98)00305-6
  • Rosen, S. L., and C. M. Harmonosky 2005. “An Improved Simulated Annealing Simulation Optimization Method for Discrete Parameter Stochastic Systems.” Computers and Operations Research 21: 359–367.
  • Sandgren, E. 1990. “Nonlinear Integer and Discrete Programming in Mechanical Design Optimization.” Journal of Mechanical Design 112: 223–229. doi: 10.1115/1.2912596
  • Schlüter, M., Egea, J. A., and J. R. Banga 2009. “Extended Ant Colony Optimization for Non-convex Mixed Integer Nonlinear Programming.” Computers & Operations Research 36: 2217–2229. doi: 10.1016/j.cor.2008.08.015
  • Serban, A. T., and G. Sandou 2007. “Mixed Ant Colony Optimization for the Unit Commitment Problem.” Lecture Notes in Computer Science 4431: 332–340. doi: 10.1007/978-3-540-71618-1_37
  • Socha, K. 2004. “ACO for Continuous and Mixed-Variable Optimization.” In Proceedings of 4th International Workshop on Ant Colony Optimization and Swarm, edited by M. Dorigo, M. Birattari, C. Blum, L. M. Gambardella, F. Mondada, and T. Stützle, 25–36.Berlin: Springer.
  • Tsai, J. F., Li, H. L., and N. Z. Hu 2002. “Global Optimization for Signomial Discrete Programming Problems in Engineering Design.” Engineering Optimization 34: 613–622. doi: 10.1080/03052150215719
  • Tsai, J. F., and M. H. Lin 2008. “Global Optimization of Signomial Mixed-Integer Nonlinear Programming Problems with Free Variables.” Journal of Global Optimization 42: 39–49. doi: 10.1007/s10898-007-9211-8
  • Vielma, J. P., and G. Nemhauser 2011. “Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints.” Mathematical Programming 128: 49–72. doi: 10.1007/s10107-009-0295-4
  • Westerlund, T. 2007. “Some Transformation Techniques in Global Optimization.” In Global Optimization, From Theory to Implementations, edited by L. Liberti, and N. Maculan, 45–74.New York: Springer.
  • Xiong, Y., and S. S. Rao 2004. “Fuzzy Nonlinear Programming for Mixed-discrete Design Optimization through Hybrid Genetic Algorithm.” Fuzzy Sets and Systems 146: 167–186. doi: 10.1016/j.fss.2003.09.001

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.