A Discrete Teaching-Learning-Based Optimization Algorithm for the Capacitated Vehicle Routing Problem
Abstract: Teaching-learning-based optimization (TLBO) is a recently proposed population based algorithm which simulates the teaching-learning process of the class room. In order to solve the capacitated vehicle routing problem, a discrete teaching-learning-based optimization algorithm (DTLBO) is proposed with a new solution representation and decoding method in this paper. An elitist strategy is introduced in the TLBO algorithm to preserve the best individuals from generation to generation. At the same time, duplicate solutions are modified by mutation on randomly selected dimensions of the duplicate solutions to keep the diversity of the population. Then the 2-OPT local search is combined to improve the local search ability of the hybrid discrete teaching-learning-based optimization. Tested on the several benchmarking capacitated vehicle routing problems, the hybrid discrete teaching-learning-based optimization can achieve the optimal solutions of all selected instances.
文章引用: 刘秀城 , 刘 琼 (2014) 基于离散教与学算法求解车辆路径问题。 交通技术， 3， 16-21. doi: 10.12677/OJTT.2014.31004
 Laporte, G. (1992) The vehicle routing problem: An overview of exact and approximate algorithms. European Journal of Operational Research, 59, 345-358.
 Rao, R.V., Savsani, V.J. and Vakharia, D.P. (2011) Teachinglearning-based optimization: A novel method for constrained mechanical design optimization problems. Computer-Aided Design, 43, 303-315.
 Waghmare, G. (2013) Comments on “a note on teaching-learning-based optimization algorithm”. Information Sciences, 229, 159169.
 Rao, R.V., Savsani, V.J. and Balic, J. (2012) Teaching-learningbased optimization algorithm for un-constrained and constrained real-parameter optimization problems. Engineering Optimization, 44, 1447-1462.
 Toğan, V. (2012) Design of planar steel frames using teachinglearning based optimization. Engineering Structures, 34, 225232.
 Lin, S. (1965) Computer solutions of the traveling salesman problem. Bell System Technical Journal, 44, 2245-2269.
 Ho, W., Ho, G.T., Ji, P., et al. (2008) A hybrid genetic algorithm for the multi-depot vehicle routing problem. Engineering Applications of Artificial Intelligence, 21, 548-557.
 Augerat, P., Belenguer, J.M., Benavent, E., et al. (1995) Computational results with a branch and cut code for the capacitated vehicle routing problem. Rapport De Re-cherché-IMAG.
 Ai, T.J. and Kachitvichyanukul, V. (2009) Particle swarm optimization and two solution representations for solving the capacitated vehicle routing problem. Computers & Industrial Engineering, 56, 380-387.
 Moghaddam, B.F., Ruiz, R. and Sadjadi, S.J. (2012) Vehicle routing problem with uncertain demands: An advanced particle swarm algorithm. Computers & Industrial Engineering, 62, 306-317.