By Topic

Using family competition genetic algorithm in pickup and delivery problem with time window constraints

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Wan-rong Jih ; Dept. of Comput. Sci. & Inf. Eng., Nat. Taiwan Univ., Taipei, Taiwan ; Cheng-Yen Kao ; Hsu, J.Y.-J.

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.

Published in:

Intelligent Control, 2002. Proceedings of the 2002 IEEE International Symposium on

Date of Conference:

2002