ScholarGate
Asszisztens

Módszerek összehasonlítása

Tekintse át a kiválasztott módszereket egymás mellett; az eltérő sorok kiemelve jelennek meg.

Járműútvonal-tervezési Probléma (VRP)×Egészértékű programozás×
TudományterületOptimalizálásOptimalizálás
MódszercsaládProcess / pipelineProcess / pipeline
Keletkezés éve19591958
MegalkotóGeorge Dantzig & John RamserRalph Gomory (cutting planes, 1958); land-and-doig branch-and-bound (1960)
TípusCombinatorial optimization problemMathematical optimisation — exact combinatorial method
AlapműDantzig, G. B., & Ramser, J. H. (1959). The truck dispatching problem. Management Science, 6(1), 80–91. DOI ↗Wolsey, L.A. (1998). Integer Programming. Wiley. ISBN: 9780471283669
Alternatív nevekCapacitated Vehicle Routing Problem, Fleet Routing Problem, Multi-Vehicle Routing Problem, Araç Rotalama ProblemiIP, MIP, mixed-integer programming, mixed-integer linear programming
Kapcsolódó34
Összefoglaló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.Integer programming (IP), also called mixed-integer programming (MIP) when only some variables are restricted to whole numbers, is a branch of mathematical optimisation in which some or all decision variables must take integer or binary values. Building on linear programming, it was formalised through Ralph Gomory's cutting-plane method (1958) and the Land-and-Doig branch-and-bound algorithm (1960), and it has since become the standard exact framework for scheduling, assignment, routing, and resource-allocation problems.
ScholarGateAdatkészlet
  1. v1
  2. 1 Források
  3. PUBLISHED
  1. v1
  2. 2 Források
  3. PUBLISHED

Ugrás a kereséshez Diák letöltése

ScholarGateMódszerek összehasonlítása: Vehicle Routing Problem · Integer Programming. Letöltve 2026-06-15, forrás: https://scholargate.app/hu/compare