A Python Implementation of the Variable MIP Neighborhood Descent Heuristic. This repository is based on the work of Larrain et al. This MIP heuristic is implemented in Gurobipy and can significantly improve performance in many routing and integer problems. Several Routing-type problems have been implemented here, nevertheless this library and method can be used for virtually every MIP!
See the Wiki for more info!
To setup dependencies:
- Create a virtual environment using python 3.7.* with 'python -m venv venv'.
- Activate local environment with 'source venv/bin/activate'.
- Install dependencies with 'pip install -r requirements.txt'.
To run examples:
- Execute any file from the exmaples folder.