The Factory Must Grow: Automation in Factorio
- URL: http://arxiv.org/abs/2102.04871v1
- Date: Tue, 9 Feb 2021 15:14:27 GMT
- Title: The Factory Must Grow: Automation in Factorio
- Authors: Kenneth N. Reid, Iliya Miralavy, Stephen Kelly, Wolfgang Banzhaf,
Cedric Gondro
- Abstract summary: In this paper we define the logistic transport belt problem and define integer programming model of it.
We present results for Simulated Annealing, quick Genetic Programming and Evolutionary Reinforcement Learning, three different meta-heuristic techniques to optimize this novel problem.
- Score: 3.877356414450363
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Efficient optimization of resources is paramount to success in many problems
faced today. In the field of operational research the efficient scheduling of
employees; packing of vans; routing of vehicles; logistics of airlines and
transport of materials can be the difference between emission reduction or
excess, profits or losses and feasibility or unworkable solutions. The video
game Factorio, by Wube Software, has a myriad of problems which are analogous
to such real-world problems, and is a useful simulator for developing solutions
for these problems. In this paper we define the logistic transport belt problem
and define mathematical integer programming model of it. We developed an
interface to allow optimizers in any programming language to interact with
Factorio, and we provide an initial benchmark of logistic transport belt
problems. We present results for Simulated Annealing, quick Genetic Programming
and Evolutionary Reinforcement Learning, three different meta-heuristic
techniques to optimize this novel problem.
Related papers
- Robotic warehousing operations: a learn-then-optimize approach to large-scale neighborhood search [84.39855372157616]
This paper supports robotic parts-to-picker operations in warehousing by optimizing order-workstation assignments, item-pod assignments and the schedule of order fulfillment at workstations.
We solve it via large-scale neighborhood search, with a novel learn-then-optimize approach to subproblem generation.
In collaboration with Amazon Robotics, we show that our model and algorithm generate much stronger solutions for practical problems than state-of-the-art approaches.
arXiv Detail & Related papers (2024-08-29T20:22:22Z) - A Graph-based Adversarial Imitation Learning Framework for Reliable & Realtime Fleet Scheduling in Urban Air Mobility [5.19664437943693]
This paper presents a comprehensive optimization formulation of the fleet scheduling problem.
It also identifies the need for alternate solution approaches.
The new imitative approach achieves better mean performance and remarkable improvement in the case of unseen worst-case scenarios.
arXiv Detail & Related papers (2024-07-16T18:51:24Z) - Solving the Team Orienteering Problem with Transformers [46.93254771681026]
Route planning for a fleet of vehicles is an important task in applications such as package delivery, surveillance, or transportation.
This paper presents a multi-agent route planning system capable of solving the Team Orienteering Problem in a very fast and accurate manner.
arXiv Detail & Related papers (2023-11-30T16:10:35Z) - Adiabatic Quantum Computing for Logistic Transport Optimization [0.0]
We aim to tackle the vehicle optimization problem from the last mile logistic scenario application.
We provide the results of the analysis and proposal for the consideration of applications in a near term business case scenario.
arXiv Detail & Related papers (2023-01-18T18:27:41Z) - Learning to Optimize Permutation Flow Shop Scheduling via Graph-based
Imitation Learning [70.65666982566655]
Permutation flow shop scheduling (PFSS) is widely used in manufacturing systems.
We propose to train the model via expert-driven imitation learning, which accelerates convergence more stably and accurately.
Our model's network parameters are reduced to only 37% of theirs, and the solution gap of our model towards the expert solutions decreases from 6.8% to 1.3% on average.
arXiv Detail & Related papers (2022-10-31T09:46:26Z) - Combining Reinforcement Learning and Optimal Transport for the Traveling
Salesman Problem [18.735056206844202]
We show that we can construct a model capable of learning without supervision and inferences significantly faster than current autoregressive approaches.
We also empirically evaluate the benefits of including optimal transport algorithms within deep learning models to enforce assignment constraints during end-to-end training.
arXiv Detail & Related papers (2022-03-02T07:21:56Z) - Comparing Heuristics, Constraint Optimization, and Reinforcement
Learning for an Industrial 2D Packing Problem [58.720142291102135]
Cutting and Packing problems are occurring in different industries with a direct impact on the revenue of businesses.
Machine learning is increasingly used for solving such problems.
arXiv Detail & Related papers (2021-10-27T15:47:47Z) - An SMT Based Compositional Model to Solve a Conflict-Free Electric
Vehicle Routing Problem [2.64699517152535]
The Electric Conflict-Free Vehicle Routing Problem (CF-EVRP) involves constraints such as limited operating range of the vehicles, time windows on the delivery to the customers, and limited capacity on the number of vehicles the road segments can accommodate.
We develop a compositional model that breaks down the problem into smaller and simpler sub-problems and provides sub-optimal, feasible solutions.
arXiv Detail & Related papers (2021-06-10T20:37:46Z) - Offline Model-Based Optimization via Normalized Maximum Likelihood
Estimation [101.22379613810881]
We consider data-driven optimization problems where one must maximize a function given only queries at a fixed set of points.
This problem setting emerges in many domains where function evaluation is a complex and expensive process.
We propose a tractable approximation that allows us to scale our method to high-capacity neural network models.
arXiv Detail & Related papers (2021-02-16T06:04:27Z) - Constraint Programming Algorithms for Route Planning Exploiting
Geometrical Information [91.3755431537592]
We present an overview of our current research activities concerning the development of new algorithms for route planning problems.
The research so far has focused in particular on the Euclidean Traveling Salesperson Problem (Euclidean TSP)
The aim is to exploit the results obtained also to other problems of the same category, such as the Euclidean Vehicle Problem (Euclidean VRP), in the future.
arXiv Detail & Related papers (2020-09-22T00:51:45Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.