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

Documentations #15

Open
Gangstart opened this issue Feb 19, 2022 · 1 comment
Open

Documentations #15

Gangstart opened this issue Feb 19, 2022 · 1 comment

Comments

@Gangstart
Copy link

Dear author:
Thanks for your sharing! Are there any documents or paper speaking of your methods?

@hschneid
Copy link
Owner

Hi @Gangstart ,

even if I didn't used paper to implement it, the general insertion heuristic of XFLP is using similar approach like these algorithms:

The general problem of the optimization is, that genological and phenological presentations are so different. Bin packing with insertion heuristic is very dependent from the ordering in input. That means, that even small changes can have unreasonable influences to the result. I currently have no clue, how to design a solution landscape where classical optimization routines can operate efficientily. A GRASP is my current fastest and best choice.

Maybe you have an idea.

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

2 participants