Abstract
The purpose of this paper is to present a new method to solve the heterogeneous fixed fleet vehicle routing problem (HFFVRP) based on structure-redesign-based bacterial foraging optimization (SRBFO). The HFFVRP is a special case of the heterogeneous vehicle routing problem (HVRP), in which the number of each type of vehicles is fixed. To deal with this combinatorial optimization problem, two improved SRBFOs (SRBFOLDC and SRBFONDC) are presented by integrating the same time decreasing chemotaxis step size mechanism of BFOLDC and BFONDC into the optimization process of SRBFO. SRBFOLDC and SRBFONDC are successfully applied though encoding the position of bacteria by 2N dimensions. The first N dimensional vectors indicate the corresponding vehicle, and the next N dimensional vectors present the execution order of the corresponding vehicle routing. In the simulation experiments, it is demonstrated that SRBFONDC and SRBFOLDC are efficient to solve the heterogeneous fixed fleet vehicle routing problem with lower transportation cost and get better vehicle routing. Besides, SRBFONDC performs best compared with other five bacterial foraging optimization algorithms.
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
References
Dantzig, G.B., Ramser, J.H.: The truck dispatching problem. Manage. Sci. 6(1), 80–91 (1959)
Augerat, P., Belenguer, J.M., Benavent, E., Corberin, A., Naddef, D.: Separating capacity constraints in the CVRP using tabu search. Europe J. Oper. Res. 106, 546–557 (1998)
Esaulniers, G.D., Desrosiers, J., Erdman, A., Solomon, M.M., Soumis, F.: The VRP with pickup and delivery. In: The Vehicle Routing Problem. Society for Industrial and Applied Mathematics, Philadelphia (2001)
Renaud, J., Laporte, G., Boctor, F.F.: A tabu search heuristic for the multi-depot vehicle routing problem. Comput. Oper. Res. 23(3), 229–235 (1996)
Kallehauge, B., Larsen, J., Madsen, O.B.G., Solomon, M.: Vehicle routing problem with time windows. In: Desaulniers, G., Desrosiers, J., Solomon, M.M. (eds.) Column Generation, pp. 67–98. Springer, New York (2005)
Nag, B., Golden, B.L., Assad, A.: Vehicle routing with site dependencies. In: Vehicle Routing: Methods and Studies, pp. 149–159. Elsevier, Amsterdam (1988)
Gendreau, M., Laporte, G., Musaraganyi, C., Taillard, E.D.: A tabu search heuristic for the heterogeneous fleet vehicle routing problem. Comput. Oper. Res. 26(12), 1153–1173 (1999)
Taillard, E.D.: A heuristic column generation method for the heterogeneous fleet VRP. RAIRO Oper. Res. 33(01), 1–14 (1999)
Passino, K.M.: Biomimicry of bacterial foraging for distributed optimization and control. IEEE Control Syst. Mag. 22(3), 52–67 (2002)
Niu, B., Wang, H., Tan, L.-J., Li, L., Wang, J.-W.: Vehicle routing problem with time windows based on adaptive bacterial foraging optimization. In: Huang, D.-S., Ma, J., Jo, K.-H., Gromiha, M.M. (eds.) ICIC 2012. LNCS, vol. 7390, pp. 672–679. Springer, Heidelberg (2012)
Tan, L.J., Lin, F.Y.: Adaptive comprehensive learning bacterial foraging optimization and its application on vehicle routing problem with time windows. Neurocomputing 151, 1208–1215 (2015)
Hezer, S., Kara, Y.: Solving vehicle routing problem with simultaneous delivery and pick up using bacterial foraging optimization algorithm. In: Proceedings of the 41st International Conference on Computers and Industrial Engineering, Los Angeles, pp. 380–385 (2011)
Niu, B., Bi, Y., Xie, T.: Structure-redesign-based bacterial foraging optimization for portfolio selection. In: Huang, D.-S., Han, K., Gromiha, M. (eds.) ICIC 2014. LNCS, vol. 8590, pp. 424–430. Springer, Heidelberg (2014)
Tutuncu, G.Y.: An interactive GRAMPS algorithm for the heterogeneous fixed fleet vehicle routing problem with and without backhauls. Eur. J. Oper. Res. 201, 593–600 (2010)
Li, S.H.: The Model and Particle Swarm Optimization for Vehicle Routing Problem with Time Windows. 37–38
Niu, B., Fan, Y., Zhao, P., Xue, B., Li, L., Chai, Y.J.: A novel bacterial foraging optimizer with linear decreasing chemotaxis step. In: Second International Workshop on Intelligent Systems and Applications, pp. 1–4. IEEE Press, New York (2010)
Niu, B., Fan, Y., Wang, H.: Novel bacterial foraging optimization with time- varying chemotaxis step. Int. J. Artif. Intell. 7(A11), 257–273 (2011)
Acknowledgements
This work is partially supported by the National Natural Science Foundation of China (Grants nos. 71001072, 71271140, 71471158), the Natural Science Foundation of Guangdong Province (Grant nos. S2012010008668, 9451806001002294), the Graduate Student’s Innovation Project of School of Management Shenzhen University, the Project of Guangdong Province Promoting the Development of Science and Technology Service Industry (Grant nos. 2013B040403005), and Shenzhen Science and Technology Plan Project (Grant no. CXZZ20140418182638764).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Gan, X., Liu, L., Niu, B., Tan, L.J., Zhang, F.F., Liu, J. (2015). SRBFOs for Solving the Heterogeneous Fixed Fleet Vehicle Routing Problem. In: Huang, DS., Jo, KH., Hussain, A. (eds) Intelligent Computing Theories and Methodologies. ICIC 2015. Lecture Notes in Computer Science(), vol 9226. Springer, Cham. https://doi.org/10.1007/978-3-319-22186-1_72
Download citation
DOI: https://doi.org/10.1007/978-3-319-22186-1_72
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-22185-4
Online ISBN: 978-3-319-22186-1
eBook Packages: Computer ScienceComputer Science (R0)