ScholarGate
دستیار

مقایسهٔ روش‌ها

روش‌های انتخابی خود را کنار هم مرور کنید؛ ردیف‌های متفاوت برجسته شده‌اند.

مدل‌های مکان‌یابی-تخصیص×مسئله مسیریابی وسایل نقلیه (VRP)×
حوزهتحلیل فضاییبهینه‌سازی
خانوادهProcess / pipelineProcess / pipeline
سال پیدایش19631959
پدیدآورLeon Cooper; S. L. HakimiGeorge Dantzig & John Ramser
نوعSpatial facility-location optimizationCombinatorial optimization problem
منبع بنیادینCooper, L. (1963). Location-allocation problems. Operations Research, 11(3), 331–343. DOI ↗Dantzig, G. B., & Ramser, J. H. (1959). The truck dispatching problem. Management Science, 6(1), 80–91. DOI ↗
نام‌های دیگرfacility location, p-median problem, maximal covering location problem, yer-tahsis modelleriCapacitated Vehicle Routing Problem, Fleet Routing Problem, Multi-Vehicle Routing Problem, Araç Rotalama Problemi
مرتبط43
خلاصهLocation-allocation models decide where to place a set of facilities and simultaneously assign demand points to them so as to optimize an objective such as total travel cost, worst-case distance, or population covered. Rooted in the operations-research work of Cooper (1963) and Hakimi (1964) and central to network GIS, they answer questions like where to site warehouses, hospitals, fire stations, or schools to best serve a spatially distributed population.The Vehicle Routing Problem (VRP) seeks the minimum-cost set of routes for a fleet of vehicles to serve a collection of geographically dispersed customers, each with a known demand, departing from and returning to a central depot. Originally formulated as the Truck Dispatching Problem by Dantzig and Ramser in 1959, VRP is a foundational model in logistics, supply chain management, and operations research, applicable whenever goods or services must be delivered efficiently across multiple stops.
ScholarGateمجموعه‌داده
  1. v1
  2. 2 منابع
  3. PUBLISHED
  1. v1
  2. 1 منابع
  3. PUBLISHED

رفتن به جست‌وجو دریافت اسلایدها

ScholarGateمقایسهٔ روش‌ها: Location-Allocation · Vehicle Routing Problem. بازیابی‌شده در 2026-06-18 از https://scholargate.app/fa/compare