A novel membrane algorithm for capacitated vehicle routing problem

Soft Computing

Volumn 19, Issue 2, 2015, Pages 471-482

  Niu, Yunyun ^a   Wang, Shuo ^b   He, Juanjuan ^b   Xiao, Jianhua ^c  

^a PEKING UNIVERSITY   (China)

^b HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

^c NANKAI UNIVERSITY   (China)

Author keywords

Ant colony optimization; Capacitated vehicle routing problem; Max min ant system; Membrane algorithm

Indexed keywords

ANT COLONY OPTIMIZATION; ROUTING ALGORITHMS; VEHICLE ROUTING; VEHICLES;

ANT COLONY OPTIMIZATION (ACO); ANT SYSTEMS; BENCH-MARK PROBLEMS; CAPACITATED VEHICLE ROUTING PROBLEM; CONVERGENCE RATES; ELEMENTARY MEMBRANES; PARALLEL FRAMEWORK; POPULATION DIVERSITY;

MEMBRANES;

EID: 84921700302     PISSN: 14327643     EISSN: 14337479     Source Type: Journal    
DOI: 10.1007/s00500-014-1266-0     Document Type: Article

References (23)

1. Baker BM, Ayechew MA (2003) A genetic algorithm for the vehicle routing problem. Comput Oper Res 7:301–317
2. Chen AL, Yang GK, Wu ZM (2006) Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problem. J Zhejiang Univ Sci A 7:607–614
3. Colorni A, Dorigo M, Maniezzo V (1991) Distributed optimization by ant colonies. Proc First Eur Conf Artif Life 1991:134–142
4. Colorni A, Dorigo M, Maniezzo V (1992) An investigation of some properties of ant algorithm. Elsevier Publishing, Brussels
5. Dantzig G, Ramser JH (1959) The truck dispatching problem. Manag Sci 6:80–91
6. Dorigo M, Di Caro G, Gambardella LM (1999) Ant algorithms for discrete optimization. Artif Life 5:137–172
7. Gendreau M, Laporte G, Musaraganyi C, Taillard ED (1999) A tabu search heuristic for the heterogeneous fleet vehicle routing problem. Comput Oper Res 41:421–451
8. Gendreau M, Iori M, Laporte G, Martello S (2008) A tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints. Networks 1:4–18
9. Lawrence B, Bruce G (1981) Classification of vehicle routing and scheduling. Networks 11:97–108
10. Lin S, Kernighan BW (1973) An effective heuristic algorithm for the TSP. Oper Res 21:498–516
11. Nishida TY (2005) Membrane algorithm: an approximate algorithm for NP-complete optimization problems exploiting P-systems. In: Proceedings of 6th international workshop on membrane computing, pp 26–43
12. Osman IH, Abo-Sinna MA, Mouse AA (2005) An effective genetic algorithm approach to multiobjective routing problems. Appl Math Comput 162:769–781
13. Păun Gh (2000) Computing with membranes. J Comput Syst Sci 61(1):108–143
14. Păun Gh (2002) Membrane computing: an introduction. Springer, Berlin
15. Păun Gh, Rozenberg G, Salomaa A (2010) The Oxford handbook of membrane computing. Oxford University Press, Oxford
16. Stützle T, Hoos H (1996) Improving the ant-system: a detailed report on the MAX–MIN ant system. Technical Report AIDA-96-12, FG Intellektik, TH Darmstadt
17. Stützle T, Hoos H (1997) MAX–MIN ant system and local search for the traveling salesman problem. Int Conf Evol Comput 1997:308–313
18. Stützle T, Hoos H (2000) MAX–MIN ant system. Futur Gener Comput Syst 16:889–914
19. Tarasewich P, McMullen PR (2002) Swarm intelligence: power in numbers. Commun ACM 45(8):62–67
20. Tavakkoli-Moghaddam R, Safaei N, Gholipour Y (2006) A hybrid simulated annealing for the capacitated vehicle routing problems with the independent tour length. Appl Math Comput 176:445–454
21. Zachariadis E, Tarantilis C, Kiranoudis C (2009) A guided tabu search for the vehicle routing problem with two-dimensional loading constraints. Eur J Oper Res 195:729–743
22. Zhang G, Gheorghe M, Wu C (2008) A quantum-inspired evolutionary algorithm based on P systems for knapsack problem. Fundam Inform 87:93–116
23. Yu B, Yang Z, Ya B (2009) An improved ant colony optimization for vehicle routing problem. Eur J Oper Res 196:171–176