Abstract
In this paper, we propose a memetic EMO algorithm that enhances the similarity of two sets of non-dominated solutions. We employ our algorithm in vehicle routing problems (VRPs) where the demand of customers varies. We consider two periods of different demand in a problem that are Normal Demand Period (NDP) and High Demand Period (HDP). In each period, we can find a set of non-dominated solutions with respect to several objectives such as minimizing total cost for delivery, minimizing maximum cost, minimizing the number of vehicles, minimizing total delay to the date of delivery and so on. Although a set of non-dominated solutions can be searched independently in each period, drivers of vehicles prefer to have similar routes in NDP and HDP in order to reduce their fatigue to drive on a different route. In this paper, we propose a local search that enhance the similarity of routes in NDP and HDP. Simulation results show that the proposed memetic EMO algorithm can find a similar set of non-dominated solutions in HDP to the one in NDP.
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
Zitzler, E., Deb, K., Thiele, L., Coello Coello, C.A., Corne, D.W. (eds.): EMO 2001. LNCS, vol. 1993. Springer, Heidelberg (2001)
Fonseca, C.M., Fleming, P.J., Zitzler, E., Deb, K., Thiele, L. (eds.): EMO 2003. LNCS, vol. 2632. Springer, Heidelberg (2003)
Coello Coello, C.A., Hernández Aguirre, A., Zitzler, E. (eds.): EMO 2005. LNCS, vol. 3410. Springer, Heidelberg (2005)
Deb, K.: Applications of multi-objective evolutionary algorithms. In: Multi-objective Optimization Using Evolutionary Algorithms, pp. 447–479. John Wiley & Sons, Chichester (2001)
Tavares, J., Pereira, F.B., Machado, P., Costa, E.: Crossover and diversity: A study about GVR. In: Cantú-Paz, E., Foster, J.A., Deb, K., Davis, L., Roy, R., O’Reilly, U.-M., Beyer, H.-G., Kendall, G., Wilson, S.W., Harman, M., Wegener, J., Dasgupta, D., Potter, M.A., Schultz, A., Dowsland, K.A., Jonoska, N., Miller, J., Standish, R.K. (eds.) GECCO 2003. LNCS, vol. 2723, Springer, Heidelberg (2003)
Berger, J., Barkaoui, M.: A hybrid genetic algorithm for the capacitated vehicle routing problem. In: Cantú-Paz, E., Foster, J.A., Deb, K., Davis, L., Roy, R., O’Reilly, U.-M., Beyer, H.-G., Kendall, G., Wilson, S.W., Harman, M., Wegener, J., Dasgupta, D., Potter, M.A., Schultz, A., Dowsland, K.A., Jonoska, N., Miller, J., Standish, R.K. (eds.) GECCO 2003. LNCS, vol. 2723, pp. 646–656. Springer, Heidelberg (2003)
Tan, K.C., Lee, T.H., Chew, Y.H., Lee, L.H.: A hybrid multiobjective evolutionary algorithms for solving vehicle routing problem with time windows. In: Proc. of IEEE International Conf. on SMC 2003, Washington D.C., U.S.A, Oct. 5-8, 2003, pp. 361–366. IEEE Computer Society Press, Los Alamitos (2003)
Saadah, S., Ross, P., Paechter, B.: Improving vehicle routing using a customer waiting time colony. In: Proc. of 4th European Conf. on Evolutionary Computation in Combinatorial Optimization, pp. 188–198 (2004)
Chitty, D.M., Hernandez, M.L.: A hybrid ant colony optimisation technique for dynamic vehicle routing. In: Deb, K., et al. (eds.) GECCO 2004. LNCS, vol. 3102, pp. 48–59. Springer, Heidelberg (2004)
Murata, T., Itai, R.: Multi-objective vehicle routing problems using two-fold EMO algorithms to enhance solution similarity on non-dominated solutions. In: Coello Coello, C.A., Hernández Aguirre, A., Zitzler, E. (eds.) EMO 2005. LNCS, vol. 3410, pp. 885–896. Springer, Heidelberg (2005)
Lenstra, J.K., Rinnooy Kan, A.H.G.: Complexity of vehicle routing and scheduling problems. Networks 11, 221–227 (1981)
Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. on Evolutionary Computation 6(2), 182–197 (2002)
Maekawa, K., Mori, N., Tamaki, H., Kita, H., Nishikawa, H.: A Genetic Solution for the Traveling Salesman Problem by Means of a Thermodynamical Selection Rule. In: Proc. 1996 IEEE Int. Conf. on Evolutionary Computation, pp. 529–534. IEEE Computer Society Press, Los Alamitos (1996)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Murata, T., Itai, R. (2007). Local Search in Two-Fold EMO Algorithm to Enhance Solution Similarity for Multi-objective Vehicle Routing Problems. In: Obayashi, S., Deb, K., Poloni, C., Hiroyasu, T., Murata, T. (eds) Evolutionary Multi-Criterion Optimization. EMO 2007. Lecture Notes in Computer Science, vol 4403. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-70928-2_18
Download citation
DOI: https://doi.org/10.1007/978-3-540-70928-2_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-70927-5
Online ISBN: 978-3-540-70928-2
eBook Packages: Computer ScienceComputer Science (R0)