<p>In this paper, the Robust Counterpart Open Capacitation Vehicle Rounting Problem (RC-OCVRP) Model has been established to optimize waste transport in districts Sako and districts Sukarami, Palembang City. This model is completed with the aid of LINGO 13.0 by using Branch and Bound solver to get the optimum route. For Sako districs, the routes are as follows: working area 1 is TPS 1-TPS 2-TPS 3-TPA with distance 53.39 km, working area 2 is TPS 1-TPS 2-TPS 3-TPA with distance 48.14 km, working area 3 is TPS 1-TPA with a distance of 22.98 km, and working area 4 is TPS 1-TPS 2-TPS 3-TPS 4-TPA with 45.45 km distance, and obtained the optimum route in Sukarami districts is as follows: working area 1 is TPS 1-TPS 2-TPA 44.39 km, working area 2 is TPS 1-TPS 2-TPS 3-TPA with distance 49.32 km, working area 3 is TPS 1-TPS 3-TPA-TPS 2-TPA with distance 58.57 km, and working area 4 is TPS 1-TPA with a distance of 24.07 km, working area 5 is TPS 1-TPS 3-TPA-TPS 2-TPS 4-TPA with a distance of 77.66 km, and working area 6 is a TPS 1-TPS 2-TPS 3-TPA with a distante 44.94 km.</p>
Penulisan karya ilmiah bukan merupakan hal yang baru dalam dunia akademik. Karya ilmiah yang ditulis dapat berupa artikel, makalah, skripsi, tesis, disertasi, maupun jurnal. Penelitian pendukung, sumber teori, dan sumber bacaan sangat diperlukan dalam penulisan, sehingga jika ingin disadur atau disitasi dalam tulisan maka perlu ditulis sumbernya. Penulisan sitasi yang banyak memerlukan ketelitian dan waktu lebih, terutama dalam penyesuaian format penulisan. Hal ini menyebabkan diperlukannya software untuk menyisipkan sitasi. Mendeley dan EndNote adalah software yang dapat dipakai untuk menyisipkan sitasi dalam penulisan ilmiah. Permasalahannya banyak pengguna yang belum paham akan penggunaan kedua jenis software ini. Oleh karena itu, kegiatan pengabdian ini bertujuan untuk mengenalkan penggunaan Mendeley dan EndNote dalam menyisipkan sitasi. Kegiatan ini dilakukan secara daring menggunakan platform Zoom Meeting, dengan jumlah peserta 225 orang tersebar dari seluruh Indonesia. Hasil post-test menunjukkan terdapat peningkatan pemahaman sebesar 70% dari semua peserta dalam menerapkan penggunaan software Mendeley dan EndNote. Kegiatan ini sangat bermanfaat jika dilaksanakan secara lebih intensif kepada pelaku akademik.
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.
Two-dimensional Multiple Stock Size Cutting Stock Problem (MSS2DCSP) is an optimization problem in determining the optimal cutting pattern of materials with length and width variables. The optimal cutting pattern is needed to minimize the number of materials used. This research implemented the pattern generation algorithm to generate Gilmore and Gomory models on every variation of material size. The first stage generated the pattern based on the length, followed by a pattern generated based on the width on the next stage. Then, Gilmore and Gomory models were generated according to the size of the material, where the Gilmore and Gomory model constraints ensured that strips cut in the first stage cutting were used in the second stage cutting and met all product requirements. The Branch and Bound method were used to determine the minimum size of the material sheets needed.
Capacitated Vehicle Routing Problem (CVRP) is a problem that discusses how to choose several routes that must be passed by a number of transport vehicles in the process of distributing goods that combine customer demand with regard to transport capacity. CVRP designs an optimal delivery route where each vehicle only takes one route, each vehicle has the same characteristics, each customer has a request and there is only one depot. In this paper, two CVRP models were formulated. Formulation of the first CVRP model without regard to vehicle loads and vehicles returned to the depot. The second CVRP model formulation takes into account the vehicle load and the vehicle does not return to the depot. Determination of LPG gas distribution routes is completed using the Branch and Cut method.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.