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

2021 ◽  
Vol 6 (2) ◽  
pp. 53-57
Author(s):  
Evi Yuliza ◽  
Fitri Maya ◽  
Siti Suzlin Supadi
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Nearest Neighbor ◽  
Time Windows ◽  
Heuristic Approach ◽  
Routing Problem ◽  
Capacitated Vehicle Routing Problem ◽  
Robust Counterpart ◽  
Engine Failure ◽  
Capacitated Vehicle

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.

scholarly journals Demand robust counterpart open capacitated vehicle routing problem time windows and deadline model of garbage transportation with LINGO 13.0

2020 ◽  
Vol 10 (6) ◽  
pp. 6380
Author(s):  
Fitri Maya Puspita ◽  
Ani Sahara Br. Simanjuntak ◽  
Rima Melati ◽  
Sisca Octarina
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Time Windows ◽  
Routing Problem ◽  
Capacitated Vehicle Routing Problem ◽  
Robust Counterpart ◽  
Pass Through ◽  
Improved Model ◽  
D Model ◽  
Capacitated Vehicle

Demand robust counterpart-open capacitated vehicle routing problem with time windows and deadline (DRC-OCVRPtw,d) model formed and explained in this paper, is the model used to find the minimum distance and the time needed for vehicles to transport garbage in Sukarami Sub-District, Palembang that consists of the time it takes for the vehicle to pass through the route. Time needed to transport garbage to the vehicle is called time windows. Combination of the thoses times is called deadline. The farther the distance passed by vehicle and the more garbage transported, the longer the deadline is needed. This DRC-OCVRPtw,d model is completed by LINGO 13.0 to obtain the optimal route and time deadline for Sukarami Sub-District. The model shows that the improved model of open vehicle routing problem involving the robustness, time windows and deadline can achieve the optimal routes that enable driver to save operational time in picking up the garbage compared to similar problem not involving no-time windows and deadline stated in previous research.

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

2020 ◽  
Vol 9 (5) ◽  
pp. 2074-2081 ◽  
Author(s):  
Evi Yuliza ◽  
Fitri Maya Puspita ◽  
Siti Suzlin Supadi
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Time Windows ◽  
Routing Problem ◽  
Soft Time Windows ◽  
Capacitated Vehicle Routing Problem ◽  
Robust Counterpart ◽  
Optimum Route ◽  
Transport Problems ◽  
Capacitated Vehicle

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.

scholarly journals Implementasi Capacitated Vehicle Routing Problem with Time Windows dengan Pendekatan Algoritma Sweep untuk Distribusi Pengangkutan Sampah

2021 ◽  
Vol 19 (1) ◽  
pp. 1-6
Author(s):  
Dedi Sa'dudin Taptajani
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Time Window ◽  
Time Windows ◽  
Nearest Neighbour ◽  
Routing Problem ◽  
Capacitated Vehicle Routing Problem ◽  
Capacitated Vehicle

Vehicle Routing Problem (VRP) merupakan suatu permasalahan yang berkaitan dengan bagaimana menentukan rute yang dianggap optimal dan melibatkan lebih dari satu alat angkut demi memperhatikan beberapa kendala dalam melayani sejumlah tempat layanan sesuai dengan permintaan. Salah satu varian dari VRP adalah capacitated vehicle routing problem with time window (CVRPTW) varian ini menambahkan kendala kapasitas alat angkut sebagai salah satu pertimbangan didalam mengangkut ke masing masing tujuan dan kemudian memberikan jendela waktu didalam proses pengangkutannya. Tujuan dari penulisan ini adalah menjelaskan pembentukan model dari CVRPTW untuk permasalahan rute pengangkutan sampah dari tiap rumah Sampai Ke Tempat Pembuangan Akhir, dengan pertimbangan waktu yang tersedia dan kapasitas angkut alat angkut yang tersedia, Sedangkan Penyelesaiannya yaitu dengan menggunakan pendekatan algoritma sweep. Algoritma Ini merupakan algoritma yang terdiri dari dua tahap, pada tahapan pertama yaitu clustering dari masing masing rumah dan tahap selanjurtnya yaitu membentuk rute pengiriman untuk masing-masing cluster dengan metode Nearest Neighbour, kemudian dilanjutkan dengan menentukan kapasitas alat angkut terhadap waktu yang diperlukan untuk menentukan kapan sampah ini akan di angkut ke tempat pembuangan akhir. Studi ini sangat penting dilakukan dalam rangka menerapkan dasar untuk memahami kemungkinan meningkatkan tingkat layanan pada proses pengangkutan sampah di tingkat desa.

Sign in / Sign up

Export Citation Format

Share Document