Access to facilities, services and socio-economic opportunities plays a critical role in the growth and decline of cities and human settlements. Previous attempts to explain changes in socio-economic indicators by differences in accessibility have not been convincing as countries with highly developed transport infrastructure have only seen marginal benefits of infrastructure improvements. Aust...

This paper analyzes the elastic net approach (Durbin and Willshaw 1987) to the traveling salesman problem of finding the shortest path through a set of cities. The elastic net approach jointly minimizes the length of an arbitrary path in the plane and the distance between the path points and the cities. The tradeoff between these two require­ ments is controlled by a scale parameter K. A global...

Pervasive infrastructures, such as cell phone networks, enable to capture large amounts of human behavioral data but also provide information about the structure of cities and their dynamical properties. In this article, we focus on these last aspects by studying phone data recorded during 55 days in 31 Spanish cities. We first define an urban dilatation index which measures how the average dis...

Epidemiological studies have observed between city heterogeneity in PM2.5-mortality risk estimates. These differences could potentially be due to the use of central-site monitors as a surrogate for exposure which do not account for an individual's activities or ambient pollutant infiltration to the indoor environment. Therefore, relying solely on central-site monitoring data introduces exposure...

The travelling salesman problem (TSP) is the most well-known combinatorial optimization problem. TSP is used to find a routing of a salesman who starts from a home location, visits a prescribed set of cities and returns to the original location in such a way that the total distance travelled is minimized and each city is visited exactly once . This problem is known to be NP-hard, and cannot be ...

In this paper we apply a Population based Ant Colony Optimization (PACO) algorithm for solving the following new version of the Traveling Salesperson problem that is called the Combined Tours TSP (CT-TSP). Given are a set of cities, for each pair of cities a cost function and an integer k. The aim is to find a set of k (cyclic) tours, i.e., each city is contained exactly once in each tour and e...

bus rapid transit is an innovative, high capacity, lower cost public transit solution in metropolitan cities. idea is to dedicate lanes for quick and efficient transport of passengers to their destinations. in the present investigation the environmental impact assessment of bus rapid transit  in tehran metropolitan city is brought out. for this purpose bus rapid transit lane no. 10 is investiga...

The travelling salesman problem (TSP) is the most well-known combinatorial optimization problem. TSP is used to find a routing of a salesman who starts from a home location, visits a prescribed set of cities and returns to the original location in such a way that the total distance travelled is minimized and each city is visited exactly once . This problem is known to be NP-hard, and cannot be ...