Increasingly complex urban traffic conditions often challenge the express services with long delivery path and much more time as consumed. In this paper, a Traffic Impact Factor (TIF) is introduced to model the impact of urban traffic conditions on express services. Based on the TIF, an optimization model is constructed to minimize the delivery distance and the time consumed. In the solution , ...

A VR (virtual reality) simulator which is used for helicopter simulations requires a virtual environment of real world urban areas. However, real urban environments are continuously changing. It is necessary to develop a modeling method that makes direct use of GIS (geographical information system) data which is updated periodically. A flight simulation needs to visualize not only buildings in ...

Vehicle routing problem (VRP) is real-world combinatorial optimization problem which determine the optimal route of a vehicle. Generally, to provide the efficient vehicle serving to the customer through different services by visiting the number of cities or stops, the VRP follows the Travelling Salesman Problem (TSP), in which each of vehicle visiting a set of cities such that every city is vis...

Identifying whether two vehicles in different images are same or not is called vehicle reidentification. In cities, there are lots of cameras, but cameras cannot cover all the areas. If we can re-identify a car disappearing from one camera and appearing in another in two adjacent regions, we can easily track the vehicle and use the information help with traffic management. In this paper, we pro...

Bright Minds, Big Rent: Gentrification and the Rising Returns to Skill* In 1980, housing prices in the main US cities rose with distance to the city center. By 2010, that relationship had reversed. We propose that this development can be traced to greater labor supply of high-income households through reduced tolerance for commuting. In a tractlevel data set covering the 27 largest US cities, y...

In the modern world, cities need to keep up with the demand for mobility, efficient infrastructure and environmental sustainability. The future smart cities use intelligent information and communication technologies to raise the quality of life. This includes computer vision as one of the main technologies. It can observe and analyse human activities from a distance in a noninvasive manner. Tra...

In this paper we deal with the vertex k-center problem, a problem which is a part of the discrete location theory. Informally, given a set of cities, with intercity distances specified, one has to pick k cities and build warehouses in them so as to minimize the maximum distance of any city from its closest warehouse. We examine several approximation algorithms that achieve approximation factor ...

1 Arora's (1 +)-Approximation Scheme for the Euclidean TSP In the last lecture, we saw that, given any n points in 0; 1] 2 , Karp's partitioning algorithm nds a tour whose length is longer than the optimal tour by an additive factor of at most o(p n). In this lecture, we will see another partioning-based algorithm, due to Arora 1], which nds a tour of length at most (1 +)OPT in time n O(1==) fo...

This paper deals with generating of an optimized route for multiple Traveling Salesman Problems. We used a methodology of clustering the given cities depending upon the number of salesmen and each cluster is allotted to a salesman. “k-Means clustering” algorithm has been used for easy clustering of the cities. In this way the mTSP has been converted into TSP which is simple in computation compa...

An n-town, n ∈ N, is a group of n buildings, each occupying a distinct position on a 2-dimensional integer grid. If we measure the distance between two buildings along the axis-parallel street grid, then an n-town has optimal shape if the sum of all pairwise Manhattan distances is minimized. This problem has been studied for cities, i.e., the limiting case of very large n. For cities, it is kno...