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.

scholarly journals The capacitated vehicle routing problem with soft time windows and stochastic travel times

2019 ◽  
Vol 28 (50) ◽  
pp. 19-33
Author(s):  
Jorge Oyola
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Time Window ◽  
Time Windows ◽  
Neighborhood Search ◽  
Travel Times ◽  
Routing Problem ◽  
Solution Approach ◽  
Capacitated Vehicle Routing Problem ◽  
Capacitated Vehicle

A full multiobjective approach is employed in this paper to deal with a stochastic multiobjective capacitated vehicle routing problem (CVRP). In this version of the problem, the demand is considered to be deterministic, but the travel times are assumed to be stochastic. A soft time window is tied to every customer and there is a penalty for starting the service outside the time window. Two objectives are minimized, the total length and the time window penalty. The suggested solution method includes a non-dominated sorting genetic algorithm (NSGA) together with a variable neighborhood search (VNS) heuristic. It was tested on instances from the literature and compared to a previous solution approach. The suggested method is able to find solutions that dominate some of the previously best known stochastic multiobjective CVRP solutions.

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.

Sign in / Sign up

Export Citation Format

Share Document