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...

Полное описание

Сохранить в:
Библиографические подробности
Главные авторы: Anak Agung Ngurah Perwira Redi, Fiki Rohmatul Maula, Fairuz Kumari, Natasha Utami Syaveyenda, Nanda Ruswandi, Annisa Uswatun Khasanah, Adji Chandra Kurniawan
Формат: Artigo
Язык:Indonésio
Опубликовано: Universitas Serang Raya 2020-07-01
Серии:Jurnal Sistem dan Manajemen Industri
Предметы:
vrp
nearest neighbour
simulated annealing
heuristic method
Online-ссылка:https://e-jurnal.lppmunsera.org/index.php/JSMI/article/view/2215
Метки: Добавить метку
Нет меток, Требуется 1-ая метка записи!

Схожие документы