Heuristic Approach For Robust Counterpart Open Capacitated Vehicle Routing Problem With Time Windows

Evi Yuliza (Mathematics Department, Faculty of Mathematics and Natural Science, University of Sriwijaya, South Sumatera, Indonesia)
Fitri Maya Puspita (Mathematics Department, Faculty of Mathematics and Natural Science, University of Sriwijaya, South Sumatera, Indonesia)
Siti Suzlin Supadi (Institute of Mathematical Sciences, Faculty of Science, University of Malaya, Malaysia)

Science and Technology Indonesia
Vol. 6 No. 2 (2021): April 2021

Garbage is one of the environmental problems. The process of transporting garbage sometimes occurs delays such as congestion and engine failure. Robust optimization model called a robust counterpart open capacitated vehicle routing problem (RCOCVRP) with time windows was formulated to get over this delays. This model has formulated with the limitation of vehicle capacity and time windows with an uncertainty of waste volume and travel time. The RCOCVRP model with time windows is solved by a heuristic approach. The heuristic approach used to solve the RCOCVRP model with time windows uses the nearest neighbor and the cheapest insertion heuristic algorithm. The RCOCVRP with time windows model is implemented on the problem of transporting waste in Sako sub-district. The solutions of these two heuristic approaches are compared and analyzed. The RCOCVRP model with time windows to optimize the route problems of waste transport vehicles that is solved using the cheapest insertion heuristics algorithm is more effective than the nearest neighbor method.