MODEL MATEMATIKA GENERALIZED VEHICLE ROUTING PROBLEM DAN EKSTENSINYA STUDI KASUS: PENDISTRIBUSIAN KERTAS KARTON
Hermanto, Koko, Salmah
2015 | Disertasi | FMIPA UGMThe vehicle routing problem (VRP) is one of the most famous combinatorial optimization problems and it has been intensively studied due to the many practical applications in industrial fields, logistics,etc. A generalization of the VRP is called the generalized vehicle routing problem (GVRP) where each node of the graph partitioned into node sets called clusters, we want to find the optimal routes from the given depot to the number of predefined clusters covering exactly one node of each cluster. Furthermore, the extension of GVRP is introduced, i.e., cluster generalized vehicle routing problem (CGVRP) aiming to specify an optimal route for each vertex of every cluster. The result of this research indicated that the method of GVRP and CGVRP modeled in the form of binary variable integer linear programming and solved with an implicit enumeration algorithm. In rationing route problems using the real road network, i.e., the application of PT. Papertech Indonesia Unit II Magelang being able to implement in a way setting the intercity direct connection. This system produced the shortest route, the tour in detail, the distance between cities, and the cost of a travel.
Kata Kunci : GVRP; CGVRP; integer linear programming binary variables; the shortest path implicit enumeration.
