Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Questions on heuristics for MCLP #8

Open
huanfachen opened this issue Jan 9, 2019 · 3 comments
Open

Questions on heuristics for MCLP #8

huanfachen opened this issue Jan 9, 2019 · 3 comments

Comments

@huanfachen
Copy link
Contributor

Hi Aaron,

Thanks for developing this package. It is so cool.

In this package, the location models are solved by tools that are supported py PuLP (Gurobi, GLPK...). However, when the problem size becomes large, the exact solvers will converge slowly and take a long time. I am interested to know if there is any existing package that solves the location models (e.g. maximum coverage location problem) using heuristics, such as genetic algorithms.

Thank you very much for your suggestions.

@apulverizer
Copy link
Owner

Hi @huanfachen I'm not aware of any packages that can solve these problems out of the box using other approaches like simulated annealing or genetic algorithms.

@isaldiviagonzatti
Copy link

Hi! I am in the same position, looking for an implementation of a metaheuristic method for a Facility Location Problem. Did you have any luck, @huanfachen. There doesn't seem to be many examples out there. Thanks

@alexalogistics
Copy link

Hi! I am looking for a genetic algorithm for the Maximum coverage problem. Does anyone know where I could find a code?

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

4 participants