Timeline for Working with large models
Current License: CC BY-SA 4.0
16 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 5, 2021 at 15:28 | history | edited | RobPratt |
edited tags
|
|
| Jan 5, 2021 at 8:59 | answer | added | Hexaly | timeline score: 3 | |
| Jan 5, 2021 at 8:36 | comment | added | ooo | @fontanf thanks for the link I will look into it, but I am looking to test it on larger nodes. | |
| Jan 5, 2021 at 8:23 | comment | added | fontanf | Your objective does not contain the distances and I don't see time constraints. Therefore, if I'm not wrong, assigning each vehicle to any customers with non null remaining demand such that all its goods are delivered seems to provide a feasible optimal solution | |
| Jan 5, 2021 at 8:08 | comment | added | fontanf | It looks like a "vehicle routing problem with split deliveries" scholar.google.fr/… | |
| Jan 5, 2021 at 6:19 | comment | added | ooo | @LarrySnyder610 I needed help with these formulation as number of nodes increases ram requirement grows exponentially my goal is to test 2500-3000, wanted to know if it will be possible or not (I have edited by question). | |
| Jan 5, 2021 at 6:16 | comment | added | ooo | @RobPratt I have added the formulation . | |
| Jan 5, 2021 at 6:14 | history | edited | ooo | CC BY-SA 4.0 |
added 1123 characters in body
|
| Jan 5, 2021 at 5:54 | history | edited | ooo | CC BY-SA 4.0 |
added 1123 characters in body
|
| Jan 5, 2021 at 5:43 | history | edited | ooo | CC BY-SA 4.0 |
added 1123 characters in body
|
| Jan 4, 2021 at 21:32 | comment | added | LarrySnyder610 | Just plain regular classical TSP. | |
| Jan 4, 2021 at 20:56 | comment | added | Kuifje | @LarrySnyder610 what is vanilla tsp? | |
| Jan 4, 2021 at 20:21 | comment | added | LarrySnyder610 | Also, if your goal is only to solve "vanilla" TSP, there are better ways to do it (e.g., using Concorde) than formulating the MIP and solving it directly. | |
| Jan 4, 2021 at 20:20 | comment | added | LarrySnyder610 | In general, large-scale models are hard to solve and TSP is one of the worst. But it would help to know if you are looking for suggestions about TSP specifically, or about large-scale optimization in general. And as @RobPratt, including details of your formulation would help. | |
| Jan 4, 2021 at 18:21 | comment | added | RobPratt | If you share the mathematical formulation, you will likely get more useful recommendations. | |
| Jan 4, 2021 at 17:53 | history | asked | ooo | CC BY-SA 4.0 |