The robust counterpart open capacitated vehicle routing problem with time windows on waste transport problems

Abstract

The optimum route for garbage transport vehicles is restricted by vehicle capacity and time windows that the garbage transport vehicle starts at the origin and does not return to the origin. The problem of transporting waste routes is a robust optimization problem where the amount of waste in an area and travel time is uncertain. In the real world, traffic jams and vehicle engine damage can cause delays. This paper proposes the robust counterpart open capacitated vehicle routing problem (denoted by RCOCVRP) with soft time windows model. The aim of RCOCVRP with soft time windows model is to find schedule and optimum route of transporting waste. This model calculation uses LINGO software and GAMS software. Finally for the evaluation of the RCOCVRP model with soft time windows on the proposed waste transportation problem is conducted so that it hasa feasible solution.

Solving hybrid-vehicle routing problem using modified simulated annealing

“…The objective function is given in (1) which is the total cost including electricity cost as well as fuel cost that can be evaluated using formulas (5) and (6). The first constraint is to make sure that all customers were visited only once is given by (2).…”

“…On the other hand, in vehicle routing problem with time windows (VRPTW); the service time at each customer is within a specific time window, a two stage algorithm is proposed by Lim [5] to solve VRPTW; in the first stage the algorithm minimizes the number of vehicles with an ejection pool, then it minimizes the total travel distance using a multi-start iterated hill-climbing algorithm. Yuliza et al [6] solved an open capacitated vehicle routing problem for waste transporting problems, with uncertain amount of waste and travel time.…”

Assistance and Introduction of Research Opportunities in Optimization for Mathematics Students in Indonesia

“…Di sesi ini juga dikenalkan penelitian terkait bidang transportasi dan permodelan khususnya Vehicle Routing Problem (VRP). Tujuan penelitian, tahapan-tahapan penelitian, karakteristik model, algoritma penyelesaian hingga penelitian lanjutan tentang VRP (Yuliza et al, 2020(Yuliza et al, :2075 semuanya dijelaskan pada sesi pertama ini yang diakhiri dengan diskusi antara narasumber dan peserta. Yuliza et al (2020) (Yuliza et al, 2020).…”

“…Tujuan penelitian, tahapan-tahapan penelitian, karakteristik model, algoritma penyelesaian hingga penelitian lanjutan tentang VRP (Yuliza et al, 2020(Yuliza et al, :2075 semuanya dijelaskan pada sesi pertama ini yang diakhiri dengan diskusi antara narasumber dan peserta. Yuliza et al (2020) (Yuliza et al, 2020). Selain itu, Garcia & You (2015) juga menjelaskan bahwa peluang penelitian di bidang supply chain dapat ditinjau dari model, algoritma, metode komputasi, dan implementasinya dalam bidang industri.…”

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

“…Hartono et al, 2018;Puspita et al, 2018b This research discusses the optimization modeling of robust counterpart open capacitated vehicle routing problem (RCOCVRP) with soft time windows, which means that the arrival time of the vehicle in a TDS (or in FDS) can be equal to or more than the nal time. Yuliza et al, 2020b has proposed the RCOCVRP model with time windows on the problem of transporting garbage vehicles. This model is solved with an exact approach.…”