Ứng dụng phương pháp khởi đầu nâng cao nhằm nâng cao hiệu quả giải quyết bài toán định tuyến
Tóm tắt
Từ khóa
#Bài toán định tuyến #phân nhánh và chặn #học máy #khởi đầu nâng cao #tìm kiếm lân cận gần nhấtTài liệu tham khảo
<li>C. K. Heng, A. N. Zhang, P. S. Tan, and Y.-S. Ong, "Multi-objective heterogeneous capacitated vehicle routing problem with time windows and simultaneous pickup and delivery for urban last mile logistics", in Proc. the 18th Asia Pacific Symposium on Intelligent and Evolutionary Systems, vol. 1, 2015: Springer, pp. 129-140.</li>
<li>K. V. Tiwari and S. K. Sharma, "An optimization model for vehicle routing problem in last-mile delivery", <i>Expert Systems with Applications</i>, vol. 222, p. 119789, 2023.</li>
<li>Z. Nourmohammadi, B. Hu, D. Rey, and M. Saberi, "A data-driven preference learning approach for multi-objective vehicle routing problems in last-mile delivery", <i>Transportation Research Part C: Emerging Technologies</i>, vol. 174, p. 105101, 2025.</li>
<li>İ. İlhan, "An improved simulated annealing algorithm with crossover operator for capacitated vehicle routing problem", <i>Swarm and Evolutionary Computation</i>, vol. 64, p. 100911, 2021.</li>
<li>C. E. Gounaris, W. Wiesemann, and C. A. Floudas, "The robust capacitated vehicle routing problem under demand uncertainty", <i>Operations Research</i>, vol. 61, no. 3, pp. 677-693, 2013.</li>
<li>Z. Borcinova, "Two models of the capacitated vehicle routing problem", <i>Croatian Operational Research Review</i>, vol. 8, pp. 463-469, 2017.</li>
<li>T. K. Ralphs, L. Kopman, W. R. Pulleyblank, and L. E. Trotter, "On the capacitated vehicle routing problem", <i>Mathematical Programming</i>, vol. 94, pp. 343-359, 2003.</li>
<li>R. I. Muslem and M. K. Nasution, "Algorithms and Approaches for the Vehicle Routing Problem with Pickup and Delivery (VRPPD): A Survey", in Proc. 2024 Ninth International Conference on Informatics and Computing (ICIC), 2024: IEEE, pp. 1-5.</li>
<li>G. D. Konstantakopoulos, S. P. Gayialis, and E. P. Kechagias, "Vehicle routing problem and related algorithms for logistics distribution: A literature review and classification", <i>Operational Research</i>, vol. 22, no. 3, pp. 2033-2062, 2022.</li>
<li>F. Yang and F. Tao, "A bi-objective optimization VRP model for cold chain logistics: Enhancing cost efficiency and customer satisfaction", <i>IEEE Access</i>, vol. 11, pp. 127043-127056, 2023.</li>
<li>S. Pan, V. Giannikas, Y. Han, E. Grover-Silva, and B. Qiao, "Using customer-related data to enhance e-grocery home delivery", <i>Industrial Management & Data Systems</i>, vol. 117, no. 9, pp. 1917-1933, 2017.</li>
<li>J. Fitzpatrick, D. Ajwani, and P. Carroll, "A scalable learning approach for the capacitated vehicle routing problem", <i>Computers & Operations Research</i>, vol. 171, p. 106787, 2024.</li>
<li>G. B. Dantzig and J. H. Ramser, "The truck dispatching problem", <i>Management Science</i>, vol. 6, no. 1, pp. 80-91, 1959.</li>
<li>A. M. Altabeeb, A. M. Mohsen, L. Abualigah, and A. Ghallab, "Solving capacitated vehicle routing problem using cooperative firefly algorithm", <i>Applied Soft Computing</i>, vol. 108, p. 107403, 2021.</li>
<li>J. Chi, S. He, and R. Song, "Solving capacitated vehicle routing problem with three-dimensional loading and relocation constraints", <i>Computers & Operations Research</i>, vol. 173, p. 106864, 2025.</li>
<li>J. Luo and C. Li, "An efficient encoder-decoder network for the capacitated vehicle routing problem", <i>Expert Systems with Applications</i>, vol. 278, p. 127311, 2025.</li>
<li>Y. Hao, Z. Chen, X. Sun, and L. Tong, "Planning of truck platooning for road-network capacitated vehicle routing problem", <i>Transportation Research Part E: Logistics and Transportation Review</i>, vol. 194, p. 103898, 2025.</li>
<li>J. Li, R. Liu, and R. Wang, "Handling dynamic capacitated vehicle routing problems based on adaptive genetic algorithm with elastic strategy", <i>Swarm and Evolutionary Computation</i>, vol. 86, p. 101529, 2024.</li>
<li>N. A. Kyriakakis, I. Sevastopoulos, M. Marinaki, and Y. Marinakis, "A hybrid Tabu search–Variable neighborhood descent algorithm for the cumulative capacitated vehicle routing problem with time windows in humanitarian applications", <i>Computers & Industrial Engineering</i>, vol. 164, p. 107868, 2022.</li>
<li>M. Karimi-Mamaghan, M. Mohammadi, P. Meyer, A. M. Karimi-Mamaghan, and E.-G. Talbi, "Machine learning at the service of meta-heuristics for solving combinatorial optimization problems: A state-of-the-art", <i>European Journal of Operational Research</i>, vol. 296, no. 2, pp. 393-422, 2022.</li>
<li>S. Voigt, "A review and ranking of operators in adaptive large neighborhood search for vehicle routing problems", <i>European Journal of Operational Research</i>, vol. 322, no. 2, pp. 357-375, 2025.</li>
<li>F. Alesiani, G. Ermis, and K. Gkiotsalitis, "Constrained clustering for the capacitated vehicle routing problem (CC-CVRP)", <i>Applied Artificial Intelligence</i>, vol. 36, no. 1, p. 1995658, 2022.</li>
<li>F. Alkaabneh, A. Diabat, and H. O. Gao, "Benders decomposition for the inventory vehicle routing problem with perishable products and environmental costs", <i>Computers & Operations Research</i>, vol. 113, p. 104751, 2020.</li>
<li>M. M. Aguayo, F. N. Avilés, S. C. Sarin, and C. Archetti, "The vehicle routing problem with transfers", <i>Computers & Operations Research</i>, vol. 177, p. 106980, 2025.</li>
<li>W. Najy, C. Archetti, and A. Diabat, "Collaborative truck-and-drone delivery for inventory-routing problems", <i>Transportation Research Part C: Emerging Technologies</i>, vol. 146, p. 103791, 2023.</li>
<li>A. Fragkogios, Y. Qiu, G. K. Saharidis, and P. M. Pardalos, "An accelerated benders decomposition algorithm for the solution of the multi-trip time-dependent vehicle routing problem with time windows", <i>European Journal of Operational Research</i>, vol. 317, no. 2, pp. 500-514, 2024.</li>
<li>S. Irnich, P. Toth, and D. Vigo, "Chapter 1: The family of vehicle routing problems", in <i>Vehicle Routing: Problems, Methods, and Applications</i>, Second Edition: SIAM, 2014, pp. 1-33.</li>
<li>P. Indyk and R. Motwani, "Approximate nearest neighbors: towards removing the curse of dimensionality", in Proc. the thirtieth annual ACM symposium on Theory of Computing, 1998, pp. 604-613.</li>
<li>E. B. Edis and I. Ozkarahan, "A combined integer/constraint programming approach to a resource-constrained parallel machine scheduling problem with machine eligibility restrictions", <i>Engineering Optimization</i>, vol. 43, no. 2, pp. 135-157, 2011.</li>
<li>S. M. Pour, J. H. Drake, L. S. Ejlertsen, K. M. Rasmussen, and E. K. Burke, "A hybrid constraint programming/mixed integer programming framework for the preventive signaling maintenance crew scheduling problem", <i>European Journal of Operational Research</i>, vol. 269, no. 1, pp. 341-352, 2018.</li>
<li>G.-H. Chen, J.-C. Jong, and A. F.-W. Han, "Applying constraint programming and integer programming to solve the crew scheduling problem for railroad systems: Model formulation and a case study", <i>Transportation Research Record</i>, vol. 2676, no. 1, pp. 408-420, 2022.</li>
<li>C. Blum, "Construct, merge, solve and adapt: Application to the minimum global domination problem", <i>TOP</i>, pp. 1-21, 2024.</li>
<li>F. Ornelas, A. Santiago, J. A. Castan Rocha, S. Ibarra Martínez, and A. H. García, "Warm Starting Integer Programming for the Internet SHopping Optimization Problem with Multiple Item Units (ISHOP-U)", in <i>Artificial Intelligence in Prescriptive Analytics: Innovations in Decision Analysis, Intelligent Optimization, and Data-Driven Decisions</i>, 2024, pp. 153-170.</li>
<li>A. Etminaniesfahani, H. Gu, L. M. Naeni, and A. Salehipour, "An efficient relax-and-solve method for the multi-mode resource constrained project scheduling problem", <i>Annals of Operations Research</i>, vol. 338, no. 1, pp. 41-68, 2024.</li>
<li>W. Murray and H. Shek, "A local relaxation method for the cardinality constrained portfolio optimization problem", <i>Computational Optimization and Applications</i>, vol. 53, pp. 681-709, 2012.</li>
<li>E. John and E. A. Yıldırım, "Implementation of warm-start strategies in interior-point methods for linear programming in fixed dimension", <i>Computational Optimization and Applications</i>, vol. 41, no. 2, pp. 151-183, 2008.</li>
