Ứng dụng thuật toán đàn kiến trong giải quyết bài toán đường đi với khung thời gian trong ngành công nghiệp thực phẩm

0 Người đánh giá. Xếp hạng trung bình 0

Tác giả: #VALUE!

Ngôn ngữ: Vie

Ký hiệu phân loại:

Thông tin xuất bản: Cơ khí Việt Nam 2023

Mô tả vật lý: 279-287

Bộ sưu tập: Metadata

ID: 407757

Thêm vào giỏ Liên kết toàn văn

Tóm tắt
Chủ đề

Áp dụng tối mi hóa đàn kiến (ACO), bài bảo này trình bày nghiên cứu về vẩn đề định tuyến phương tiện có cửa sổ thời gian (VRPTW) trong ngành công nghiệp thực phẩm mà các sản phẩm chỉnh là dễ hỏng và tuổi thọ ngắn. Tại Việt Nam, để có sự tăng trưởng bền vững trong lĩnh vực này, đòi hỏi phải mở rộng hơn nữa mạng lưới phân phối của các công ty, do đó, các hệ thống hậu cần được vận hành dưới áp lực phải nhanh hơn và đáng tin cậy hơn với các yêu cầu về thời gian. Trong nghiên cứu này, đề xuất hai phương pháp giải nhằm tìm ra lộ trình tối ưu trong giao hàng. Mục tiêu chính là giảm thiểu tổng chi phí bao gồm cả vận chuyển và chi phi phạt. Trong phương pháp đầu tiên, mô hình lập trình so nguyên hon hợp (MIP) được phát triên đê tìm nghiêm chính xác bằng phương pháp rẽ nhánh và ràng buộc. Các kết quả được thu thập bởi CPLEX. Trong phần thứ hai, meta-heuristic được áp dụng đê tìm giải pháp toi ưu là Ant Colony Optimization (ACO), kết quả được cung câp bởi Python. Nghiên cứu cũng tính đến những hạn chế về hai loại phương tiện cho các quãng đường di chuyên khác nhau. Dừ liệu thực về các món ăn nhiều hơi ở Việt 'Nam được áp dụng cho các bài kiếm tra tính toán. Kết quả cho thấy, phương pháp chính xác cung cấp giải pháp tốt hơn phương pháp meta-heuristic. Tuy nhiên, nó mất nhiều thời gian tính toán hơn và số lượng khách hàng bị hạn chế., Tóm tắt tiếng anh, Apply Ant Colony Optimization (ACO) this paper studied about the vehicle routing problem with time windows (VRPTW) in food industry which main products are perishable and short lifespan. In Vietnam, there has a sustainable growth in this area that requires expanding more in the distribution network of companies. Thus, the logistics systems are operated under pressure to be more speedy and more reliable with time requirements. In this study, it proposed two solving methods which aim to find optimal route in delivery. The main objective is to minimize the total cost which include both shipping and penalty cost. In the first method, a mix integer programming (MIP) model is developed to find exact solution by branch-and-bound methods. The results are collected by CPLEX. In the second one, meta-heuristics is applied to find optimal solution to be Ant Colony Optimization (ACO), the result is provided by Python. The study also takes in to account the constraints about two types of vehicles for different traveling distance. The real data of steamy foods in Vietnam is applied for computation tests. The results showed the exact method provide better solution than meta-heuristics one. However, it is taken more computation time and limited the number of customers.

Tạo bộ sưu tập với mã QR