The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In this paper the Time-Dependent Travelling Sales Man Problem is a 3-dimensional travelling sales man problem where the cost matrix C(i, j, k) is the cost of the sales man visiting from city i to city j at time (facility) k. The cost matrix C(i, j,k) (i, j, k = 1,2, — n) is given. The problem is to find a tour for n cities for the travelling sales man with the restriction that he visits only one pair...
In this paper we study a problem called truncated M-travelling Salesmen Problem.“There are n cities and N = (1, 2, …. n). The distance d(i, j) between any pair of cities (i, j) is known. A subset with no cities of n cities has to be traveled by the M-salesmen. The number of cities to be traveled by each salesman i is ni cities with Σni = no. A salesman has to visit only given number of cities in his...
This study aims to optimize the number of nodes and arcs in a constructed network employing a given criteria. For this, we subject the constructed network using the methods like Shortest Path (SP), Critical Path (CP) and Max-Flow (MF) between any pair of nodes. A set of iterative algorithms have been generated using matrix operations to meet the above requirement, which is named as Pandit’s algorithm...
In this paper the “Generalized Time-dependent Travelling Salesman Problem” is a three dimensional travelling salesman problem where the cost matrix C (i, j, k) is the cost of the salesman visiting from city i to city j at time (facility) k. The cost matrix C(i,j,k) [i,j = 1,2,3,…..,n;k = 1,2,3,…..,m] is given. There are n cities and N = {1, 2, 3,…, n}. We are given a partition of cities into groups...
We report on the first lidar observations of the nighttime mesospheric sodium layer from Gadanki (13.5°N, 79.2°E) site in India. The lidar measurements of upper atmospheric sodium made on 6 nights between the 10 and 16 January 2005 are presented in this paper. The Gadanki lidar uses a Nd:YAG pumped dye laser, tuned to the sodium D2 line (589.0 nm), as a transmitter. Using the system, sodium number...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.