Đang chuẩn bị liên kết để tải về tài liệu:
Vehicle Routing Problem

Không đóng trình duyệt đến khi xuất hiện nút TẢI XUỐNG

The Vehicle Routing Problem (VRP) dates back to the end of the fifties of the last century when Dantzig and Ramser set the mathematical programming formulation and algorithmic approach to solve the problem of delivering gasoline to service stations. Since then the interest in VRP evolved from a small group of mathematicians to the broad range of researchers and practitioners, from different disciplines, involved in this field today

TÀI LIỆU LIÊN QUAN

The electric vehicle routing problem with backhauls

Enhanced heuristic algorithms with a vehicle travel speed model for time dependent vehicle routing: A waste collection problem

Green open location-routing problem considering economic and environmental costs

The multi-depot electric vehicle location routing problem with time windows

A novel two-phase approach for solving the multi-compartment vehicle routing problem with a heterogeneous fleet of vehicles: a case study on fuel delivery

Solving min max capacitated vehicle routing problem by local search

Adaptive search techniques for problems in vehicle routing, part I: A survey

A generalized multi-depot vehicle routing problem with replenishment based on LocalSolver

A metaheuristic algorithm for the multi-depot vehicle routing problem with heterogeneous fleet

Variable neighborhood search algorithm for the green vehicle routing problem
Đã 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.