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

Using SOM to find best bath in picking warehouse process #9

Closed
minels opened this issue May 18, 2022 · 1 comment
Closed

Using SOM to find best bath in picking warehouse process #9

minels opened this issue May 18, 2022 · 1 comment

Comments

@minels
Copy link

minels commented May 18, 2022

Hi Diego,
I've just seen your work regarding self-organized map in salesman problem and I thank you for share your work.. I was looking some salesman problem solution because I'd like to implement something similar applied the process of peaces picking in my firm's warehouse.
Let me explain the issue: suppose there's a order of production included all peaces needed to accomplish that order.. naturally each peace is located in a different place of the warehouse... so it'll be usefull to find the best way.
I just need to change distance.py class due I'm not going to use euclidean metric...
Am I right?

@diego-vicente
Copy link
Owner

Closing this issue since... Well it's not really an issue

Just to address your question really quick: yes, you're absolutely right, but bear in mind that for a reasonably sized warehouse and list of parts you should be looking into operational research and other optimal methods, since this is just an approximation

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