Vehicle Routing and Container Loading Problem

Research Paper
Pages 15 (3765 words)
Download 0
Business men, supply chain operators salesmen and other distributors transfer goods from one point to another. For the goods to satisfy the client's utility needs, they need to reach him/her at the destined time and in the right quality and quantity. The supplier is faced by the problem of organizing and scheduling his vehicles so that they deliver goods to the clients using the most affordable method.


To optimize on the supply chain operation, researchers developed solutions for the vehicle routing problem (VLP) and also the container loading problem (CLP). It is impossible to optimize the routing process only and fail to optimize the CLP process. Likewise is impossible to develop solutions for CLP without developing VLP solutions. This paper suggests the use of an integrated approach to solve the routing problem.
Several methods have been put across by different mathematician to help tackle the routing and packing problems. Some of these methods include the formulation of mathematical models, the use of algorithms as well as the integration of the two methods. This paper suggests the use of an integrated vehicle routing and container packing problem with the use of generic algorithms.
G= (VA) which represents the complete graph with V representing the nodes and A representing the arc set, the vertex set V is described by V= and 0 represent the depot and represent the nodes. K represents the number of available vehicles. The vehicles are defined by their length, width and height. These dimensions are defined as HK, MK, WK,LK which represent the height , weight, width and length of the vehicle. ...
Download paper
Not exactly what you need?