Timeline for Optimization over permutation
Current License: CC BY-SA 4.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 15, 2023 at 13:49 | history | edited | RobPratt | CC BY-SA 4.0 |
added 120 characters in body
|
| Sep 15, 2023 at 8:58 | comment | added | Honglian | thank you for your nice answer! I have a further question: In the time dependent tsp, we usually assume the cost C_{i,j,t} is a given value, right? Usually C_{i,j,t} can be expressed as a step function w.r.t t. However, if we reduce my problem to the TDTSP, then C_{i,j,t} will depend not only on $t$, but all other nodes that are visited before node $j$. Specifically, in permutation (dummy node, x_1, x_2, ... x_n, dummy node), C_{i,j,t}=d(x_j, {dummy node, x_1, ...x_i}) * p^{i+1} if t=i, and 0 therwise. In this case, I do not see an easy way of using TDTSP to solve my problem. | |
| Sep 14, 2023 at 23:55 | history | edited | RobPratt | CC BY-SA 4.0 |
added 54 characters in body
|
| Sep 14, 2023 at 20:05 | history | answered | RobPratt | CC BY-SA 4.0 |