Như đã đề cập ở phần giới thiệu tổng quan trong chương 1, bài tốn VRP là một bài tốn rất lớn và cĩ lịch sử nghiên cứu lâu đời, suốt 50 qua, đã cĩ rất nhiều hướng tiếp cận được đề xuất để giải quyết bài tốn và các biến thể của bài [4]. Do đĩ, một trong những hướng phát triển của đề tài là tìm hiểu và áp dụng các kỹ thuật khác đã được đề xuất cho bài tốn VRP trong lý thuyết vào bài tốn thực tế của Vinamilk.
Khơng chỉ là một biến thể của bài tốn VRP, bài tốn giao hàng của Vinamilk cịn tích hợp một bài tốn khĩ khác trong đĩ: bài tốn Flexible Job Shop Scheduling (FJSP) – một mở rộng của bài tốn Job Shop Scheduling [51]. ðây cũng là một trong những bài tốn NP-khĩ nhận được nhiều sự quan tâm của nhà nghiên cứu, đối với hướng tiếp cận metaheuristics, ngồi hai loại phép chuyển thơng dụng mà luận văn đã áp dụng, cịn cĩ một số phép chuyển khác rất hiệu quả, chẳng hạn như các phép chuyển được đề nghị trong [49]. Vì vậy, một hướng phát triển khác nữa của đề tài là khai thác các phép chuyển này nhằm nâng cao chất lượng của quá trình tìm kiếm. Bên cạnh đĩ, việc sử dụng thuật giải leo đồi ở bước 2 của thuật giải mà luận văn đề nghị như hiện nay cĩ thể được thay thế bằng các thuật giải khác cho phép duyệt trên nhiều tập láng giềng khác nhau, chẳng hạn như thuật giải Variable Neighborhood Search [63], Adaptive Large Neighborhood Search [21].
Ngồi các hướng phát triển về mặt hướng tiếp cận kể trên, đề tài cịn cĩ thể phát treiẻn theo hướng khai thác sâu hơn các yêu cầu thực tế của bài tốn, chẳng hạn:
- Về mục tiêu bài tốn: hiện nay, bài tốn mà đề tài xét đến chỉ giới hạn ở hai mục tiêu cơ bản: cực tiểu hĩa số xe cần sử dụng và cực tiểu hĩa tổng quãng đường mà các xe phải đi trong một ngày. Hướng phát triển của đề tài sẽ là bổ sung thêm một số mục tiêu thực tế khác (chẳng hạn: độ cân bằng về quãng đường phải đi giữa các xe), các mục tiêu này cĩ thể hàm chứa sự mâu thuẫn lẫn nhau, do đĩ, một hướng phát triển khác của đề tài là ứng dụng các hướng tiếp cận của bài tốn tối ưu đa mục tiêu [48], trong đĩ, các hướng tiếp cận metaheuristic dựa trên quần thể đặc biệt hiệu quả đối với lớp bài tốn này. - Về ràng buộc của bài tốn: bổ sung thêm một số ràng buộc về thời gian (chẳng
hạn: quy định về khoảng thời gian được phép giao hàng ở các khách hàng – do cĩ một số khách hàng là các cửa hàng ở chợ, chỉ cho phép giao hàng vào buổi sáng,…, khi đĩ, bài tốn sẽ mở rộng thành biến thể VRPTW)
Tài liệu tham khảo
[1]. G. Clarke and J.V. Wright (1964), Scheduling of vehicles from a central depot to a number of delivery points, Operations Research, vol. 12, pp 568-581 [2]. V. Nagarajan and R. Ravi (2007), Poly-logarithmic Approximation
Algorithms for Directed Vehicle Routing Problems, in Proceedings of the the 10th International Workshop on Approximation (APPROX '07), Barcelona, Spain, pp 257–270
[3]. G. Laporte, M. Gendreau , J. Y. Potvin, F. Semet, Classical and Modern Heuristics for the Vehicle Routing Problem, International Transaction in Operational Research, vol. 7, pp 285-300
[4]. G. Laporte (2009), Fifty Years of Vehicle Routing, Les Cahiers du GERAD, HEC Montréal, G–2009–43, 19
[5]. J. F. Cơté, J. Y. Potvin (2008), A tabu search heuristic for the vehicle routing problem with private fleet and common carrier, European Journal of Operational Research, 198(2), pp 464-469
[6]. Li, F., Golden, B.L., and Wasil, E.A (2005), Very large-scale vehicle routing: New test problems, algorithms, and results, Computers and Operations Research, vol. 32, 1165-1179.
[7]. Cordeau, J.-F., Laporte, G., and Mercier (2004), A. Improved tabu search algorithm for the handling of route duration constraints in vehicle routing problems with time windows, Journal of the Operational Research Society, vol. 55, pp 542–546.
[8]. Prins, C (2004), A simple and effective evolutionary algorithm for the vehicle routing problem, Computers & Operations Research, vol. 3, pp 1985–2002 [9]. Reimann, M., Doerner, K., and Hartl, R.F. D-Ants (2004), Savings based ants
divided and conquer the vehicle routing problem, Computers & Operations Research, vol. 31, pp 563-591
[10].A.C.Wade, S. Salhi (2002), An investigation into a new class of vehicle routing problem with backhauls, the International Journal of Management Science, vol. 30, pp 479 – 487
[11].Baldacci, R., Battarra, M., Vigo, D., Golden, B., Raghavan, S. and Wasil, E. (2007), Routing a heterogeneous fleet of vehicles, in B.Golden, S.Ragavan and E.Wasil (editors), The Vehicle Routing Problem: Latest Advances and New Challenges, Springer-Verlag, Heidelberg, Germany, pp 3-29
[12].Wøhlk, S., A decade of capacitated arc routing (2007), in B.Golden, S.Ragavan and E.Wasil (editors), The Vehicle Routing Problem: Latest Advances and New Challenges, Springer-Verlag, Heidelberg, Germany, pp 29- 48
[13].C. Archetti, M.G. Speranza (2008), The split delivery vehicle routing problem: a survey, in B.Golden, S.Ragavan and E.Wasil (editors), The Vehicle Routing Problem: Latest Advances and New Challenges, Springer-Verlag, Heidelberg, Germany, pp 3-29
[14].P. Shaw (1998), Using constraint programming and local search methods to solve vehicle routing problems, in Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming (CP-98), Pisa, Italy, pp 417–431
[15].N. Christofidesand, S. Eilon (1969), An algorithm for the vehicle dispatching problem, Operational Research Quarterly, vol. 20, pp 309–318
[16].J.D.C. Little, K.G. Murty,D.W. Sweeney and C. Karel (1963), An algorithm for the travelling salesman problem, Operations Research, vol. 11, pp 972– 989.
[17].G. Laporte, H. Mercure and Y. Nobert (1986), An exact algorithm for the asymmetrical capacited vehicle routing problem, Networks, vol. 16, pp 33–46. [18].N. Christofides, A. Mingozzi and P. Toth (1981), Exact algorithms for the
vehicle routing problem, based on spanning tree shortest path relaxations,
Mathematical Programming, vol. 20, pp 255–282 .
[19].D. Houck, J.C. Picard, M. Queyranne and R. Vemuganti (1980), The travelling salesman problem as a constrained shortest path problem: Theory and computation experience, Opsearch, vol. 17, pp 93–109
[20].M.L. Fisher (1994), Optimal solution of vehicle routing problems using minimum K-trees, Operations Research, vol. 42, pp 626–642.
[21].S. Ropke and D. Pisinger (2006). An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows,
Transportation Science, vol. 40, pp 455–472
[22].Metropolis, N., Rosenbluth, A.W., Rosenbluth, M.N, Teller, A.H., Teller, E. (1953), Equation of State Calculation by Fast Computing Machines, Journal of Chemistry and Physical, vol. 21, pp 1087-1091
[23].Kirkpatrick, S , Gelatt, C.D, Vecchi, M.P (1983). Optimization by Simulated Annealing, Science, vol 220 (4598), pp. 671-680.
[24].William D. Harvey , Matthew L. Ginsberg (1995), Limited discrepancy search, in Proceedings of the 14th international joint conference on Artificial intelligence (IJCAI-95), Montreal, Quebec, Canada, pp 607-613
[25].Russell Bent , Pascal Van Hentenryck (2004), A Two-Stage Hybrid Local Search for the Vehicle Routing Problem with Time Windows, Transportation Science, vol. 38 (4), pp 515-530
[26].David Mester , Olli Bräysy (2005), Active guided evolution strategies for large-scale vehicle routing problems with time windows, Computers and Operations Research, vol. 32 (6), pp 1593-1614
[27].E. Prescott-gagnon, G. Desaulniers, L. M. Rousseau (2009), A branch-and- price-based large neighborhood search algorithm for the vehicle routing problem with time windows, Networks, vol. 54(4), pp 190-204.
[28].David Pisinger , Stefan Ropke (2007), A general heuristic for vehicle routing problems, Computers and Operations Research, vol. 34 (8), pp 2403-2435 [29].B.E. Gillett and L.R. Miller (1974), A heuristic algorithm for the vehicle
dispatch problem”, Operations Research, vol. 22, pp 340–349
[30].M. Fisher and R. Jaikumar (1982), A generalized assignment heuristic for vehicle routing, Networks, vol. 11, pp 109–124
[31].B.M. Baker and J.Sheasby (1999), Extensions to the generalised assignment heuristic for vehicle routing, European Journal of Operational Research, vol.119, pp 147–157
[32].C.D. Tarantilis (2005), Solving the vehicle routing problem with adaptive memory programming methodology, Computers & Operations Research, vol. 32, pp 2309–2327
[33].M. Desrochers, J. Lenstra, M. Savelsbergh, and F. Soumis (1988), Vehicle routing with time windows: optimization and approximation, In Bruce L. Golden and Arjang A. Assad (editors), Vehicle Routing: Methods and Studies, North-Holland, Amsterdam, pp 65--84
[34].N. Bansal , A. Blum , S. Chawla , A. Meyerson (2004), Approximation algorithms for deadline-TSP and vehicle routing with time-windows, in Proceedings of the thirty-sixth annual ACM symposium on Theory of computing(STOC '04), New York, USA
[35].S. Ropke (2005), Heuristic and exact algorithms for vehicle routing problems, Ph.D. Thesis, Computer science department at the University of Copenhagen (DIKU)
[36].B.E. Gillet and L.R. Miller (1974), A heuristic algorithm for the vehicle- dispatch problem. Operations Research, vol. 22, pp 340–349
[37].G. Laporte and F. Semet (2002), Classical heuristics for the capacitated VRP, In P. Toth and D. Vigo (Editors), The Vehicle Routing Problem, SIAM, Philadelphia, pp 109-149
[38].Khoa, T., Nguyen, D., Tien, D. (2001) An Approximation Approach for a Real-World Variant of Vehicle Routing Problem, accepted in the 3rd Asian Conference on Intelligent Information and Database Systems (ACIIDS2011) [39].Ortega, P., Oliva, C., Ferland, J., Cepeda M. (2009), Multiple ant colony
system for a VRP with time windows and scheduled loading. Ingeniare Revista chilena de ingeniera, vol. 17, pp 393–403
[40].F. Glover (1989), Tabu Search - part I, ORSA Journal on Computing, vol.1 (3), pp 190-206
[41].M. Gendreau, J. Y. Potvin, O. Braysy, G. Hasle, A. Løkketangen (2007), Metaheuristics for the Vehicle Routing Problem and Its Extensions: A Categorized Bibliography, in B.Golden, S.Ragavan and E.Wasil (editors), The Vehicle Routing Problem: Latest Advances and New Challenges, Springer- Verlag, Heidelberg, Germany, pp 143-169
[42].I. Zeng, H.L. Ong and K.M. Ong (2005) An assignment-based local search method for solving vehicle routing problems, Asia-Pacific Journal of Operational Research, vol. 22, pp 85–104
[43].F. Li, B. Golden and E. Wasil (2007), A record-to-record travel algorithm for solving the heterogeneous fleet vehicle routing problem, Computers & Operations Research, vol. 34, pp 2734-2742.
[44].L.M. Rousseau, M. Gendreau and G. Pesant (2002). Using constraint-based operators to solve the vehicle routing problem with time windows, Journal of Heuristics, vol. 8, pp 43- 58
[45].J. Kytojoki, T. Nuortio, O. Braysy and M. Gendreau (2007), An efficient variable neighborhood search heuristic for very large scale vehicle routing problems, Computers & Operations Research, vol. 34, pp 2743–2757
[46].C.M.R.R. Lima, M.C. Goldbarg and E.F.G. Goldbarg (2005), A Memetic Algorithm for the Heterogeneous Fleet Vehicle Routing Problem, Electronic Notes in Discrete Mathematics. Vol. 18, pp 171-176
[47].A Chen, G Yang, Z. Wu (2006), Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problem, Journal of Zhejiang University - Science, vol. 7(4), pp 607-614
[48].R. E. Steuer (1986), Multiple criteria optimization: theory, computation and application, Krieger Publishing Company, USA, 546
[49].Mastrolilli, M., Maria, L. (2000) Effective neighbourhood functions for the flexible job shop problem, Journal of Scheduling, 3(1), 3-20
[50].Brandimarte, P. (1993) Routing and scheduling in a flexible job shop by tabu search, Annals of Operations Research, 41(3), 157-183
[51].Pinedo, M. L. (2008) Scheduling: Theory, Algorithms, and Systems, Prentice- Hall, 3rd edition, 678 pages, pp 19
[52].Pinedo, M. L. (2004) Planning and Scheduling in Manufacturing and Services, Springer Series in Operations Research and Financial Engineering, Springer New York,
[53].Taillard, E. (1994) Parallel Taboo Search Techniques for the Job Shop Scheduling Problem, ORSA Journal on Computing, 6(2): 108-117
[54].Shaw, P. (1998) Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems, Lecture Notes in Computer Science, vol 1520, pp 417-431
[55].Lenstra, J.K., Kan, A.H.G.R. “Complexity of vehicle routing and scheduling problems”. In: Networks, 11, pp. 221-227, 1981
[56].Golden, B.L., Assad, A.A., Wasil, E.A., “Routing vehicles in the real world: applications in the solid waste, beverage, food, dairy, and newspaper industries”. In: The vehicle routing problem, Society for Industrial and Applied Mathematics, Siam Monographs on Discrete Mathematics and Applications. Philadelphia, pp. 245-286 , 2001
[57].Glover, F., Laguna, M. (1997) Tabu Search, 1st edition, Springer, 408 pages [58].J. Du et J.Y. T. Leung. (1990) Minimizing total tardiness on one machine is
NP-hard, Mathematics of Operations Research, vol. 15, pp. 483 – 495
[59].Toth, P., Vigo, D. (2001) An overview of vehicle routing problem, in Toth, P., Vigo, D. (editors), The vehicle routing problem, Society for Industrial & Applied, SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, pp 1-23
[60].B.Golden, S.Ragavan and E.Wasil (2008) The Vehicle Routing Problem: Latest Advances and New Challenges, Springer-Verlag, Heidelberg, Germany, 583 pages
[61].Gaskell, T.J. (1967) Bases for vehicle fleet scheduling. Operational Research Quarterly, vol 18, pp 281-295
[62].Yellow, P. (1970) A computational modification to the savings method of vehicle scheduling, Operational Research Quarterly, vol 21, pp 281-283
[63].Mladenovi, N., Hansen, P. (1998) Variable neighborhood search, Computers & Operations Research, vol 24 (11), pp 1097-1100
Danh mục các cơng trình của tác giả
Các cơng trình liên quan trực tiếp đến đề tài:
1. Nguyen, D., Tien, D. (2011) A Multi-Stage Local Search for a Real-world Vehicle Routing Problem, accepted at the 7th International Conference on Natural Computation, Shanghai, China
2. Khoa, T., Nguyen, D., Tien, D. (2011) An Approximation Approach for a Real- World Variant of Vehicle Routing Problem, accepted in the 3rd Asian Conference on Intelligent Information and Database Systems (ACIIDS2011)
Các cơng trình khác:
3. Khang, N. T. T. M., Nguyen, D. T. T., Khon, T. T. , Nuong, T. T. H. (2010) Using Tabu Search for Solving a High School Timetabling Problem, in N.T. Nguyen et al. (Eds): Adv. in Intelligent Inform and Database Systems, SCI, vol. 283, pp 305 – 313
4. Khang, N., Tung P., Nga, L., Nguyen, D., Nuong, T. (2010) Simulated Annealing- based Algorithm for a Real-world High School Timetabling Problem, in the Proceedings of the 2010 Second International Conference on Knowledge and Systems Engineering (KSE2010), pp. 125 – 130
1. Nguyen, D., Tien, D. (2011) A Multi-Stage Local Search for a Real-world Vehicle Routing Problem, accepted at the 7th International Conference on Natural Computation, Shanghai, China
2. Khoa, T., Nguyen, D., Tien, D. (2011) An Approximation Approach for a Real-World Variant of Vehicle Routing Problem, accepted in the 3rd Asian Conference on Intelligent Information and Database Systems (ACIIDS2011)
3. `Khang, N. T. T. M., Nguyen, D. T. T., Khon, T. T. , Nuong, T. T. H. (2010) Using Tabu Search for Solving a High School Timetabling Problem, in N.T. Nguyen et al. (Eds): Adv. in Intelligent Inform and Database Systems, SCI, vol. 283, pp 305 – 313
4. Khang, N., Tung P., Nga, L.,
Annealing-based Algorithm for a Real
Problem, in the Proceedings of the 2010 Second International Conference on Knowledge and Systems Engineering (KSE2010), pp. 125
Khang, N., Tung P., Nga, L., Nguyen, D., Nuong, T. (2010) Simulated based Algorithm for a Real-world High School Timetabling Problem, in the Proceedings of the 2010 Second International Conference on Knowledge and Systems Engineering (KSE2010), pp. 125 – 130
Nguyen, D., Nuong, T. (2010) Simulated world High School Timetabling Problem, in the Proceedings of the 2010 Second International Conference on