Abstract
In the last decades the Vehicle Routing Problem (VRP) and its ramifications, including the Capacitated Vehicle Routing Problem (CVRP), have attracted the attention of researchers mainly because their presence in many practical situations. Due to the difficulties encountered in their solutions, such problems are usually solved by means of heuristic and metaheuristics algorithms, among which is the Genetic Algorithm (GA). The solution of CVRP using GA requires a solution encoding step, which demands a special care to avoid high computational cost and to ensure population diversity that is essential for the convergence of GA to global optimal or sub-optimal solutions. In this work, we investigated a new binary encoding scheme employed by GA for solving the CVRP. Conducted experiments demonstrated that the proposed binary encoding is able to provide good solutions and is suitable for practical applications that require low computational cost.
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
Dalfard, V.M., Kaveh, M., Nosratian, N.E.: Two meta-heuristic algorithms for two-echelon location-routing problem with vehicle fleet capacity and maximum route length constraints. Neural Comput. Appl. 23(7–8), 2341–2349 (2013)
Nazif, H., Lee, L.S.: Optimised crossover genetic algorithm for capacitated vehicle routing problem. Appl. Math. Model. 36(5), 2110–2117 (2012)
Vieira, H.P.: Metaheuristic to solve vehicles routing problems with time windows (2013)
Lau, H.C., Chan, T., Tsui, W., Pang, W.: Application of genetic algorithms to solve the multidepot vehicle routing problem. IEEE Trans. Autom. Sci. Eng. 7(2), 383–392 (2010)
Bermudez, C., Graglia, P., Stark, N., Salto, C., Alfonso, H.: Comparison of recombination operators in panmictic and cellular GAs to solve a vehicle routing problem. Intel. Artif. Rev. Iberoam. de Intel. Artif. 14(46), 34–44 (2010)
Wang, C.H., Lu, J.Z.: An effective evolutionary algorithm for the practical capacitated vehicle routing problems. J. Intell. Manuf. 21(4), 363–375 (2010)
Tasan, A.S., Gen, M.: A genetic algorithm based approach to vehicle routing problem with simultaneous pick-up and deliveries. Comput. Ind. Eng. 62(3), 755–761 (2012)
Ursani, Z., Essam, D., Cornforth, D., Stocker, R.: Localized genetic algorithm for vehicle routing problem with time windows. Appl. Soft Comput. 11(8), 5375–5390 (2011)
Lu, C.C., Vincent, F.Y.: Data envelopment analysis for evaluating the efficiency of genetic algorithms on solving the vehicle routing problem with soft time windows. Comput. Ind. Eng. 63(2), 520–529 (2012)
Kuo, R., Zulvia, F.E., Suryadi, K.: Hybrid particle swarm optimization with genetic algorithm for solving capacitated vehicle routing problem with fuzzy demand – a case study on garbage collection system. Appl. Math. Comput. 219(5), 2574–2588 (2012)
Vidal, T., Crainic, T.G., Gendreau, M., Lahrichi, N., Rei, W.: A hybrid genetic algorithm for multidepot and periodic vehicle routing problems. Oper. Res. 60(3), 611–624 (2012)
Reiter, P., Gutjahr, W.J.: Exact hybrid algorithms for solving a bi-objective vehicle routing problem. Cent. Eur. J. Oper. Res. 20(1), 19–43 (2012)
Osaba, E., Diaz, F., Onieva, E.: Golden ball: a novel meta-heuristic to solve combinatorial optimization problems based on soccer concepts. Appl. Intell. 41(1), 145–166 (2014)
Lima, S.J.A., Araújo, S.A., Schimit, P.H.: A hybrid approach based on genetic algorithm and nearest neighbor heuristic for solving the capacitated vehicle routing problem. Acta Scientiarum Technology (2018)
Laporte, G.: The vehicle routing problem: an overview of exact and approximate algorithms. Eur. J. Oper. Res. 59(3), 345–358 (1992)
Goldberg, D.E.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading (1989)
Banzhaf, W., Nordin, P., Keller, R.E., Francone, F.D.: Genetic Programming: An Introduction, vol. 1. Morgan Kaufmann, San Francisco (1998)
Brooker, R.: Concepts of Genetics. McGraw-Hill Higher Education, New York (2012)
Kumar, R.: Novel encoding scheme in genetic algorithms for better fitness. Int. J. Eng. Adv. Technol. 1(6), 214–219 (2012)
Kumar, A.: Encoding schemes in genetic algorithm. Int. J. Adv. Res. IT Eng. 2(3), 1–7 (2013)
Wall, M.: GAlib: a C++ library of genetic algorithm components (1996)
Grassi, F.: Optimization by genetic algorithms of the sequencing of production orders in job shop environments. Master’s Dissertation, Industrial Engineering Post Graduation Program, Universidade Nove de Julho (UNINOVE) (2014)
Reinelt, G., Wenger, K.M.: Maximally violated mod-p cuts for the capacitated vehicle-routing problem. INFORMS J. Comput. 18(4), 466–479 (2006)
Ralphs, T., Pulleyblank, W., Trotter Jr., L.: On capacitated vehicle routing. Problem, Mathematical Programming (1998)
Acknowledgements
The authors would like to thank UNINOVE, FAPESP–São Paulo Research Foundation by financial support (#2017/05188-9) and CNPq–Brazilian National Research Council for the scholarship granted to S. A. Araújo (#311971/2015-6).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Lima, S.J.d.A., de Araújo, S.A. (2018). A New Binary Encoding Scheme in Genetic Algorithm for Solving the Capacitated Vehicle Routing Problem. In: Korošec, P., Melab, N., Talbi, EG. (eds) Bioinspired Optimization Methods and Their Applications. BIOMA 2018. Lecture Notes in Computer Science(), vol 10835. Springer, Cham. https://doi.org/10.1007/978-3-319-91641-5_15
Download citation
DOI: https://doi.org/10.1007/978-3-319-91641-5_15
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-91640-8
Online ISBN: 978-3-319-91641-5
eBook Packages: Computer ScienceComputer Science (R0)