From theORy to application: learning to optimize with Operations Research in an interactive way

Authors

Alessandro Bombelli, Department of Control and Operations, Faculty of Aerospace Engineering, Delft University of Technology, The Netherlands; Bilge Atasoy, Department of Marine and Transport Technology, Faculty of Mechanical Engineering, Delft University of Technology, The Netherlands; Stefano Fazi, Department of Engineering, Systems and Services, Faculty of Technology, Policy and Management, Delft University of Technology, The Netherlands; Doris Boschma, Gamelab, Faculty of Technology, Policy and Management, Delft University of Technology, The Netherlands
Keywords: Operations Research, Open Education, Mathematical Modeling, Serious Games

Synopsis

This book serves as a comprehensive roadmap for navigating the realm of Operations Research (OR). From laying down fundamental mathematical principles to crafting precise modeling techniques and their solution methods, it culminates in a panoramic view of OR models mirroring real-world operations. Delving into diverse applications-from assignment problems to network problems like graph coloring and minimum spanning trees, and navigating through routing problems that are very common in logistics-the book equips readers with practical insights. Each model is accompanied by meticulously detailed examples, seamlessly integrated with hyperlinked codes accessible via an open repository. Moreover, it introduces an engaging dimension with hyperlinks to three serious games replicating some cornerstone OR models, offering a playful yet educational environment for solo or group experimentation.

Downloads

Download data is not yet available.

Author Biographies

Alessandro Bombelli, Department of Control and Operations, Faculty of Aerospace Engineering, Delft University of Technology, The Netherlands

Alessandro Bombelli is an assistant professor in the Air Transport & Operations section.

Bilge Atasoy, Department of Marine and Transport Technology, Faculty of Mechanical Engineering, Delft University of Technology, The Netherlands

Bilge Atasoy is an associate professor in the Transport Engineering & Logistics section.

Stefano Fazi, Department of Engineering, Systems and Services, Faculty of Technology, Policy and Management, Delft University of Technology, The Netherlands

Stefano is an assistant professor in the Transport and Logistics section.

Doris Boschma, Gamelab, Faculty of Technology, Policy and Management, Delft University of Technology, The Netherlands

Doris Boschma worked as a designer and project leader at the Gamelab.

References

Adjacency List of States of the United States (US) (2024).https://writeonly.wordpress.com/2009/03/20/adjacency-list-of-states-of-the-united-states-us/. Accessed: 2024-02-19

Ali, S., A. G. Ramos, M. A. Carravilla, and J. F. Oliveira (2022). On-line three-dimensional packing problems:A review of off-line and on-line solution approaches. Computers & Industrial Engineering168, p. 108122. https://doi.org/10.1016/j.cie.2022.108122

Beliën, J., J. Colpaert, L. De Boeck, J. Eyckmans, and W. Leirens (2013). Teaching integer programming starting from an energy supply game. INFORMS Transactions on Education13.3, pp. 129-137 https://doi.org/10.1287/ited.2013.0105

Birge, J. R. and F. Louveaux (2011).Introduction to stochastic programming. Springer Science & Business Media https://doi.org/10.1007/978-1-4614-0237-4

Brandão, J. C. S. and A. Mercer (1998). The multi-trip vehicle routing problem. Journal of the Operational Research Society49, pp. 799-805 https://doi.org/10.1057/palgrave.jors.2600595

Burrito Optimization Game (2024).https://www.gurobi.com/burrito-optimization-game/. Accessed:2024-03-02

Cacchiani, V., M. Iori, A. Locatelli, and S. Martello (2022a). Knapsack problems-An Overview of Recent Advances. Part I: Single Knapsack Problems.Computers & Operations Research 143, p. 105692 https://doi.org/10.1016/j.cor.2021.105692

Cacchiani, V., M. Iori, A. Locatelli, and S. Martello (2022b). Knapsack problems-An overview of recentadvances. Part II: Multiple, multidimensional, and quadratic Knapsack problems.Computers & OperationsResearch143, p. 105693 https://doi.org/10.1016/j.cor.2021.105693

Carter, M., C. C. Price, and G. Rabadi (2018).Operations Research: a practical introduction. Crc Press https://doi.org/10.1201/9781315153223

Cattaruzza, D., N. Absi, and D. Feillet (2016). The Multi-Trip Vehicle Routing Problem with Time Windows and Release Dates. Transportation Science 50.2, pp. 676-693 https://doi.org/10.1287/trsc.2015.0608

Cochran, J. J. (2015). Extending "Lego®my Simplex".INFORMS Transactions on Education15.3, pp. 224-231 https://doi.org/10.1287/ited.2015.0139

Columbia University: IEOR 6614 course notes (2024).https://www.columbia.edu/~cs2035/courses/ieor6614.S16/mst-lp.pdf. Accessed: 2024-02-22

Cordeau, J.-F. and G. Laporte (2007). The dial-a-ride problem: models and algorithms.Annals of OperationsResearch153, pp. 29-46 https://doi.org/10.1007/s10479-007-0170-8

Dantzig, G., R. Fulkerson, and S. Johnson (1954). Solution of a Large-Scale Traveling-Salesman Problem.Journal of the Operations Research Society of America2.4, pp. 393-410 https://doi.org/10.1287/opre.2.4.393

Daş, G. S., F. Gzara, and T. Stützle (2020). A review on airport gate assignment problems: Single versus multiobjective approaches.Omega92, p. 102146 https://doi.org/10.1016/j.omega.2019.102146

