Proceeding_Solving capacitated vehicle routing problem using of Clarke and Wright algorithm and LINGO in LPG distribution

Puspita, Fitri Maya (2020) Proceeding_Solving capacitated vehicle routing problem using of Clarke and Wright algorithm and LINGO in LPG distribution. In: 5th Seminar Nasional Matematika dan Pendidikan Matematika (SENATIK) 2020, Semarang.

Text 7.JPCS solving capacitated vehicle yuliza2020 lengkap.pdf Download (1MB)

Abstract

Capacitated vehicle routing problem is a vehicle routing problem that has constraints in the form of vehicle capacity. It is a matter of optimization to find the optimal route for some vehicles with a specific capacity and homogeneous vehicles that serve some agents with several known requests before the distribution process takes place. LPG distribution is the application of capacitated vehicle routing problems. This research aims to determine the LPG distribution route based on the Clarke and Wright Algorithm and LINGO. The capacitated vehicle routing problem model will be solved in two phases. The first stage completes the capacitated vehicle routing problem model using the Clarke and Wright algorithm. The second stage is completing the results of the first stage in the form of LINGO-based sub tours to obtain the optimal solution. The solution of the capacitated vehicle routing problem in distribution LPG using the Clarke and Wright algorithm has a total distance of 151.94 km. The solution of the capacitated vehicle routing problem in distribution LPG using LINGO has a total distance of 161.59 km.

Item Type:	Conference or Workshop Item (Paper)
Subjects:	#3 Repository of Lecturer Academic Credit Systems (TPAK) > Conference or Workshop
Divisions:	08-Faculty of Mathematics and Natural Science > 44201-Mathematics (S1)
Depositing User:	Mrs Fitri Maya Puspita
Date Deposited:	11 May 2023 15:10
Last Modified:	01 Jul 2024 13:42
URI:	http://repository.unsri.ac.id/id/eprint/102114

Actions (login required)

View Item