In the Nearest Neighbor problem (NN), the objects in the database that are nearer to a given query object than any other objects in the database have to be found. In the conceptually inverse problem, Reverse Nearest Neighbor problem (RNN), objects that have the query object as their nearest neighbor have to be found. Reverse Nearest Neighbors queries have emerged as an important class of querie...

We consider the problem of placing a speciied number (p) of facilities on the nodes of a network so as to minimize some measure of the distances between facilities. This type of problem models a number of problems arising in facility location, statistical clustering , pattern recognition, and processor allocation problems in multiprocessor systems. We consider the problem under three diierent o...

We consider the problem of placing a speciied number (p) of facilities on the nodes of a network so as to minimize some measure of the distances between facilities. This type of problem models a number of problems arising in facility location, statistical clustering, pattern recognition, and also processor allocation problems in multiprocessor systems. We consider the problem under three diiere...

The facility voting location problems arise from the application of criteria derived from the voting processes concerning the location of facilities. The multiple location problems are those location problems in which the alternative solutions are sets of points. This paper extends previous results and notions on single voting location problems to the location of a set of facility points. The a...

Optimal mass transportation can be traced back to Gaspard Monge’s famous paper of 1781: ‘Mémoire sur la théorie des déblais et des remblais’. The problem there is to minimize the cost of transporting a given distribution of mass from one location to another. Since then, it has become a classical subject in probability theory, economics and optimization. At the end of the 80’s, the seminal work ...

The anchored hyperplane location problem is to locate a hyperplane passing through some given points P ⊆ IR and minimizing either the sum of weighted distances (median problem), or the maximum weighted distance (center problem) to some other points Q ⊆ IR. This problem of computational geometry is analyzed by using nonlinear programming techniques. If the distances are measured by a norm, it wi...

We investigate the complexity and approximability of some location problems when two distance values are specified for each pair of potential sites. These problems involve the selection of a specified number of facilities (i.e. a placement of a specified size) to minimize a function of one distance metric subject to a budget constraint on the other distance metric. Such problems arise in severa...

The existence of a series of problems in transportation management of public and personal vehicles causes to consider intelligent transportation systems. Hence, here we investigate to introduce and the performance of intelligent transportation system ITS which is among new technologies in information technology and at last the importance and necessity of lack of delay in data and informat...