Simulated annealing algorithm for solving the capacitated vehicle routing problem: a case study of pharmaceutical distribution

This study aims to find a set of vehicles routes with the minimum total transportation time for pharmaceutical distribution at PT. XYZ in West Jakarta. The problem is modeled as the capacitated vehicle routing problem (CVRP). The CVRP is known as an NP-Hard problem. Therefore, a simulated annealing...

Description complète

Enregistré dans:
Détails bibliographiques
Auteurs principaux: Anak Agung Ngurah Perwira Redi, Fiki Rohmatul Maula, Fairuz Kumari, Natasha Utami Syaveyenda, Nanda Ruswandi, Annisa Uswatun Khasanah, Adji Chandra Kurniawan
Format: Artigo
Langue:Indonésio
Publié: Universitas Serang Raya 2020-07-01
Collection:Jurnal Sistem dan Manajemen Industri
Sujets:
vrp
nearest neighbour
simulated annealing
heuristic method
Accès en ligne:https://e-jurnal.lppmunsera.org/index.php/JSMI/article/view/2215
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires