[Date Index] [Thread Index] [Author Index]

An extension of the traveling salesman problem

• To: mathgroup at smc.vnet.net
• Subject: [mg75433] An extension of the traveling salesman problem
• From: Virgil Stokes <vs at it.uu.se>
• Date: Mon, 30 Apr 2007 03:42:00 -0400 (EDT)

I am interested in a special form of the infamous "traveling salesman 
problem" (TSP). More specifically, the symmetric form, and the objective 
is to minimize the total time to visit a set of cities (each city can be 
visited only once). In addition, the time between cities increases as a 
monotonic function of the elapsed time.

Has anyone used Mathematica to look at this form of the TSP?

Thanks,
V. Stokes