KOL-OH-113 — Kind-of-Lost Ohio CVRPTW dataset
=============================================

Contributor : Mario Rappi, Kind-of-Lost (independent consultant)
Contact     : i.am@kindoflost.com
Source      : https://routing.kindoflost.com/
Instances   : 1  (KOL-OH-113.xml)
Format      : VRP-REP instance specification v0.5.0 (XML)

CONTENTS
--------
KOL-OH-113.xml   1 depot + 112 delivery stops, 10 vehicles.

PROBLEM VARIANT
---------------
Capacitated vehicle routing problem with time windows (CVRPTW), with a
heterogeneous fleet and a maximum route duration.

  - 112 customer requests, each with a demand, a service time and a hard
    time window.
  - 10 vehicles, all of capacity 1200, all departing from and returning to
    node 0. Vehicles differ in fixed cost and in a speed factor applied to
    travel times (4 distinct
    profiles; see the <fleet> section). NOTE: the source model also applies a
    per-vehicle service-time factor, which version 0.5.0 of the VRP-REP
    specification has no element for. It is omitted here, so service times in
    this file are the unscaled values.
  - Maximum route duration 840 minutes (14 hours).
  - Total demand 8535.57 against total capacity 12000, so the instance is
    capacity-feasible but tight enough that assignment matters.

UNITS AND CONVENTIONS
---------------------
  - Coordinates are WGS84 geographic degrees, given as <latitude> and
    <longitude> elements (not cx/cy), so there is no axis-order ambiguity.
  - Times are minutes. Time windows are minutes past midnight; the earliest
    window opens at 495 (08:15) and the latest closes at 1050 (17:30).
  - Service times are minutes.
  - Travel times are kept to 2 decimal places (<decimals>2</decimals>); they
    are not rounded up or truncated to integers.
  - Demands are real-valued, not integer.
  - Node 0 is the depot (type 0) and has no request. Nodes 1-112 are
    customers (type 1); request i is served at node i.

DISTANCES — IMPORTANT
---------------------
Travel times are NOT Euclidean and NOT great-circle. The instance is derived
from a real road network: travel times in minutes come from OSRM
(router.project-osrm.org, car profile) over the public OpenStreetMap road
graph. Computing Euclidean distances from the coordinates will give a
different — and easier — problem than the one this instance represents.

The <distance_calculator> field in the instance names this explicitly.

To reproduce the travel-time matrix, query an OSRM table service with the
node coordinates in (lon, lat) order. Anyone comparing results should state
which distance source they used, since OSM road data changes over time.

ORIGIN OF THE DATA
------------------
Stops are real commercial and residential addresses in the Cleveland /
Cuyahoga County area of Ohio, USA, geocoded to coordinates. Demands, service
times and time windows are synthetic. Only coordinates are published here;
street addresses are not included.

LICENCE
-------
Free to use, redistribute and modify, including for commercial purposes, with
attribution to the source above. No warranty.
