Skip to content

Latest commit

 

History

History
29 lines (17 loc) · 694 Bytes

README.md

File metadata and controls

29 lines (17 loc) · 694 Bytes

ISOP Project

Mathematical model, brute-force algorithm, and evolutionary algorithm for solving the internet shopping optimization problem.

Usage

Make sure to first install requirements.

Mathematical Model

  1. Go to pyomo-algorithm.
  2. Run scenario1.py or scenario2.py.

Brute-force Algorithm

  1. Go to brute-force-algorithm.
  2. Run scenario1.py or scenario2.py.

Evolutionary Algorithm

  1. Go to evolutionary-algorithm.
  2. Run scenario1.py or scenario2.py.

License

License

  • MIT license
  • Copyright 2022 © Juan Romero & Juan Alegría