A Review on Rular Postman Problem for Optimizing System through Nearest Neighbour Algorithm |
Author(s): |
| Waseem Ahmad , AKTU (Asso. college); Zulfikar Ali Ansari, AKTU (Asso. college); Aliza Raza Rizvi, AKTU (Asso. college) |
Keywords: |
| TSP, Nearest Neighbour Algorithm, Rural Postman Problem |
Abstract |
|
The paper is generalized new version of travelling salesman problem that is rural postman problem in this the packet delivery in road network is formulated as rural postman problem where the driver (i.e. the salesman) receives road (i.e. edge) blockage messages. The postman which are used to delivered mail to instance place. Each postman start from main location at different time every day. The postman pickup mail or application from start location to the instance place in many different routes and return back the start location in at specific time, starting from early morning until the end of official working hours, on following condition. (1). Every location will be visited once in each route. (2) The capacity of each postman is enough for all application including the each route. |
Other Details |
|
Paper ID: IJSRDV7I40098 Published in: Volume : 7, Issue : 4 Publication Date: 01/07/2019 Page(s): 193-198 |
Article Preview |
|
|
|
|
