Abstract
In this paper, we propose a novel research scheme to solve the single vehicle pickup and delivery problem (PDPTW) with time window constraints. The family competition genetic algorithm (FCGA) is a modern approach that has been successfully applied to solve the traveling salesman problem. We illustrate the FCGA and give the experimental results that show the FCGA is an effective algorithm for solving the single vehicle PDPTW. Genetic algorithms (GA) have been successful applied to solve the combinatorial computation problems. The family competition will improve the achievements for obtaining optimal solutions and the probability to hit the feasible solutions. By comparing FCGA with traditional GA, this excellent approach does not need enormous resources. Applying FCGA to single vehicle PDPTW, it succeeded in finding feasible solutions for all problems and obtained efficient results in our experimentation.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.