Talal AlGhazo

Follow up operations and write reports to all countries

VehicleRoutingProblemwithSynchronizationConstraints
The vehicle routing problem (VRP) is a concept that studies all available routes to deliver demand to a given
set of customers by using explores set of vehicles, and then choose the optimal route for each vehicle, to save
time, effort, cost, fuel, and maintenance of vehicles and the number of employees who drive the vehicles.
This factory has two types of vehicle, classified by technology properties. First type is vehicles with crane, the
other type has no crane, also, we have two types of customers, type one has a crane equipped in the location
and type two has no crane. The crane is used to the load and unload of products from and on the vehicle.
Vehicles with cranes can visit customers with or without cranes. Whereas, vehicle without crane can only visit
customers with cranes or visit customers without cranes only if a vehicle equipped with crane visits the same
customers.
To develop an optimized plan of visits and distributing a new model is constructed and solved by CPLEX
software while considering multiple objectives.