Annealing Partheno-Genetic Algorithm for VRP with Soft Time Windows

Qun Fang; Dong Mei

doi:10.4028/www.scientific.net/AMR.791-793.1224

Paper Titles

Research on the Parameter Model Simulation Based on Computer Simulation Basketball Match
p.1203

Research on the Virtual Reality Training Simulation Technology Based on Key Technology of Physical Simulation
p.1208

A MPPT Control Algorithm Based on Extreme Learning Machine in PV System
p.1214

A Combination Model for Short Term Wind Power Forecasting
p.1220

Annealing Partheno-Genetic Algorithm for VRP with Soft Time Windows
p.1224

Research on Building Earthquake Disaster Simulation
p.1228

Computing Resource Allocation for Enterprise Information Management Based on Cloud Platform Ant Colony Optimization Algorithm
p.1232

Research on Signal Detection Algorithms Based on Spatial Multiplexing of LTE System
p.1238

An Improved RFID Anti-Collision Algorithm
p.1243

HomeAdvanced Materials ResearchAdvanced Materials Research Vols. 791-793Annealing Partheno-Genetic Algorithm for VRP with...

Annealing Partheno-Genetic Algorithm for VRP with Soft Time Windows

Abstract:

In order to resolve the vehicle routing problem with soft time window, a kind of Partheno-genetic Algorithms combined with Simulated Annealing was proposed in the paper, inverse operator and 2-change operator were presented.Centre point was replaced by the dummy natural number, then it is easy to made use of the available methods using by TSP. A selection method with tournament of three copies can keep the diversity of population. The simulation results show that new algorithm can effectively resole VRPTW, and get better results than common GA, new algorithms searching efficiency and convergence probability are effectively enhanced.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Advanced Materials Research (Volumes 791-793)

Pages:

1224-1227

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.791-793.1224

Citation:

Cite this paper

Online since:

September 2013

Authors:

Qun Fang, Dong Mei

Keywords:

Partheno-Genetic Algorithm, Selection Method with Tournament of Three Copies, Simulated Annealing (SA), VRPTW

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Dantzig G B, Ramser J H: The Truck Dispatching Problem, volume 6 of Management Science(Soo25-1909), (1959), pp.80-91.

DOI: 10.1287/mnsc.6.1.80

Google Scholar

[2] Huang Lan, Pang Wei, Wang Kang-ping, Lv ying-hua: Vehicle routing problem with time windows based on genetic algorithm, volume 26 of Small miniature computer system, ( 2005), pp.214-217.

Google Scholar

[3] Song Wei-gang, Wang cong, Zhao ling: Mass customers vehicles scheduling problem heuristic algorithm research, volume 20 of System simulation journal, (2008), pp.3698-3701.

Google Scholar

[4] Li Mao-jun, Tong Diao-sheng: Choose way of Partheno Genetic Algorithm, volume 24 of Systems engineering and electronics, (2002), pp.87-89.

Google Scholar

[5] Xie Bing-lei, Li Liang, Guo Hui-hu, ang: Solving simulated annealing algorithm of the distribution/collect traveling salesman problem, volume 11 of System engineering theory method application, ( 2002), P. 240-243.

Google Scholar