Consider the following restricted (symmetric or asymmetric) traveling salesman problem: given an initial ordering of the n cities and an integer k > 0, nd a minimum cost tour such that if city i precedes city j by at least k positions in the initial ordering, then city i precedes city j in any optimal tour. Balas [5] has proposed a dynamic programming algorithm that solves this problem in time ...

imagine you have traveled to an unfamiliar city. before you start your daily tour around the city, you need to know a good route. in network theory (nt), this is the traveling salesman problem (tsp). a dynamic programming algorithm is often used for solving this problem. however, when the road network of the city is very complicated and dense, which is usually the case, it will take too long fo...

Urban traffic is a relevant topic for the population of cities that suffer from daily traffic jams. People not only spend time on their journeys but also lose energy. With the purpose of improving the traffic flow, it is possible to control the temporization of traffic lights. However, because of the intrinsic characteristics of the system – multivariable, stochastic and dynamic – controlling t...

Volunteered Geographic Information (VGI) tools appear to enhance the possibilities offered by a collaborative approach to planning. The present paper analyzes both the results of experiences of the author and of those available in the literature, highlighting possible advantages and disadvantages. After a brief introduction to the meaning of e-democracy, the second part focuses on the role of I...

Consider the following restricted (symmetric or asymmetric) traveling-salesman problem (TSP): given an initial ordering of the n cities and an integer k > 0, find a minimum-cost feasible tour, where a feasible tour is one in which city i precedes city j whenever j ≥ i+ k in the initial ordering. Balas (1996) has proposed a dynamic-programming algorithm that solves this problem in time linear in...