Rancangan Model Alokasi Pengiriman Produk Karton Bergelombang dengan Mempertimbangkan Heterogeneous Fleet, Multi Product dan Clustering

Abstract

Optimal shipping allocation planning is an essential element in increasingly complex and dynamic supply chain management. Shipping route optimization can provide competitive advantage by minimizing operational costs through freight utilization and increasing customer satisfaction. This study proposes a shipping allocation model designed to solve the Capacitated Vehicle Routing Problem (CVRP) using Genetic Algorithm (GA) implemented in the Multi Objective Evolutionary Algorithm (MOEA) Framework. This model aims to solve the CVRP by considering heterogeneous fleet, product variability and different delivery destinations. The chromosome representation in the model describes the order of customer visits by the available fleet, while the fitness function is used to minimize the total distance traveled in order to maximize the efficiency of vehicle capacity utilization. The results show that this model is able to increase delivery efficiency, with load utilization of 99% with all requests allocated