Cart (Loading....) | Create Account
Close category search window
 

Differential Evolution Algorithm for the Optimization of the Vehicle Routing Problem in Logistics

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

2 Author(s)
Huan Xu ; Sch. of Appl. Math., Guangdong Univ. of Technol., Guangzhou, China ; Jiechang Wen

The unidirectional logistics distribution vehicle routing problem with no time windows is considered. It contains the vehicle capacity restriction, the longest distance restriction and the full loaded vehicle. The solution must ensure the non-full loaded factor is the least and the total distance is the shortest. A multi-objective optimization mathematical model for the problem is established. And the differential evolution algorithm is proposed for this problem. The optimal solutions to the model are obtained by selecting the appropriate encoding method. The results of simulation show that the differential evolution algorithm is an effective way for solving the vehicle routing problem.

Published in:

Computational Intelligence and Security (CIS), 2012 Eighth International Conference on

Date of Conference:

17-18 Nov. 2012

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.