Proceeding_The robust counterpart open capacitated vehicle routing problem with time windows

Puspita, Fitri Maya (2020) Proceeding_The robust counterpart open capacitated vehicle routing problem with time windows. In: 5th Seminar Nasional Matematika dan Pendidikan Matematika (SENATIK) 2020, Semarang.

Text 6.JPCS the robust counterpart yuliza2020 lengkap.pdf Download (1MB)

Abstract

The problem of transporting waste vehicle routes is one of the problems faced in big cities. Delay becomes a problem in the process of transporting waste. The route of garbage vehicles motivated this research. Thus, the optimization of vehicle routes is needed to minimize the distance and travel time. We investigated two robust optimization models, which are limited by vehicle capacity and time windows. Robust counterpart open capacitated vehicle routing problems with soft time windows is the first model. This model results in the arrival time of the vehicle on each TDS and FDS that may exceed the working hours. The second model is robust counterpart open capacitated vehicle routing problems with hard time windows. This model results in the arrival time of the vehicle on each TDS and FDS not to exceed the working hours. The two robust optimization models are solved using the exact approach and the heuristic approach. Complete the exact approach using the branch and bound method with LINGO software. Completion of the heuristic approach uses the Nearest Neighbour method. The two models that are solved by the branch and bound method and the Nearest Neighbour algorithm produce the optimal solution, obtained different sub tours.

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:	11 May 2023 15:10
URI:	http://repository.unsri.ac.id/id/eprint/102115

Actions (login required)

View Item