163
Views
6
CrossRef citations to date
0
Altmetric
Original Articles

Unconventional optimization for achieving well-informed design solutions for the automobile industry

, , ORCID Icon, , &
Pages 1542-1560 | Received 09 Jan 2019, Accepted 22 Jul 2019, Published online: 11 Nov 2019

References

  • Colorni, Alberto, Marco Dorigo, and Vittorio Maniezzo. 1990. “Genetic Algorithms and Highly Constrained Problems: The Time-Table Case.” In Proceedings of the International Conference on Parallel Problem Solving from Nature (PPSN 1990), 55–59. Berlin: Springer-Verlag.
  • Corne, D. W., J. D. Knowles, and M. Oates. 2000. “The Pareto Envelope-Based Selection Algorithm for Multiobjective Optimization.” In Proceedings of the Sixth International Conference on Parallel Problem Solving from Nature (PPSN-VI), 839–848. Berlin: Springer-Verlag.
  • Deb, K. 2001. Multi-Objective Optimization Using Evolutionary Algorithms. Chichester, UK: Wiley.
  • Deb, K., and R. B. Agrawal. 1995. “Simulated Binary Crossover for Continuous Search Space.” Complex Systems 9 (2): 115–148.
  • Deb, K., S. Agrawal, A. Pratap, and T. Meyarivan. 2002. “A Fast and Elitist Multi-Objective Genetic Algorithm: NSGA-II.” IEEE Transactions on Evolutionary Computation 6 (2): 182–197. doi: 10.1109/4235.996017
  • Deb, K., R. Hussein, P. Roy, and G. Toscano. 2018. “A Taxonomy for Metamodeling Frameworks for Evolutionary Multi-Objective Optimization.” IEEE Transactions on Evolutionary Computation 23 (1): 104–116. doi: 10.1109/TEVC.2018.2828091.
  • Deb, K., and H. Jain. 2014. “An Evolutionary Many-Objective Optimization Algorithm Using Reference-Point Based Non-Dominated Sorting Approach, Part I: Solving Problems with Box Constraints.” IEEE Transactions on Evolutionary Computation 18 (4): 577–601. doi: 10.1109/TEVC.2013.2281535
  • Deb, K., and C. Myburgh. 2017. “A Population-Based Fast Algorithm for a Billion-Dimensional Resource Allocation Problem with Integer Variables.” European Journal of Operational Research 261 (2): 460–474. doi: 10.1016/j.ejor.2017.02.015
  • Durillo, Juan J., and Antonio J. Nebro. 2011. “jMetal: A Java Framework for Multi-Objective Optimization.” Advances in Engineering Software 42 (10): 760–771. doi: 10.1016/j.advengsoft.2011.05.014
  • Goldberg, D. E. 1989. Genetic Algorithms for Search, Optimization, and Machine Learning. Reading, MA: Addison-Wesley.
  • Hadka, Dave, et al. 2014. “MOEA Framework.” http://moeaframework.org/index.html.
  • Hammache, Abdelaziz, Marzouk Benali, and Francois Aube. 2010. “Multi-Objective Self-Adaptive Algorithm for Highly Constrained Problems: Novel Method and Applications.” Applied Energy 87 (8): 2467–2478. doi: 10.1016/j.apenergy.2009.11.026
  • Jain, H., and K. Deb. 2014. “An Evolutionary Many-Objective Optimization Algorithm Using Reference-Point Based Non-Dominated Sorting Approach, Part II: Handling Constraints and Extending to an Adaptive Approach.” IEEE Transactions on Evolutionary Computation 18 (4): 602–622. doi: 10.1109/TEVC.2013.2281534
  • Kapanoglu, Muzaffer, and Ilker Ozan Koc. 2006. “A Multi-Population Parallel Genetic Algorithm for Highly Constrained Continuous Galvanizing Line Scheduling.” In Proceedings of the International Workshop on Hybrid Metaheuristics (HM 2006), 28–41. Berlin: Springer-Verlag. doi: 10.1007/11890584_3.
  • Kokkolaras, Michael, Charles Audet, and John E. Dennis Jr. 2001. “Mixed Variable Optimization of the Number and Composition of Heat Intercepts in a Thermal Insulation System.” Optimization and Engineering 2 (1): 5–29. doi: 10.1023/A:1011860702585
  • Miettinen, K. 1999. Nonlinear Multiobjective Optimization. Boston, MA: Kluwer.
  • Piola, Roberto. 1994. “Evolutionary Solutions to a Highly Constrained Combinatorial Problem.” In Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence, 445–449. Piscataway, NJ: IEEE.
  • Reed, P., and D. Hadka. 2017. MOEA Framework version 2.12. http://moeaframework.org/downloads.html.
  • Reklaitis, G. V., A. Ravindran, and K. M. Ragsdell. 1983. Engineering Optimization Methods and Applications. New York: Wiley.
  • Runarsson, Thomas P., and Xin Yao. 2000. “Stochastic Ranking for Constrained Evolutionary Optimization.” IEEE Transactions on Evolutionary Computation 4 (3): 284–294. doi: 10.1109/4235.873238
  • Sóbester, András, Alexander I. J. Forrester, David J. J. Toal, Es Tresidder, and Simon Tucker. 2014. “Engineering Design Applications of Surrogate-Assisted Optimization Techniques.” Optimization and Engineering 15 (1): 243–265. doi: 10.1007/s11081-012-9199-x
  • van Rijn, Sander, Michael Emmerich, Edgar Reehuis, and Thomas Bäck. 2015. “Optimizing Highly Constrained Truck Loadings Using a Self-Adaptive Genetic Algorithm.” In Proceedings of the 2015 IEEE Congress on Evolutionary Computation (CEC), 227–234. Piscataway, NJ: IEEE.
  • Wight, Jonathan, and Yi Zhang. 2005. “An ‘Ageing’ Operator and its Use in the Highly Constrained Topological Optimization of HVAC System Design.” In Proceedings of the 7th Annual Conference on Genetic and Evolutionary Computation (GECCO 2005), 2075–2082. New York: ACM.
  • Zhang, Qingfu, and Hui Li. 2007. “MOEA/D: A Multiobjective Evolutionary Algorithm Based on Decomposition.” IEEE Transactions on Evolutionary Computation 11 (6): 712–731. doi: 10.1109/TEVC.2007.892759
  • Zitzler, Eckart, Marco Laumanns, and Lothar Thiele. 2001. “SPEA2: Improving the Strength Pareto Evolutionary Algorithm for Multiobjective Optimization.” In Evolutionary Methods for Design, Optimization and Control with Applications to Industrial Problems (EUROGEN 2001), edited by K. C. Giannakoglou, D. T. Tsahalis, J. Periaux, K. D. Papailiou, and T. Fogarty, 95–100. Barcelona, Spain: International Center for Numerical Methods in Engineering (CIMNE).
  • Zoutendijk, G. 1960. Methods of Feasible Directions. Amsterdam: Elsevier.

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.