tailieunhanh - Fleet sizing problem with time windows using genetic algorithm

This paper presents solution for fleet sizing problem with time windows (FSPTW) using genetic algorithm (GA). FSPTW involves identifying the optimal number of vehicles in environments with shuttle transportation tasks with known demands and predefined time windows. Those environments are very common place business settings where items are transferred again and again between more than one machines by means of a fleet of vehicles. Usual examples of such environments are manufacturing factories, warehouses and container ports. Two container ports were selected as case studies for this research. Results show that the suggested approach is quiet effective, as it provides solutions that are competitive with the best known in the literature. | Fleet sizing problem with time windows using genetic algorithm

crossorigin="anonymous">
Đã phát hiện trình chặn quảng cáo AdBlock
Trang web này phụ thuộc vào doanh thu từ số lần hiển thị quảng cáo để tồn tại. Vui lòng tắt trình chặn quảng cáo của bạn hoặc tạm dừng tính năng chặn quảng cáo cho trang web này.