Journal Browser
Open Access Journal Article

Machine Learning Approaches to Operations Research Problems

by Daniel Jackson 1,*
1
Daniel Jackson
*
Author to whom correspondence should be addressed.
Received: 22 January 2021 / Accepted: 26 February 2021 / Published Online: 14 March 2021

Abstract

The integration of machine learning techniques within operations research has become a pivotal area of research, as these methods offer sophisticated tools for solving complex optimization problems. This paper explores various machine learning approaches applied to operations research problems, highlighting their potential to enhance decision-making processes and improve efficiency. We begin by introducing the foundational principles of operations research and the benefits of incorporating machine learning. Subsequently, we delve into the application of machine learning algorithms in different operations research domains, including network flow optimization, inventory management, and scheduling problems. We discuss the strengths and limitations of each approach, and provide insights into how these methods can be tailored to specific operational contexts. Finally, we offer recommendations for further research in this interdisciplinary field, emphasizing the importance of understanding the underlying assumptions and the potential impact on decision quality.


Copyright: © 2021 by Jackson. This is an open-access article distributed under the terms of the Creative Commons Attribution License (CC BY) (Creative Commons Attribution 4.0 International License). The use, distribution or reproduction in other forums is permitted, provided the original author(s) or licensor are credited and that the original publication in this journal is cited, in accordance with accepted academic practice. No use, distribution or reproduction is permitted which does not comply with these terms.
Cite This Paper
APA Style
Jackson, D. (2021). Machine Learning Approaches to Operations Research Problems. Operations Research and Statistics, 3(1), 17. doi:10.69610/j.ors.20210314
ACS Style
Jackson, D. Machine Learning Approaches to Operations Research Problems. Operations Research and Statistics, 2021, 3, 17. doi:10.69610/j.ors.20210314
AMA Style
Jackson D. Machine Learning Approaches to Operations Research Problems. Operations Research and Statistics; 2021, 3(1):17. doi:10.69610/j.ors.20210314
Chicago/Turabian Style
Jackson, Daniel 2021. "Machine Learning Approaches to Operations Research Problems" Operations Research and Statistics 3, no.1:17. doi:10.69610/j.ors.20210314

Share and Cite

ACS Style
Jackson, D. Machine Learning Approaches to Operations Research Problems. Operations Research and Statistics, 2021, 3, 17. doi:10.69610/j.ors.20210314
AMA Style
Jackson D. Machine Learning Approaches to Operations Research Problems. Operations Research and Statistics; 2021, 3(1):17. doi:10.69610/j.ors.20210314
Chicago/Turabian Style
Jackson, Daniel 2021. "Machine Learning Approaches to Operations Research Problems" Operations Research and Statistics 3, no.1:17. doi:10.69610/j.ors.20210314
APA style
Jackson, D. (2021). Machine Learning Approaches to Operations Research Problems. Operations Research and Statistics, 3(1), 17. doi:10.69610/j.ors.20210314

Article Metrics

Article Access Statistics

References

  1. Burbules, N. C., & Callister, T. A. (2000). Watch IT: The Risks and Promises of Information Technologies for Education. Westview Press.
  2. Daskin, M. S. (1999). Network and discrete location: models, algorithms, and applications. John Wiley & Sons.
  3. Jordan, M. I. (1998). An introduction to probabilistic graphical models. Kluwer Academic Publishers.
  4. Holland, J. H. (1992). Adaptation in natural and artificial systems: an introductory analysis with applications to biology, chemistry, and economics. University of Michigan Press.
  5. Eiben, A. E., & Smith, J. E. (2003). Introduction to evolutionary computation. Springer Science & Business Media.
  6. Deb, K., Pratap, A., Agarwal, S., & Meyarivan, T. (2002). A fast and elitist multi-objective genetic algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation, 6(2), 182-197.
  7. van der Heijden, P. A. (2002). A multi-objective genetic algorithm for the facility layout problem. Computers & Operations Research, 29(8), 873-890.
  8. van Aerde, A. W. M., & Salamin, K. (2002). A genetic algorithm for the shortest path problem in networks. Computational Optimization and Applications, 22(2), 157-172.
  9. Zeng, W., & Li, H. (2011). A genetic algorithm for the multi-constrained facility location problem. European Journal of Operational Research, 215(2), 416-426.
  10. Krumke, S., & Krzakala, F. (2001). Visualization of the flow of information in neural networks. Physical Review E, 64(2), 026112.
  11. Wang, Y., & Han, J. (2006). A novel routing strategy for mobile ad-hoc networks Based on k-means clustering. Ad Hoc & Sensor Wireless Networks, 3(2), 125-145.
  12. Haghani, A., & Rester, P. L. (2002). Traffic flow prediction using artificial neural networks. Transportation Research Record, 1785(1), 1-8.
  13. Wang, H., & Liu, B. (2003). Short-term traffic forecasting based on genetic algorithms and neural networks. Transportation Research Part C: Emerging Technologies, 11(5), 375-385.
  14. Box, G. E. P., Jenkins, G. M., & Reinsel, G. C. (2015). Time series analysis: forecasting and control. John Wiley & Sons.
  15. Hyndman, R. J., & Athanasopoulos, G. (2018). Forecasting: principles and practice. OTexts.
  16. Boyce, C. M., & Maxwell, S. E. (1993). Efficient inventory policy for a class of random demand inventory models. Operations Research, 41(4), 725-736.
  17. Simchi-Levi, D., Kaminsky, P. M., & Simchi-Levi, E. (2008). Designing and managing the supply chain: concepts, strategies, and case studies. McGraw-Hill.
  18. Dhillon, I. S., & Wu, C. (1997). A review of inventory models with time-varying lead times and periodic review. European Journal of Operational Research, 101(2), 197-209.
  19. Simchi-Levi, D., Kaminsky, P. M., & Simchi-Levi, E. (2011). Designing and managing the supply chain: concepts, strategies, and case studies (5th ed.). McGraw-Hill.
  20. Zhang, X., & Li, Q. (2005). A multi-objective scheduling model for a flexible job shop with sequence-dependent setups. European Journal of Operational Research, 159(2), 429-447.
  21. Li, Q., & Zhang, X. (2006). A multi-objective scheduling model for a flexible job shop with sequence-dependent setups and job splitting. Computers & Operations Research, 33(9), 2493-2511.
  22. Aggarwal, R. K., &weephan, P. (2008). Scheduling algorithms for multiprocessor real-time systems. John Wiley & Sons.
  23. Rolim, J. M., & da Silva, I. G. (2004). A review of scheduling algorithms for real-time systems. Computers & Electrical Engineering, 30(5), 401-410.
  24. Chawla, N. V., Bowyer, K. W., & Kegelmeyer, W. P. (2002). SMOTE: synthetic minority over-sampling technique. Journal of Artificial Intelligence Research, 16, 321-357.
  25. Provost, F., & Fawcett, T. (2013). Data science for business: what you need to know about data mining and data-analytic thinking. O'Reilly Media.
  26. Marcus, G., & Hinton, G. E. (1993). A comparison of models for selective attention in visual scene analysis. In International joint conference on artificial intelligence (Vol. 2, No. 1, pp. 21-27). MIT Press.