Multiple depot vehicle routing problems on clustering algorithms

© 2018 by the Mathematical Association of Thailand. All rights reserved. This work addresses the clustering problem with two types of clients via the multiple depot vehicle routing problem (MDVRP). The objective function is to minimize the total distance traveled in the system. Two algorithms are pr...

全面介紹

Saved in:
書目詳細資料
Main Authors: Kanokon Leungsubthawee, Supalin Saranwong, Chulin Likasiri
格式: 雜誌
出版: 2018
主題:
在線閱讀:https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85045005472&origin=inward
http://cmuir.cmu.ac.th/jspui/handle/6653943832/58836
標簽: 添加標簽
沒有標簽, 成為第一個標記此記錄!