Study on the Soft Time Windows Vehicle Synthesis Algorithm Based on Genetic

Ju Mei Ai; Ping Du

doi:10.4028/www.scientific.net/AMM.678.55

Paper Titles

Researching on the Single Lock Chamber Automatic Layout Algorithm
p.39

Rough and Fuzzy Set Based Classification Algorithm on Computer Practice Teaching Evaluation
p.43

Scheduling Based on an Ant Colony Algorithm with Crossover Operator
p.47

Study of Parameters Configuration in Ant Colony Algorithm
p.51

Study on the Soft Time Windows Vehicle Synthesis Algorithm Based on Genetic
p.55

A New Forecasting Model of Fuzzy Time Series
p.59

An Improved Forecasting Model of Fuzzy Time Series
p.64

Key Technology in a Lightweight WPF-Based Electronic Map Engine
p.70

Improved Ant Colony Algorithm on Scheduling Optimization of Cloud Computing Resources
p.75

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vol. 678Study on the Soft Time Windows Vehicle Synthesis...

Study on the Soft Time Windows Vehicle Synthesis Algorithm Based on Genetic

Abstract:

This paper designed a mathematical model of vehicle synthetising and proposed a solution to solve the vehicle carpool problem by using genetic algorithm. The solution encoded the nodes of station and start, end point. Arranged randomly to generate multiple chromosome, initial population and calculate the fitness value obtained from the objective function by the matching node of each vehicle. Generated a new individual by mutation and crossover through Roulette Wheel Selection method.Repeat the above operation to reach the maximun number of iteration and got the optimal solution path. The experimental result shows that the algorithm is valid.

You might also be interested in these eBooks

Advances in Mechatronics and Control Engineering III

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volume 678)

Pages:

55-58

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.678.55

Citation:

Cite this paper

Online since:

October 2014

Authors:

Ju Mei Ai*, Ping Du

Keywords:

Genetic Algorithm (GA), Taxi, Vehicle Synthesis

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

* - Corresponding Author

References

[1] Brady Hunsaker, Martin Savelsbergh. Efficient Feasibility Testing for Dial-a-Ride Problems[J]. Operations Research Letters, 2002, 30(3).

DOI: 10.1016/s0167-6377(02)00120-7

Google Scholar

[2] Lauri Häme. An adaptive insertion algorithm for the single-vehicle dial-a-ride problem with narrow time windows[J]. European Journal of Operational Research, 2011, 209(1): 11-22.

DOI: 10.1016/j.ejor.2010.08.021

Google Scholar

[3] Cheng Jie, Tang Zhihui. Dynamic taxi ride model genetic algorithm [J]. Journal of Wuhan University of Technology based on the (Science and Engineering) 2013, 37(1): 187-191.

Google Scholar

[4] Feng Tian. Sufferage dynamic taxipooling scheduling algorithm based on [J]. computer knowledge and technology, 2011, 7(28): 7019-7023.

Google Scholar

[5] Deng Xianglin. The microcomputer and application of dynamic programming algorithm for taxi mode research based on [J]. 2013, 32(8): 28-31.

Google Scholar

[6] Shao Zengzhen. The matching problem of logistics scheduling model and algorithm research [D]. Shandong: Shandong Normal University, (2013).

Google Scholar