Algoritme Sweep dan Particle Swarm Optimization dalam Optimisasi Rute Kendaraan dengan Kapasitas

Silalahi, Bib Paruhum; Fatihin, Khoerul; Supriyo, Prapto Tri; Guritman, Sugi

doi:10.24198/jmi.v16.n1.27474.29-40

Cited by 2 publications

(2 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Masalah terakhir yang sama diselesaikan oleh Erdelic & Caric [4] menggunakan metode metaheuristik ALNS (adaptive large neighborhood search). Sementara itu, Silalahi et al [15] menggunakan algoritme sweep dan particle swarm optimization untuk menyelesaikan capacitated VRP.…”

Section: Metode Penelitianunclassified

Masalah Antar-Jemput Barang Menggunakan Armada Kendaraan Listrik dengan Kapasitas Angkut dan Kapasitas Baterai Berbeda

Nurlailawati,

Bakhtiar,

Supriyo

2023

jmi

View full text Add to dashboard Cite

Urgensi Electric Vehicle Routing Problems (EVRP) terletak pada kebutuhan untuk mengoptimalkan rute kendaraan listrik guna mengurangi emisi karbon dan dampak lingkungan. Tantangan EVRP meliputi kompleksitas perhitungan rute dengan mempertimbangkan batasan daya baterai dan infrastruktur pengisian daya yang terbatas. Di artikel ini diformulasikan masalah perutean kendaraan listrik dengan permintaan antar-jemput barang dalam bentuk pemrograman linear bilangan bulat. Model yang diajukan memiliki fitur penggunaan armada kendaraan dengan kapasitas angkut dan kapasitas baterai heterogen. Implementasi model meliputi penyelesaian masalah antar-jemput barang menggunakan armada kendaraan listrik homogen dan heterogen dengan depot, pelanggan, kendaraan listrik, dan stasiun pengisian kendaraan listrik umum. Metode eksak digunakan dalam pencarian solusi optimum dengan bantuan Lingo 17.0.

show abstract

Section: Metode Penelitianunclassified

Masalah Antar-Jemput Barang Menggunakan Armada Kendaraan Listrik dengan Kapasitas Angkut dan Kapasitas Baterai Berbeda

Nurlailawati,

Bakhtiar,

Supriyo

2023

jmi

View full text Add to dashboard Cite

show abstract

“…Te knapsack problem, DNA fragment assembly problem, feature selection, task scheduling, and the travel salesman problem are all examples of combinatorial optimization problems; parameter estimation of photovoltaic models and nonlinear equations systems are continuous optimization problems; recently, metaheuristic algorithms and neural networks algorithms, either single-based or population-based, have strongly interacted to solve these problems [21][22][23][24][25][26][27][28]. Some of those recent algorithms used to solve the KP problem are presented in Table 1.…”

Section: Related Workmentioning

confidence: 99%

Solving the 0/1 Knapsack Problem Using Metaheuristic and Neural Networks for the Virtual Machine Placement Process in Cloud Computing Environment

Abid

Kafhali

Amzil

et al. 2023

Mathematical Problems in Engineering

View full text Add to dashboard Cite

Virtual machine placement (VMP) is carried out during virtual machine migration to choose the best physical computer to host the virtual machines. It is a crucial task in cloud computing. It directly affects data center performance, resource utilization, and power consumption, and it can help cloud providers save money on data center maintenance. To optimize various characteristics that affect data centers, VMs, and their runs, numerous VMP strategies have been developed in the cloud computing environment. This paper aims to compare the accuracy and efficiency of nine distinct strategies for treating the VMP as a knapsack problem. In the numerical analysis, we test out various conditions to determine how well the system works. We first illustrate the rate of convergence for algorithms, then the rate of execution time growth for a given number of virtual machines, and lastly the rate of development of CPU usage rate supplied by the nine methods throughout the three analyzed conditions. The obtained results reveal that the neural network algorithm performs better than the other eight approaches. The model performed well, as shown by its ability to provide near-optimal solutions to test cases.

show abstract

Algoritme Sweep dan Particle Swarm Optimization dalam Optimisasi Rute Kendaraan dengan Kapasitas

Cited by 2 publications

References 0 publications

Masalah Antar-Jemput Barang Menggunakan Armada Kendaraan Listrik dengan Kapasitas Angkut dan Kapasitas Baterai Berbeda

Masalah Antar-Jemput Barang Menggunakan Armada Kendaraan Listrik dengan Kapasitas Angkut dan Kapasitas Baterai Berbeda

Solving the 0/1 Knapsack Problem Using Metaheuristic and Neural Networks for the Virtual Machine Placement Process in Cloud Computing Environment

Contact Info

Product

Resources

About