International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
Volume 72 - Issue 19 |
Published: June 2013 |
Authors: Padmabati Chand, J. R. Mohanty |
![]() |
Padmabati Chand, J. R. Mohanty . Real Time Vehicle Routing Problem with Time Window Simultaneously Delivery Products and Pick up Wastage Materials with Proposed Master-Slave Genetic Algorithm. International Journal of Computer Applications. 72, 19 (June 2013), 39-46. DOI=10.5120/12653-9359
@article{ 10.5120/12653-9359, author = { Padmabati Chand,J. R. Mohanty }, title = { Real Time Vehicle Routing Problem with Time Window Simultaneously Delivery Products and Pick up Wastage Materials with Proposed Master-Slave Genetic Algorithm }, journal = { International Journal of Computer Applications }, year = { 2013 }, volume = { 72 }, number = { 19 }, pages = { 39-46 }, doi = { 10.5120/12653-9359 }, publisher = { Foundation of Computer Science (FCS), NY, USA } }
%0 Journal Article %D 2013 %A Padmabati Chand %A J. R. Mohanty %T Real Time Vehicle Routing Problem with Time Window Simultaneously Delivery Products and Pick up Wastage Materials with Proposed Master-Slave Genetic Algorithm%T %J International Journal of Computer Applications %V 72 %N 19 %P 39-46 %R 10.5120/12653-9359 %I Foundation of Computer Science (FCS), NY, USA
The real-time vehicle routing problem with time windows and simultaneous delivery products and pickup wastage materials (RT-VRPTWDPPWM) is formulated as extension of VRP. The real-time delivery/pickup demands are served by capacitated vehicles with limited initial loads. Moreover, pickup services aren't necessarily done after delivery services in each route. A improved genetic algorithm ( master-slave genetic algorithm)is proposed. To generate offspring for the next generation for crossover (Sub Route Sequence Crossover Method (SRSCM) and for mutation (Sub Route Alter Mutation Method (SRAMM) methods are introduced. The results shows that the proposed algorithm can efficiently decrease the total route cost. Results of comparative tests are presented showing that the improved algorithm performs well on large populations.