Abstract
Firstly, the paper establishes a mathematical model for single depot and heterogeneous fleet vehicle routing problem (SHVRP) according to the actual situation of Zhengzhou Coal Electricity Material Supply and Marketing Limited Company in China, then based on the model, uses improved genetic algorithm(IGA) to optimize the vehicle routing problem (VRP) of Zhengzhou Coal Electricity Material Supply and Marketing Limited Company, finally by comparing the performance of IGA with classical heuristics algorithm (CHA) and sweeping algorithm(SA) in transportation cost, the number of used vehicle and computing time, the results show that CHA obtains the best objective function value, SA takes the second place, and CHA is the poorest; however, from the number of used vehicles, the optimum solution of CHA uses the least vehicles, followed by SA and IGA; but CHA is most efficient on computing time, the time needed for calculation is only two fifth of that of SA, two twenty five of that of IGA.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Golden, B., Assad, A., Levy, L., et al.: The fleet size and mix vehicle routing problem. Computers and Operations Research ll, 19–66 (1984)
Gendreau, M., Laporte, G., Musaraganyi, C., et al.: A tabu search heuristic for the heterogenous fleet vehicle routing problem. Computers & Operations Research 26(12), 1153–1173 (1999)
Li, F., Golden, B., Wasil, E.: A record-to-record travel algorithm for solving the heterogenous fleet vehicle routing problem. Computers & Operations Research 34(9), 2734–2742 (2007)
Shiquan, Z., Guoguang, H.: Study on multi-depot vehicle scheduling problem with time windows and multi-type vehicle limits and its tabu search algorithm. OR Transactions 9(4), 67–73 (2005)
Hongbo, S., Maoxiang, L.: Study on the model and its tabu search algorithm for the JD multi-vehicle distribution scheduling problem. Journal of Changsha Communications University 21(3), 73–77 (2005)
Bing, L.: The determinitic dynamic vehicle allocation problem with multiple vehicle type. Journal of Industrial Engineering and Engineering Management 20(3), 52–56 (2006)
Zhijian, Y., Huaizhen, Y., Daopin, Z.: Heuristics for the fleet size and mix vehicle routing problem. Journal of Highway and Transportation Research and Development 22(5), 147–151 (2005)
Lishuang, J., Jing, L.: An Improved Algorithm for Scheduling the Single Park and Multi-types Vehicles. Manufacture Information Engineering of China 37(19), 8–10 (2008)
Yuanfeng, Y.: An Improved Genetic Algorithm for Multiple-depot and Heterogeneous-vehicle Vehicle Routing Problem. Computer and Modernization 157(9), 10–13 (2008)
Jian, L., Yong, Z., Qinli, D.: Research on heterogeneous vehicle routing problem with hard time windows for the third party logistics. Journal of Systems Engineering 23(1), 74–80 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Haixiang, G., Kejun, Z., Lanlan, L., Juan, Y. (2010). Optimizing Single Depot Heterogeneous Fleet Vehicle Routing Problem by Improved Genetic Algorithm. In: Cao, By., Wang, Gj., Guo, Sz., Chen, Sl. (eds) Fuzzy Information and Engineering 2010. Advances in Intelligent and Soft Computing, vol 78. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14880-4_83
Download citation
DOI: https://doi.org/10.1007/978-3-642-14880-4_83
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14879-8
Online ISBN: 978-3-642-14880-4
eBook Packages: EngineeringEngineering (R0)