Analisis Robust Counterpart Open Capacitated Vehicle Routing Problem dalam Meningkatkan Penguasaan Topik Riset Optimasi dalam Masalah Pengangkutan Sampah bagi Mahasiswa di Palembang

نویسندگان

چکیده

Optimasi merupakan salah satu kajian dalam terapan Matematika yang bertujuan untuk mengoptimalkan suatu keadaan. Salah masalah dapat diaplikasikan optimasi adalah rute. Masalah nyata diterapkan kehidupan sehari-hari permasalahan rute pengangkutan sampah. Pada sampah digunakan konsep Vehicle Routing Problem (VRP). Konsep menggunakan VRP cukup populer di kalangan mahasiswa, namun sendiri tidak terlalu dibahas secara mendalam perkuliahan. Oleh karena itu kegiatan ini memberikan pemahaman mahasiswa

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Robust Capacitated Vehicle Routing Problem Under Demand Uncertainty

We study the robust capacitated vehicle routing problem (CVRP) under demand uncertainty, which determines a minimum cost delivery of a product to geographically dispersed customers using capacity-constrained vehicles. Contrary to the deterministic CVRP, which postulates that the customer demands for the product are deterministic and known, the robust CVRP models the customer demands as random v...

متن کامل

A novel heuristic algorithm for capacitated vehicle routing problem

The vehicle routing problem with the capacity constraints was considered in this paper. It is quite difficult to achieve an optimal solution with traditional optimization methods by reason of the high computational complexity for large-scale problems. Consequently, new heuristic or metaheuristic approaches have been developed to solve this problem. In this paper, we constructed a new heuristic ...

متن کامل

On the capacitated vehicle routing problem

We consider the Vehicle Routing Problem, in which a fixed fleet of delivery vehicles of uniform capacity must service known customer demands for a single commodity from a common depot at minimum transit cost. This difficult combinatorial problem contains both the Bin Packing Problem and the Traveling Salesman Problem (TSP) as special cases and conceptually lies at the intersection of these two ...

متن کامل

The pyramidal capacitated vehicle routing problem

This paper introduces the Pyramidal Capacitated Vehicle Routing Problem (PCVRP) as a restricted version of the Capacitated Vehicle Routing Problem (CVRP). In the PCVRP each route is required to be pyramidal in a sense generalized from the Pyramidal Traveling Salesman Problem (PTSP). A pyramidal route is defined as a route on which the vehicle first visits customers in increasing order of custom...

متن کامل

The Quadratic Capacitated Vehicle Routing Problem

In this article we introduce the Quadratic Capacitated Vehicle Routing Problem (QCVRP), a combinatorial optimization problem that arises in practical applications in logistics and transportation. The QCVRP extends two other known problems, the Capacitated Vehicle Routing Problem (CVRP) and the Quadratic Symmetric Traveling Salesman Problem (QSTSP), the former by considering a modified cost matr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Jurnal Pengabdian Masyarakat Sains Indonesia

سال: 2021

ISSN: ['2715-2537', '2715-2545']

DOI: https://doi.org/10.29303/jpmsi.v3i2.145