How to cite this paper
Bozorgi-Amiri, A., Mahmoodian, V., Fahimnia, E & Saffari, H. (2015). A new memetic algorithm for solving split delivery vehicle routing problem.Management Science Letters , 5(11), 1017-1022.
Refrences
Aleman, R. E., Zhang, X., & Hill, R. R. (2010). An adaptive memory algorithm for the split delivery vehicle routing problem. Journal of Heuristics, 16(3), 441-473.
Aleman, R. E., & Hill, R. R. (2010). A tabu search with vocabulary building approach for the vehicle routing problem with split demands. International Journal of Metaheuristics, 1(1), 55-80.
Anh, M. T. Q. (2014). Tabu search heuristic for vehicle routing problem with split delivery (Doctoral dissertation, International University HCMC, Vietnam).
Archetti, C., Savelsbergh, M. W., & Speranza, M. G. (2006). Worst-case analysis for split delivery vehicle routing problems. Transportation Science,40(2), 226-234.
Archetti, C., Speranza, M. G., & Hertz, A. (2006). A tabu search algorithm for the split delivery vehicle routing problem. Transportation Science, 40(1), 64-73.
Archetti, C., Speranza, M. G., & Savelsbergh, M. W. (2008). An optimization-based heuristic for the split delivery vehicle routing problem. Transportation Science, 42(1), 22-31.
Archetti, C., & Speranza, M. G. (2012). Vehicle routing problems with split deliveries. International transactions in operational research, 19(1-2), 3-22.
Archetti, C., Bianchessi, N., & Speranza, M. G. (2014). Branch-and-cut algorithms for the split delivery vehicle routing problem. European Journal of Operational Research, 238(3), 685-698.
Back, T., Fogel, D. B., & Michalewicz, Z. (1997). Handbook of evolutionary computation. IOP Publishing Ltd..
Belenguer, J. M., Martinez, M. C., & Mota, E. (2000). A lower bound for the split delivery vehicle routing problem. Operations Research, 48(5), 801-810.
Boudia, M., Prins, C., & Reghioui, M. (2007). An effective memetic algorithm with population management for the split delivery vehicle routing problem. InHybrid Metaheuristics (pp. 16-30). Springer Berlin Heidelberg.
Chen, S., Golden, B., & Wasil, E. (2007). The split delivery vehicle routing problem: Applications, algorithms, test problems, and computational results.Networks, 49(4), 318-329.
Chen, Q., Li, K., & Liu, Z. (2014). Model and algorithm for an unpaired pickup and delivery vehicle routing problem with split loads. Transportation Research Part E: Logistics and Transportation Review, 69, 218-235.
Derigs, U., Li, B., & Vogel, U. (2010). Local search-based metaheuristics for the split delivery vehicle routing problem. Journal of the Operational Research Society, 61(9), 1356-1364.
Dror, M., & Trudeau, P. (1989). Savings by split delivery routing. Transportation Science, 40, 141-145.
Dror, M., & Trudeau, P. (1990). Split delivery routing. Naval Research Logistics (NRL), 37(3), 383-402.
Golberg, D. E. (1989). Genetic algorithms in search, optimization, and machine learning. Addion wesley, 1989.
Jin, M., Liu, K., & Eksioglu, B. (2008). A column generation approach for the split delivery vehicle routing problem. Operations Research Letters, 36(2), 265-270.
Khmelev, A., & Kochetov, Y. (2015). A hybrid VND method for the split delivery vehicle routing problem. Electronic Notes in Discrete Mathematics, 47, 5-12.
Merz, P., & Freisleben, B. (2001). Memetic algorithms for the traveling salesman problem. Complex Systems, 13(4), 297-346.
Moreno, L., De Arag?O, M. P., & Uchoa, E. (2010). Improved lower bounds for the split delivery vehicle routing problem. Operations Research Letters, 38(4), 302-306.
Mota, E., Campos, V., & Corber?n, ?. (2007). A new metaheuristic for the vehicle routing problem with split demands. In Evolutionary Computation in Combinatorial Optimization (pp. 121-129). Springer Berlin Heidelberg.
St?lhane, M., Andersson, H., Christiansen, M., Cordeau, J. F., & Desaulniers, G. (2012). A branch-price-and-cut method for a ship routing and scheduling problem with split loads. Computers & Operations Research, 39(12), 3361-3375.
Wang, Y., Ma, X., Lao, Y., Wang, Y., & Mao, H. (2013). Vehicle routing problem: simultaneous deliveries and pickups with split loads and time windows. Transportation Research Record: Journal of the Transportation Research Board, (2378), 120-128.
Wang, Y., Ma, X. L., Lao, Y. T., Yu, H. Y., & Liu, Y. (2014). A two-stage heuristic method for vehicle routing problem with split deliveries and pickups.Journal of Zhejiang University SCIENCE C, 15(3), 200-210.
Wen, Z. Z., Dong, X. Y., & Han, S. (2015, June). An iterated local search for the Split Delivery Vehicle Routing Problem. In International Conference on Computer Information Systems and Industrial Applications. Atlantis Press.
Wilck IV, J. H., & Cavalier, T. M. (2012). A genetic algorithm for the split delivery vehicle routing problem. American Journal of Operations Research, 2(2), 10.
Yuyan, M., Jiafu, T., & Jing, G. (2013, July). Split delivery weighted vehicle routing problem: comparison perspective. In Control Conference (CCC), 2013 32nd Chinese (pp. 8436-8440). IEEE.
Zeng, W., He, Y. L., & Zheng, X. J. (2014, July). An ant colony algorithm with memory grouping list for multi-depot vehicle routing problem. In Advanced Materials Research (Vol. 926, pp. 3354-3358).
Zhang, J., Peng, J., Xu, Z., & Xu, W. (2012, March). SDVRP model for emergency logistics and evolutionary heuristic approach. In Automatic Control and Artificial Intelligence (ACAI 2012), International Conference on (pp. 1809-1812). IET.
Zhang, Z., He, H., Luo, Z., Qin, H., & Guo, S. (2015, April). An efficient forest-based tabu search algorithm for the Split-delivery Vehicle Routing Problem. InTwenty-Ninth AAAI Conference on Artificial Intelligence.
Aleman, R. E., & Hill, R. R. (2010). A tabu search with vocabulary building approach for the vehicle routing problem with split demands. International Journal of Metaheuristics, 1(1), 55-80.
Anh, M. T. Q. (2014). Tabu search heuristic for vehicle routing problem with split delivery (Doctoral dissertation, International University HCMC, Vietnam).
Archetti, C., Savelsbergh, M. W., & Speranza, M. G. (2006). Worst-case analysis for split delivery vehicle routing problems. Transportation Science,40(2), 226-234.
Archetti, C., Speranza, M. G., & Hertz, A. (2006). A tabu search algorithm for the split delivery vehicle routing problem. Transportation Science, 40(1), 64-73.
Archetti, C., Speranza, M. G., & Savelsbergh, M. W. (2008). An optimization-based heuristic for the split delivery vehicle routing problem. Transportation Science, 42(1), 22-31.
Archetti, C., & Speranza, M. G. (2012). Vehicle routing problems with split deliveries. International transactions in operational research, 19(1-2), 3-22.
Archetti, C., Bianchessi, N., & Speranza, M. G. (2014). Branch-and-cut algorithms for the split delivery vehicle routing problem. European Journal of Operational Research, 238(3), 685-698.
Back, T., Fogel, D. B., & Michalewicz, Z. (1997). Handbook of evolutionary computation. IOP Publishing Ltd..
Belenguer, J. M., Martinez, M. C., & Mota, E. (2000). A lower bound for the split delivery vehicle routing problem. Operations Research, 48(5), 801-810.
Boudia, M., Prins, C., & Reghioui, M. (2007). An effective memetic algorithm with population management for the split delivery vehicle routing problem. InHybrid Metaheuristics (pp. 16-30). Springer Berlin Heidelberg.
Chen, S., Golden, B., & Wasil, E. (2007). The split delivery vehicle routing problem: Applications, algorithms, test problems, and computational results.Networks, 49(4), 318-329.
Chen, Q., Li, K., & Liu, Z. (2014). Model and algorithm for an unpaired pickup and delivery vehicle routing problem with split loads. Transportation Research Part E: Logistics and Transportation Review, 69, 218-235.
Derigs, U., Li, B., & Vogel, U. (2010). Local search-based metaheuristics for the split delivery vehicle routing problem. Journal of the Operational Research Society, 61(9), 1356-1364.
Dror, M., & Trudeau, P. (1989). Savings by split delivery routing. Transportation Science, 40, 141-145.
Dror, M., & Trudeau, P. (1990). Split delivery routing. Naval Research Logistics (NRL), 37(3), 383-402.
Golberg, D. E. (1989). Genetic algorithms in search, optimization, and machine learning. Addion wesley, 1989.
Jin, M., Liu, K., & Eksioglu, B. (2008). A column generation approach for the split delivery vehicle routing problem. Operations Research Letters, 36(2), 265-270.
Khmelev, A., & Kochetov, Y. (2015). A hybrid VND method for the split delivery vehicle routing problem. Electronic Notes in Discrete Mathematics, 47, 5-12.
Merz, P., & Freisleben, B. (2001). Memetic algorithms for the traveling salesman problem. Complex Systems, 13(4), 297-346.
Moreno, L., De Arag?O, M. P., & Uchoa, E. (2010). Improved lower bounds for the split delivery vehicle routing problem. Operations Research Letters, 38(4), 302-306.
Mota, E., Campos, V., & Corber?n, ?. (2007). A new metaheuristic for the vehicle routing problem with split demands. In Evolutionary Computation in Combinatorial Optimization (pp. 121-129). Springer Berlin Heidelberg.
St?lhane, M., Andersson, H., Christiansen, M., Cordeau, J. F., & Desaulniers, G. (2012). A branch-price-and-cut method for a ship routing and scheduling problem with split loads. Computers & Operations Research, 39(12), 3361-3375.
Wang, Y., Ma, X., Lao, Y., Wang, Y., & Mao, H. (2013). Vehicle routing problem: simultaneous deliveries and pickups with split loads and time windows. Transportation Research Record: Journal of the Transportation Research Board, (2378), 120-128.
Wang, Y., Ma, X. L., Lao, Y. T., Yu, H. Y., & Liu, Y. (2014). A two-stage heuristic method for vehicle routing problem with split deliveries and pickups.Journal of Zhejiang University SCIENCE C, 15(3), 200-210.
Wen, Z. Z., Dong, X. Y., & Han, S. (2015, June). An iterated local search for the Split Delivery Vehicle Routing Problem. In International Conference on Computer Information Systems and Industrial Applications. Atlantis Press.
Wilck IV, J. H., & Cavalier, T. M. (2012). A genetic algorithm for the split delivery vehicle routing problem. American Journal of Operations Research, 2(2), 10.
Yuyan, M., Jiafu, T., & Jing, G. (2013, July). Split delivery weighted vehicle routing problem: comparison perspective. In Control Conference (CCC), 2013 32nd Chinese (pp. 8436-8440). IEEE.
Zeng, W., He, Y. L., & Zheng, X. J. (2014, July). An ant colony algorithm with memory grouping list for multi-depot vehicle routing problem. In Advanced Materials Research (Vol. 926, pp. 3354-3358).
Zhang, J., Peng, J., Xu, Z., & Xu, W. (2012, March). SDVRP model for emergency logistics and evolutionary heuristic approach. In Automatic Control and Artificial Intelligence (ACAI 2012), International Conference on (pp. 1809-1812). IET.
Zhang, Z., He, H., Luo, Z., Qin, H., & Guo, S. (2015, April). An efficient forest-based tabu search algorithm for the Split-delivery Vehicle Routing Problem. InTwenty-Ninth AAAI Conference on Artificial Intelligence.