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

7Citations
Citations of this article
28Readers
Mendeley users who have this article in their library.

Abstract

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.

Cite

CITATION STYLE

APA

Yuliza, E., Puspita, F. M., & Supadi, S. S. (2020). The robust counterpart open capacitated vehicle routing problem with time windows on waste transport problems. Bulletin of Electrical Engineering and Informatics, 9(5), 2074–2081. https://doi.org/10.11591/eei.v9i5.2439

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free