References
- Abramson, Mark A., Charles Audet, James W. Chrissis, and Jennifer G. Walston. 2009. “Mesh Adaptive Direct Search Algorithms for Mixed Variable Optimization.” Optimization Letters 3 (1): 35–47. doi:https://doi.org/10.1007/s11590-008-0089-2.
- Audet, Charles, Jean Bigeon, Dominique Cartier, Sébastien Le Digabel, and Ludovic Salomon. 2018. Performance Indicators in Multiobjective Optimization. Technical Report G-2018-90. Montréal (Québec), Canada: GERAD. https://www.gerad.ca/fr/papers/G-2018-90.
- De Backer, Bruno, Vincent Furnon, Paul Shaw, Philip Kilby, and Patrick Prosser. 2000. “Solving Vehicle Routing Problems Using Constraint Programming and Metaheuristics.” Journal of Heuristics 6 (4): 501–523. doi:https://doi.org/10.1023/A:1009621410177.
- Blum, Christian, Carlos Cotta, Antonio J. Fernández, José E. Gallardo, and Monaldo Mastrolilli. 2008. “Hybridizations of Metaheuristics with Branch & Bound Derivates.” In Hybrid Metaheuristics: An Emerging Approach to Optimization, edited by Christian Blum, Maria José Blesa Aguilera, Andrea Roli, and Michael Sampels, Vol. 114 of Studies in Computational Intelligence, 85–116. Berlin: Springer. doi:https://doi.org/10.1007/978-3-540-78295-7_4.
- Blum, Christian, Jakob Puchinger, Günther R. Raidl, and Andrea Roli. 2011. “Hybrid Metaheuristics in Combinatorial Optimization: A Survey.” Applied Soft Computing 11 (6): 4135–4151. http://www.sciencedirect.com/science/article/pii/S1568494611000962.
- Cacchiani, Valentina, and Claudia D'Ambrosio. 2017. “A Branch-and-Bound Based Heuristic Algorithm for Convex Multi-Objective MINLPs.” European Journal of Operational Research 260 (3): 920–933. http://www.sciencedirect.com/science/article/pii/S0377221716308487.
- Cotta, Carlos, and José M. Troya. 2003. “Embedding Branch and Bound Within Evolutionary Algorithms.” Applied Intelligence 18 (2): 137–153. doi:https://doi.org/10.1023/A:1021934325079.
- Črepinšek, Matej, Shih-Hsi Liu, and Marjan Mernik. 2013. “Exploration and Exploitation in Evolutionary Algorithms: A Survey.” ACM Computing Surveys 45 (3): 1–33. doi:https://doi.org/10.1145/2480741.2480752.
- Custódio, A. L., J. F. A. Madeira, A. I. F. Vaz, and L. N. Vicente. 2011. “Direct Multisearch for Multiobjective Optimization.” SIAM Journal on Optimization 21 (3): 1109–1140. doi:https://doi.org/10.1137/10079731X.
- Deb, Kalyanmoy. 2001. Multi-Objective Optimization Using Evolutionary Algorithms. Chichester, UK: Wiley.
- Deb, K., A. Pratap, S. Agarwal, and T. Meyarivan. 2002. “A Fast and Elitist Multiobjective Genetic Algorithm: NSGA-II.” IEEE Transactions on Evolutionary Computation 6 (2): 182–197. http://ieeexplore.ieee.org/document/996017/.
- Deb, Kalyanmoy, Amrit Pratap, and Subrajyoti Moitra. 2000. “Mechanical Component Design for Multiple Objectives Using Elitist Non-Dominated Sorting GA.” In Proceedings of the International Conference on Parallel Problem Solving from Nature (PPSN VI), edited by Marc Schoenauer, Kalyanmoy Deb, Günther Rudolph, Xin Yao, Evelyne Lutton, Juan Julian Merelo, and Hans-Paul Schwefel, Vol. 117 of Lecture Notes in Computer Science, 859–868. Berlin: Springer. doi:https://doi.org/10.1007/3-540-45356-3_84.
- Dimkou, T. I., and K. P. Papalexandri. 1998. “A Parametric Optimization Approach for Multiobjective Engineering Problems Involving Discrete Decisions.” Computers & Chemical Engineering 22: S951–S954. http://www.sciencedirect.com/science/article/pii/S0098135498001884.
- Ehrgott, Matthias, and Xavier Gandibleux. 2008. “Hybrid Metaheuristics for Multi-Objective Combinatorial Optimization.” In Hybrid Metaheuristics: An Emerging Approach to Optimization, edited by Christian Blum, Maria José Blesa Aguilera, Andrea Roli, and Michael Sampels, Vol. 114 of Studies in Computational Intelligence, 221–259. Berlin: Springer. doi:https://doi.org/10.1007/978-3-540-78295-7_8.
- El Samrout, Ahmad. 2019. “Hybridization of Multicriteria Metaheuristic Optimization Methods for Mechanical Problems.” PhD diss., Université de Technologie de Troyes, Troyes, France. http://lasmis.utt.fr/.
- Florios, Kostas, George Mavrotas, and Danae Diakoulaki. 2010. “Solving Multiobjective, Multiconstraint Knapsack Problems Using Mathematical Programming and Evolutionary Algorithms.” European Journal of Operational Research 203 (1): 14–21. http://www.sciencedirect.com/science/article/pii/S0377221709004974.
- Giraud, Laurence, and Pascal Lafon. 1999. “Optimal Design of Mechanical Components with Genetic Algorithm.” In Proceedings of the 2nd Conference on Integrated Design and Manufacturing in Mechanical Engineering (IDMME'98), edited by Jean-Louis Batoz, Patrick Chedmail, Gerard Cognet, and Clément Fortin, 93–100. Dordrecht, The Netherlands: Springer Science+Business Media. doi:https://doi.org/10.1007/978-94-015-9198-0_12.
- Giraud-Moreau, Laurence, and Pascal Lafon. 2002. “Comparison of Evolutionary Algorithms for Mechanical Design Components.” Engineering Optimization 34 (3): 307–322. doi:https://doi.org/10.1080/03052150211750.
- Jozefowiez, Nicolas, Frédéric Semet, and El-Ghazali Talbi. 2007. “The Bi-Objective Covering Tour Problem.” Computers & Operations Research 34 (7): 1929–1942. doi:https://doi.org/10.1016/j.cor.2005.07.022.
- Kiziltan, Gülseren, and Erkut Yucaolu. 1983. “An Algorithm for Multiobjective Zero–One Linear Programming.” Management Science 29 (12): 1444–1453. doi:https://doi.org/10.1287/mnsc.29.12.1444.
- Land, A. H., and A. G. Doig. 1960. “An Automatic Method of Solving Discrete Programming Problems.” Econometrica 28 (3): 497–520. https://www.jstor.org/stable/1910129.
- Li, Hui, and Qingfu Zhang. 2009. “Multiobjective Optimization Problems with Complicated Pareto Sets, MOEA/D and NSGA-II.” IEEE Transactions on Evolutionary Computation 13 (2): 284–302. https://scholars.cityu.edu.hk/en/publications/multiobjective-optimization-problems-with-complicated-pareto-sets-moea-d-and-nsgaii(075fdef8-5aab-4a46-b7ce-1199deaf1184).html.
- Maruyama, Shohei, and Tomoaki Tatsukawa. 2017. “A Parametric Study of Crossover Operators in Pareto-Based Multiobjective Evolutionary Algorithm.” In Proceedings of the 8th International Conference on Advances in Swarm Intelligence (ICSI 2017), 3–14. Springer-Verlag. doi:https://doi.org/10.1007/978-3-319-61833-3_1.
- Mavrotas, G., and D. Diakoulaki. 1998. “A Branch and Bound Algorithm for Mixed Zero–One Multiple Objective Linear Programming.” European Journal of Operational Research 107 (3): 530–541. http://www.sciencedirect.com/science/article/pii/S0377221797000775.
- Mela, K., J. Koski, and R. Silvennoinen. 2007. “Algorithm for Generating the Pareto Optimal Set of Multiobjective Nonlinear Mixed-Integer Optimization Problems.” In Proceedings of the 3rd AIAA Multidisciplinary Design Optimization Specialist Conference, Vol. 2, 2026–2042. Reston, VA: AIAA.
- Montgomery, Douglas C. 2017. Design and Analysis of Experiments. 9th ed. Hoboken, NJ: Wileyhttps://www.wiley.com/en-gb/Design+and+Analysis+of+Experiments\%2C+9th+Edition-p-9781119320937.
- Nagar, Amit, Sunderesh S. Heragu, and Jorge Haddock. 1996. “A Combined Branch-and-Bound and Genetic Algorithm Based Approach for a Flowshop Scheduling Problem.” Annals of Operations Research 63 (3): 397–414. doi:https://doi.org/10.1007/BF02125405s.
- Osyczka, A., and S. Kundu. 1995. “A New Method to Solve Generalized Multicriteria Optimization Problems Using the Simple Genetic Algorithm.” Structural Optimization 10 (2): 94–99. doi:https://doi.org/10.1007/BF01743536.
- Przybylski, Anthony, and Xavier Gandibleux. 2017. “Multi-Objective Branch and Bound.” European Journal of Operational Research 260 (3): 856–872. http://www.sciencedirect.com/science/article/pii/S037722171730067X.
- Puchinger, Jakob, and Günther R. Raidl. 2005. “Combining Metaheuristics and Exact Algorithms in Combinatorial Optimization: A Survey and Classification.” In Proceedings of the First International Work-Conference on the Interplay Between Natural and Artificial Computation—Artificial Intelligence and Knowledge Engineering Applications: A Bioinspired Approach (IWINAC'05), edited by José Mira and José R. Álvarez, Vol. 3562 of Lecture Notes in Computer Science, 41–53. Berlin: Springer-Verlag. doi:https://doi.org/10.1007/11499305_5.
- Puchinger, Jakob, Günther R. Raidl, and Gabriele Koller. 2004. “Solving a Real-World Glass Cutting Problem.” In Proceedings of the European Conference on Evolutionary Computation in Combinatorial Optimization (EvoCOP 2004), edited by Jens Gottlieb and Günther R. Raidl, Vol. 3004 of Lecture Notes in Computer Science, 165–176. Berlin: Springer. doi:https://doi.org/10.1007/978-3-540-24652-7_17.
- Rao, R. Venkata, and Vimal J. Savsani. 2012. Mechanical Design Optimization Using Advanced Optimization Techniques. Part of the Springer Series in Advanced Manufacturing. London: Springer. doi:https://doi.org/10.1007/978-1-4471-2748-2.
- Talbi, El-Ghazali. 2009. Metaheuristics: From Design to Implementation. Hoboken, NJ: Wiley doi:https://doi.org/10.1002/9780470496916
- Tong, Weiyang, Souma Chowdhury, and Achille Messac. 2016. “A Multi-Objective Mixed–Discrete Particle Swarm Optimization with Multi-Domain Diversity Preservation.” Structural and Multidisciplinary Optimization 53 (3): 471–488. doi:https://doi.org/10.1007/s00158-015-1319-8.
- Van Veldhuizen, D. A., and G. B. Lamont. 2000. “On Measuring Multiobjective Evolutionary Algorithm Performance.” In Proceedings of the 2000 Congress on Evolutionary Computation (CEC00) (Cat. No. 00TH8512), Vol. 1, 204–211. Piscataway, NJ: IEEE. doi:https://doi.org/10.1109/CEC.2000.870296.
- Wang, Shijin, and Ming Liu. 2013. “A Heuristic Method for Two-Stage Hybrid Flow Shop with Dedicated Machines.” Computers & Operations Research 40 (1): 438–450. http://www.sciencedirect.com/science/article/pii/S030505481200161X.
- Woodruff, David L. 1999. “A Chunking Based Selection Strategy for Integrating Meta-Heuristics with Branch and Bound.” In Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, edited by Stefan Voß, Silvano Martello, Ibrahim H. Osman, and Catherine Roucairol, 499–511. Boston, MA: Springer US. doi:https://doi.org/10.1007/978-1-4615-5775-3_34.