ATTENTION/WARNING - NE PAS DÉPOSER ICI/DO NOT SUBMIT HERE

Ceci est la version de TEST de DIAL.mem. Veuillez ne pas soumettre votre mémoire sur ce site mais bien à l'URL suivante: 'https://thesis.dial.uclouvain.be'.
This is the TEST version of DIAL.mem. Please use the following URL to submit your master thesis: 'https://thesis.dial.uclouvain.be'.
 

Satisfactory: optimizing production planning in a video game

Clercq, Hugo ; Laurez, Andy
(2023)

Files

Clercq_07031700_Laurez_10291700_2023.pdf
  • UCLouvain restricted access
  • Adobe PDF
  • 3.9 MB

Details

Supervisors
Schaus, Pierre
Faculty
Ecole polytechnique de Louvain
Degree label
Master [120] en sciences informatiques, à finalité spécialisée
Abstract
This master's thesis focuses on optimizing production planning in the video game Satisfactory, with the objective of developing applicable models for real-world plants to minimize total space utilization, power consumption, and raw material usage. The thesis is structured into several chapters, encompassing an introduction to the game and its key terminology, a project overview, a detailed description of the linear programming module, an explanation of the graph module, an in-depth exploration of the constraint programming module, a section dedicated to experimental procedures and obtained results, and finally, a chapter discussing potential future works. The linear programming module aims to optimize the production process by minimizing costs and maximizing efficiency. The graph module provides a graphical representation that assists in determining the optimal order for placing buildings in the constraint programming module. This representation also facilitates the calculation of the required number and placement of splitters and mergers within the factory. Subsequently, the constraint programming (CP) module is employed to model a factory that respects the user request, ultimately identifying the most optimal layout within minimal space.