Delivery management system using the clustering based multiple ant colony algorithm: Korean home appliance delivery

International Journal of Industrial Engineering : Theory Applications and Practice

Volumn 21, Issue 2, 2014, Pages 53-65

  Kim, Taeho ^a   Lee, Hongchul ^a  

^a Korea University   (South Korea)

Author keywords

Android; Ant colony algorithm; HFVRPTW; Home appliance delivery; Information system

Indexed keywords

ANDROID (OPERATING SYSTEM); ANT COLONY OPTIMIZATION; DOMESTIC APPLIANCES; EXPERT SYSTEMS; FLEET OPERATIONS; INFORMATION SYSTEMS; VEHICLE ROUTING;

ANDROID; ANT COLONY ALGORITHMS; DELIVERY MANAGEMENT; HETEROGENEOUS FLEET; HFVRPTW; MANAGEMENT SYSTEMS; TRADITIONAL SERVICES; VEHICLE ROUTING AND SCHEDULING;

CLUSTERING ALGORITHMS;

EID: 84957043153     PISSN: 10724761     EISSN: 1943670X     Source Type: Journal    
DOI: None     Document Type: Article

References (35)

1. Bent, R., Van Hentenryck, P. (2004). A two-stage hybrid local search for the vehicle routing problem with time windows. Transportation Science, 38(4), 515-530.
2. Berger, J., Barkaoui, M. (2004). A parallel hybrid genetic algorithm for the vehicle routing problem with time windows. Computers & operations research, 31(12), 2037-2053.
3. Bowerman, R., Calamiand, P., Brent Hall, G. (1994). The space filling curve with optimal partitioning heuristic for the vehicle routing problem. European Journal of Operational Research, 76, 128-142.
4. Cordeau, J. F., Laporte, G., Mercier, A. (2001). A unified tabu search heuristic for vehicle routing problems with time windows. Journal of the Operational Research Society, 52(8), 928-936.
5. Cordeau, J.-F., Laporte, G. (2003). A tabu search heuristic for the static multi-vehicle dial-a-ride problem. Transportation Research Part B 37, 579-594.
6. Cordone, R., Calvo, R. W. (2001). A heuristic for the vehicle routing problem with time windows. Journal of Heuristics, 7(2), 107-129.
7. Czech, Z. J., Czarnas, P. (2002). A parallel simulated annealing for the vehicle routing problem with time windows. In Proceedings of 10th euromicro workshop on parallel, distributed and network-based processing, Canary Islands, Spain, 376-383.
8. Dantzig, G. B., Ramser, J. H. (1959). The Truck Dispatching Problem. Management Science, 6(1), 80-91.
9. Dondo, R., Cerdá, J. (2007). A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows. European journal of operational research, 176(3), 1478-1507
10. Dondo, R. G., Cerdá, J. (2009). A hybrid local improvement algorithm for large-scale multi-depot vehicle routing problems with time windows. Computers & Chemical Engineering, 33(2), 513-530.
11. Dorigo, M., Gambardella, L. M. (1997a). Ant colony system: A cooperative learning approach to the traveling salesman problem. Evolutionary Computation, IEEE Transactions on, 1(1), 53-66.
12. Dorigo, M., Gambardella, L. M. (1997b). Ant colonies for the travelling salesman problem. BioSystems, 43(2), 73-81.
13. Dorigo, M., Di Caro, G. (1999). The Ant Colony Optimization Metaheuristic. New Ideas in Optimization, McGraw-Hill, New York.
14. Gambardella, LM., Taillard, R., Agazzi, G. (1999). Multiple ant colony system for vehicle routing problems with time windows. In New ideas in optimization, London, UK, McGraw-Hill, 63-76.
15. Gehring, H., Homberger, J. (2002). Parallelization of a two-phase metaheuristic for routing problems with time windows. Journal of heuristics, 8(3), 251-276.
16. Haghani, A., & Banihashemi, M. (2002). Heuristic approaches for solving large-scale bus transit vehicle scheduling problem with route time constraints. Transportation Research Part A: Policy and Practice, 36(4), 309-333.
17. Homberger, J., Gehring, H. (1999). Two evolutionary metaheuristics for the vehicle routing problem with time windows. Infor-Information Systems and Operational Research, 37(3), 297-318.
18. Kim, K. C., Sun, J. U., & Lee, S. W. (2013). A Hierarchical Approach to Vehicle Routing and Scheduling with Sequential Services Using the Genetic Algorithm, International Journal of Industrial engineering, 20(1-2), 99-113.
19. Lai, M. C., Sohn, H., & Bricker, D. L. (2012). A Hybrid Benders/genetic algorithm for vehicle routing and scheduling problem. International Journal of Industrial Engineering: Theory, Applications and Practice, 19 (1).
20. Lenstra, J. K., Kan, A. H. G. (1981). Complexity of vehicle routing and scheduling problems. Networks, 11(2), 221-227.
21. Lin, S. W., Yu, V. F., Lu, C. C. (2011). A simulated annealing heuristic for the truck and trailer routing problem with time windows. Expert Systems with Applications, 38(12), 15244-15252.
22. Nanry, W. P., & Wesley Barnes, J. (2000). Solving the pickup and delivery problem with time windows using reactive tabu search. Transportation Research Part B: Methodological, 34(2), 107-121.
23. Moon, I., Lee, J. H., & Seong, J. (2012). Vehicle routing problem with time windows considering overtime and outsourcing vehicles. Expert Systems with Applications, 39(18), 13202-13213.
24. Mullen, R. J., Monekosso, D., Barman, S., Remagnino, P. (2009). A review of ant algorithms. Expert Systems with Applications, 36(6), 9608-9617.
25. Osman, I. H. (1993). Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Annals of Operations Research, 41(4), 421-451.
26. Rochat, Y., Taillard, É. D. (1995). Probabilistic diversification and intensification in local search for vehicle routing. Journal of heuristics, 1(1), 147-167.
27. Santos, L., Coutinho-Rodrigues, J., & Current, J. R. (2008). Implementing a multi-vehicle multi-route spatial decision support system for efficient trash collection in Portugal. Transportation Research Part A: Policy and Practice, 42(6), 922-934.
28. Savelsbergh, M. W. (1985). Local search in routing problems with time windows. Annals of Operations research, 4(1), 285-305.
29. Schulze, J., Fahle, T. (1999). A parallel algorithm for the vehicle routing problem with time window constraints. Annals of Operations Research, 86, 585-607.
30. Sheridan, P. K., Gluck, E., Guan, Q., Pickles, T., & Benhabib, B. (2013). The dynamic nearest neighbor policy for the multi-vehicle pick-up and delivery problem. Transportation Research Part A: Policy and Practice, 49, 178-194.
31. Solomon, M. M., 1987. Algorithms for the vehicle routing and scheduling problems with time window constraints. Operations research, 35(2), 254-265.
32. Taillard, É., Badeau, P., Gendreau, M., Guertin, F., Potvin, J. Y. (1997). A tabu search heuristic for the vehicle routing problem with soft time windows. Transportation science, 31(2), 170-186.
33. Yu, B., & Yang, Z. Z. (2011). An ant colony optimization model: The period vehicle routing problem with time windows. Transportation Research Part E: Logistics and Transportation Review, 47(2), 166-181.
34. Zachariadis, E. E., Kiranoudis, C. T. (2011). A local search metaheuristic algorithm for the vehicle routing problem with simultaneous pick-ups and deliveries. Expert Systems with Applications, 38(3), 2717-2726
35. Zhang, T., Tian, W. X., Zhang, Y. J., Zheng, X. C. (2007), August. RLC-ACS: an improved ant colony algorithm for VRPSDP. In Machine Learning and Cybernetics, 2007 International Conference on (Vol. 2, pp. 978-983). IEEE. W