This paper deals with various logistical optimisation problems by modelling them with modified
versions of, or problems related to, the Vehicle Routing Problem. The problem is modelled as an
Asymmetrical Capacitated Vehicle Routing Problem with multiple vehicles, the number of vehicles
being found from solving the Bin Packing Problem.
First, a linear programming formulation is constructed. Then an object-oriented programming
implementation is derived from the original formulation, and implemented into a tool used to solve
an empirical case from a construction company. The tool used is a Java-based application developed
by the author
