A Continuous Genetic Algorithm for Pickup and Delivery Problem in a VRP environment.

• DOI: 10.4156/aiss.vol5.issue10.130
• Publication Date: 2013-06-05T04:52:57Z
• Authors: Rony Cueva -; Manuel Tupia -
• Keywords: Pickup; Vehicle Routing Problem

Picking and delivery problems its combinations are considered as NP-hard according to the computational complexity. For those problems, exact algorithms cannot propose appropriate solutions needing scenarios such large industrial manufacturing enterprises or commercials, asset custody logistics operators. These companies need manage their inventories movements across stores through approximated with objective of minimizing both cost inventory manpower for delivery. problem an extension VRP family required metaheuristics solutions. Present paper discusses application continuous genetic algorithm solve a case where have lots products there is steady flow locate dispatch them. Finally, we consider constrained optimization. It illustrates example in which used crowded penalty. The results indicate that conventional operators (crossover mutation) lose effectiveness when overall solution border feasible space. this reason, new operator best results. test instance has been extracted from Peruvian plant produces commercializes ceramic (bathrooms, tiles, pipes, etc.) This enterprise 550 different catalog, five finished product warehouse 1500 making distributions three countries over 15,000 points sale.