Timeline for Evolutionary algorithm - Traveling Salesman -fitness function
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 14, 2013 at 20:06 | comment | added | Wolfgang Bangerth | Well, but that's exactly the point of concisely stating what's of interest to you. Given your example, the objective function could be $f(N,T)=-15N+T$ which you would want to minimize. This satisfies the verbal description you have in the second comment. But whether that's what you really want is something that only you can answer. | |
| Jun 14, 2013 at 16:07 | comment | added | user2459338 | For example , I prefer 20 points in 300 seconds per point rather then 30 points but 500 seconds per point. I need some idea how to do it smart... | |
| Jun 14, 2013 at 14:43 | comment | added | user2459338 | Thanks. As I write in my post "The objective of the PTSP is to visit the maximum number of waypoints of the map in the minimum number of time steps." I assume amount of waypoint is more important than the time but I still want to give the time is place.. | |
| Jun 14, 2013 at 8:55 | history | answered | Wolfgang Bangerth | CC BY-SA 3.0 |