Desaulniers, G., J. Desrosiers, and M. M. Solomon (2006).Column Generation. Vol. 5. Springer Science &Business Media https://doi.org/10.1007/b135457

Dumas, Y., J. Desrosiers, and F. Soumis (1991). The pickup and delivery problem with time windows .European Journal of Operational Research 54.1, pp. 7-22 https://doi.org/10.1016/0377-2217(91)90319-Q

ELB learning (2024).https : / / blog . elblearning . com / the - key - difference - between - serious -games-and-gamification-in-elearning#:~:text=The%20key%20difference%20between%20the,educational%20value%20and%20not%20simply. Accessed: 2024-03-02

Elshaer, R. and H. Awad (2020). A taxonomic review of metaheuristic algorithms for solving the vehiclerouting problem and its variants. Computers & Industrial Engineering140, p. 106242 https://doi.org/10.1016/j.cie.2019.106242

Essame, C. (2020). Developmental play: a new approach to understanding how all children learn throughplay. Childhood Education 96.1, pp. 14-23 https://doi.org/10.1080/00094056.2020.1707531

Gendreau, M., G. Laporte, and R. Séguin (1996). Stochastic vehicle routing. European Journal of Operational Research88.1, pp. 3-12 https://doi.org/10.1016/0377-2217(95)00050-X

Guo, B., Y. Zhang, J. Hu, J. Li, F. Wu, Q. Peng, and Q. Zhang (2022). Two-dimensional irregular packing problems: A review. Frontiers in Mechanical Engineering 8, p. 966691 https://doi.org/10.3389/fmech.2022.966691

Gurobi Optimization (2023).https://www.gurobi.com

Gurobi Optimizer Reference Manual: Cuts (2023).https://www.gurobi.com/documentation/current/refman/cuts.html.

Hillier, F. S. and G. J. Lieberman (2015).Introduction to Operations Research. McGraw-Hill

IBM ILOG CPLEX Optimization Studio (2023).https://www.ibm.com/products/ilog-cplex-optimization-studio.

Johnson, E. L., G. L. Nemhauser, and M. W. Savelsbergh (2000). Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition. INFORMS Journal on Computing12.1, pp. 2-23 https://doi.org/10.1287/ijoc.12.1.2.11900

Kallehauge, B., J. Larsen, O. B. Madsen, and M. M. Solomon (2005).Vehicle Routing Problem with Time Windows. Springer. https://doi.org/10.1007/0-387-25486-2_3

Kaut, M. and W Stein (2003).Evaluation of Scenario-Generation Methods for Stochastic Programming. Humboldt-Universität zu Berlin, Mathematisch-Naturwissenschaftliche Fakultät II, Institut für Mathematik

Lahyani, R., M. Khemakhem, and F. Semet (2015). Rich vehicle routing problems: From a taxonomy to a definition. European Journal of Operational Research241.1, pp. 1-14 https://doi.org/10.1016/j.ejor.2014.07.048

Lawler, E. L., J. K. Lenstra, A. H. G. Rinnooy Kan, and D. B. Shmoys (1985).The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. Wiley https://doi.org/10.2307/2582681

Li, F., B. Golden, and E. Wasil (2007). The open vehicle routing problem: Algorithms, large-scale test problems, and computational results. Computers & Operations Research34.10, pp. 2918-2930 https://doi.org/10.1016/j.cor.2005.11.018

Matplotlib: Visualization with Python (2024).https://matplotlib.org/. Accessed: 2024-03-15

Miller, C. E., A. W. Tucker, and R. A. Zemlin (1960). Integer Programming Formulation of Traveling Salesman Problems. Journal of the ACM (JACM)7.4, pp. 326-329 https://doi.org/10.1145/321043.321046

OR in an OB World (2024).https://orinanobworld.blogspot.com/2018/09/choosing-big-m-values.html#:~:text=First%2C%20branch%2Dand%2Dbound, (producing%20very%20loose%20bounds)..Accessed: 2024-03-09

Paquay, C., M. Schyns, and S. Limbourg (2016). A mixed integer programming formulation for the three-dimensional bin packing problem deriving from an air cargo application. International Transactions in Operational Research23.1-2, pp. 187-213 https://doi.org/10.1111/itor.12111

Pillac, V., M. Gendreau, C. Guéret, and A. L. Medaglia (2013). A review of dynamic vehicle routing problems. European Journal of Operational Research225.1, pp. 1-11 https://doi.org/10.1016/j.ejor.2012.08.015

Postek, K., A. Zocca, J. Gromicho, and J. Kantor (2024).Hands-On Optimization with Python. Online.url:https://mobook.github.io/MO-book/

Salkin, H. M., K. Mathur, and R. Haas (1989).Foundations of Integer Programming. Elsevier Science Ltd

The Beergame (2024).https://beergame.org/the-game/. Accessed: 2024-03-02

Toth, P. and D. Vigo (2002).The vehicle routing problem. SIAM. https://doi.org/10.1137/1.9780898718515

Trudeau, R. J. (2013).Introduction to Graph Theory. Courier Corporation

Undiyaundeye, F. A. (2013). How children learn through play. Journal of Emerging Trends in Educational Research and Policy Studies 4.3, pp. 514-516

Wikipedia: Branch & Cut (2024).https://en.wikipedia.org/wiki/Branch_and_cut. Accessed: 2024-02-06

You've got Freight (2024).https://youvegotfreight.nl/en/. Accessed: 2024-03-02

Published

April 22, 2024

License

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

Details about the available publication format: Download PDF

ISBN-13 (15)

978-94-6366-850-7