plot.heumilkr_solution

Represents the sites and runs on a 2D plane so that the distances between
sites on the drawn 2D plane correspond to <code>distances</code> provided to the
solver <code>clarke_wright()</code>.
The individual runs are distinguished by color.
The demanding site locations are marked with round circles while the
(single) supplying site is depicted as a square.
The line types (solid/dashed/...) are associated to different vehicle types.

Implements the Clarke-Wright algorithm to find a quasi-optimal solution to the Capacitated Vehicle Routing Problem. See Clarke, G. and Wright, J.R. (1964) <doi:10.1287/opre.12.4.568> for details. The implementation is accompanied by helper functions to inspect its solution.

Lukas Schneiderbauer

heumilkr

Heuristic Capacitated Vehicle Routing Problem Solver

plot.heumilkr_solution function

<dl><dt>x</dt>
<dd>A "<code>heumilkr_solution</code>" object, typically obtained by <code>clarke_wright()</code>.</dd>
<dt>...</dt>
<dd>Not used.</dd></dl>

Arguments

Plot a CVRP solution — plot.heumilkr_solution

<dl>

<dt>x</dt>
<dd>A "<code>heumilkr_solution</code>" object, typically obtained by <code>clarke_wright()</code>.</dd>


<dt>...</dt>
<dd>Not used.</dd>

</dl>

plot.heumilkr_solution: Plot a CVRP solution

Description

Usage

Arguments

Details