https://github.com/sproc01/alcuinproblem

A resolver for a generic Alcuin problem
https://github.com/sproc01/alcuinproblem

alcuin cplex cplex-optimization-solver graph matplotlib mip networkx numpy operations-research optimization pandas pyomo python python3 seaborn

Last synced: about 1 month ago
JSON representation

A resolver for a generic Alcuin problem

• Host: GitHub
• URL: https://github.com/sproc01/alcuinproblem
• Owner: Sproc01
• License: mit
• Created: 2023-02-28T14:13:41.000Z (almost 2 years ago)
• Default Branch: main
• Last Pushed: 2023-09-06T09:01:16.000Z (over 1 year ago)
• Last Synced: 2024-01-27T11:33:38.876Z (11 months ago)
• Topics: alcuin, cplex, cplex-optimization-solver, graph, matplotlib, mip, networkx, numpy, operations-research, optimization, pandas, pyomo, python, python3, seaborn
• Language: Shell
• Homepage:
• Size: 41.3 MB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE.md

Awesome Lists containing this project

README

        
# AlcuinProblem

This project has the goal to study how much time is necessary to find if the generalization of Alcuin river crossing problem is feasible for a given graph and for a given number. This project comprehends different parts:

- The model definition and resolver (requires CPLEX and Pyomo Python package)

- The graph generator (requires Networkx Python package)

- A file that convert the output from the graph generator to a dat file that can be used as input for the MIP resolver

- A file that execute the model for all the graphs with CPLEX seed=0

- A file that create SLURM file for all the graphs, each graph has 6 SLURM files because each graph must be resolved with 6 different CPLEX seed

- A file for elaboration of the result (requires some Python package: Numpy, Matplotlib, Seaborn, Pandas)

- A simple example of river crossing problem (graph: L-P-C) with the definition of a concrete and an abstract model

This program also shows some graphs about the time and one about the Alcuin Number of a graph highlighting the dependence between this number and the density of the graph.

This study is the center of my bachelor's degree thesis at University of Padua.

# Requires

- Python version 3.9

- Numpy version 1.24.2

- Pyomo version 6.5.0

- CPLEX version 22.1.1 and his Python bindings

- Networkx version 3.1

- Matplotlib version 3.7.1

- Seaborn version 0.12.2

- Pandas version 2.0.1