Hybrid Genetic Simulated Annealing Algorithm with its Application in Vehicle Routing Problem with Time Windows

Abstract:

Article Preview

Under the situations of distribution center and customer demand, a mathematical model of Vehicle Routing Problem with Time Windows(VRPTW) is set up, where the main factors of less total distance of vehicles driving and less delayed time of vehicles are considered. For the "premature" convergence in Genetic Algorithms, Simulated Annealing Algorithm is introduced, and GSA is designed to optimize and analyse the VRPTW examples. It is shown that the performance of GSA is better than Genetic Annealing(GA).

Info:

Periodical:

Advanced Materials Research (Volumes 148-149)

Edited by:

Xianghua Liu, Zhengyi Jiang and Jingtao Han

Pages:

395-398

DOI:

10.4028/www.scientific.net/AMR.148-149.395

Citation:

Q. Zhang et al., "Hybrid Genetic Simulated Annealing Algorithm with its Application in Vehicle Routing Problem with Time Windows", Advanced Materials Research, Vols. 148-149, pp. 395-398, 2011

Online since:

October 2010

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.