Free cookie consent management tool by TermsFeed Policy Generator

Changes between Version 8 and Version 9 of Documentation/Reference/VehicleRoutingProblem


Ignore:
Timestamp:
01/21/14 15:07:15 (11 years ago)
Author:
svonolfe
Comment:

--

Legend:

Unmodified
Added
Removed
Modified
  • Documentation/Reference/VehicleRoutingProblem

    v8 v9  
    11= Vehicle Routing Problem =
    22The vehicle routing problem (VRP) is a class of problems that frequently occurs in the field of transportation logistics. The original formulation of the problem
    3 has been defined in the late 1950ies and consists of a fleet of vehicles serving a set of customers with a certain demand from a single depot. The implementation in HeuristicLab covers the capacitated problem formulation with time windows (CVRPTW). Additionally, in version 3.4 pickup and delivery formulations and multiple depots are also supported.
     3has been defined in the late 1950ies and consists of a fleet of vehicles serving a set of customers with a certain demand from a single depot. The implementation in HeuristicLab covers the capacitated problem formulation with time windows (CVRPTW). Additionally, in version 3.4 pickup and delivery formulations and multiple depots are also supported. Find more information about the supported variants in a blog article: http://dev.heuristiclab.com/trac/hl/core/blog/svonolfe/vrp_34.
    44
    55== Benchmark instances ==