A novel heuristic algorithm for capacitated vehicle routing problem
Tóm tắt
Từ khóa
Tài liệu tham khảo
Ai TJ, Kachitvichyanukul V (2009) Particle swarm optimization and two solution representations for solving the capacitated vehicle routing problem. Comput Ind Eng 56:380–387. doi: 10.1016/j.cie.2008.06.012
Akpinar S (2016) Hybrid large neighbourhood search algorithm for capacitated vehicle routing problem. Expert Syst Appl 61:28–38. doi: 10.1016/j.eswa.2016.05.0230957-4174
Cui L, Wang L, Deng J, Zhang J (2013) A new improved quantum evolution algorithm with local search procedure for capacitated vehicle routing problem. Math Probl Eng. doi: 10.1155/2013/159495
Fukasawa R, Longo H, Lysgaard J, Aragao MP, Reis M, Uchoa E, Werneck RF (2006) Robust branch-and-cut-and-price for the capacitated vehicle routing problem. Math Program Ser A 106:491–511. doi: 10.1007/s10107-005-0644-x
Jin J, Crainic TG, Lokketangen A (2014) A cooperative parallel metaheuristic for capacitated vehicle routing problem. Comput Oper Res 44:33–41. doi: 10.1016/j.cor.2013.10.004
Kao Y, Chen M (2013) Solving the CVRP Problem Using a Hybrid PSO Approach, ISBN: 978-3-642-35637-7. Comput Intell 465:59–67. doi: 10.1007/978-3-642-35638-4 (Springer, Heidelberg)
Lin S-W, Lee Z-J, Ying K-C, Lee C-Y (2009) Applying hybrid meta-heuristics for capacitated vehicle routing problem. Expert Syst Appl 36:1505–1512. doi: 10.1016/j.eswa.2007.11.060
LinHui C, Luo Z (2014) An Improved Immune Genetic Algorithm for Capacitated Vehicle Routing Problem. The Open Cybernetics & Systemics Journal 8:560–565. doi: 10.2174/1874110X01408010560
Mazidi A, Fakhrahmad M, Sadreddini M (2016) A meta-heuristic approach for CVRP problem: local search optimization based on GA and ant colony. J Adv Comput Res 7:1–22
Mazzeo S, Loiseau I (2004) An ant colony algorithm for the capacitated vehicle routing. Electron Notes Discret Math 18:181–186. doi: 10.1016/j.endm.2004.06.029
Mester D, Brasys O (2007) Active-guided evolution strategies for large-scale capacitated vehicle routing problems. Comput Oper Res 34:2964–2975. doi: 10.1016/j.cor.2005.11.006
Nazif H, Lee LS (2012) Optimised crossover genetic algorithm for capacitated vehicle routing problem. Appl Math Model 36:2011–20117. doi: 10.1016/j.apm.2011.08.010
Ropke S, Pisinger D (2006) An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transp Sci 40(4):455–472
Szeto WY, Wu Y, Ho SC (2011) An artificial bee colony algorithm for the capacitated vehicle routing problem. Eur J Oper Res 215:126–135. doi: 10.1016/j.ejor.2011.06.006
Yeh CC, Lui DY, Liao YK (2016) Two-stage iterated local search for solving capacitated vehicle routing problems. Int Symp Comput Consum Control ISBN: 9781509030729