Vehicle Routing Problem with FullLoad and Driving Distance Restriction

The graphmodelwas applied to solve the vehicle routing problem with full load (VRPFL) and a driving distance restriction. A route choicemodelwith a driving distance restriction was setup through transforming the driving distance restriction into the objective restriction. The genetic algorithm based on decimal codingwas given to solve theVRPFLwith a driving distance restriction and verified through an example. The result of the example shows the validity of thismethod to solve the VRPFL with a driving distance restriction.