This project addresses the challenging problem of multi-capacity and multi-level localization by integrating two distinct models: the multi-capacity localization problem with a budget constraint and the localization problem with multiple levels of assignment and capacity constraints. The nature of this problem involves combinatorial analysis, a classic category in computer science and mathematics.
The central objective of this project is to find the optimal configuration of locations for a set of elements, such as factories, while adhering to specific constraints. The problem holds significant importance in various domains, necessitating a systematic approach and powerful software tools for its solution.
- Integration of two distinct models: multi-capacity localization with a budget constraint and localization with multiple levels of assignment and capacity constraints.
- Combinatorial analysis to address the complexity of the problem.
- Identification of the optimal configuration of locations for a set of elements, respecting specific constraints.
-
Clone the repository:
git clone https://github.com/Mahmoud9876/locationProblem.git
-
Install the required dependencies:
cplex.jar oplall.jar
Contributions are welcome! If you would like to contribute to this project, please follow the guidelines in the CONTRIBUTING.md file.
This project is licensed under the MIT License.
We would like to express our gratitude to the contributors and the open-source community for their support and collaboration.
Feel free to contact us for any questions or feedback.
Happy coding! 🚀