全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

Ant colony optimization techniques for the hamiltonian p-median problem

Keywords: combinatorial optimization , Hamiltonian p-Median Problem (HpMP) , Ant Colony Optimization (ACO) , Vehicle Routing Problem (VRP).

Full-Text   Cite this paper   Add to My Lib

Abstract:

Location-Routing problems involve locating a number of facilitiesamong candidate sites and establishing delivery routes to a set of users in such a way that the total system cost is minimized. A special case of these problems is Hamiltonian p-Median problem (HpMP). This research applies the metaheuristic method of ant colony optimization (ACO) to solve the HpMP. Modifications are made to the ACO algorithm used to solve the traditional vehicle routing problem (VRP) in order to allow the search of the optimal solution of the HpMP. Regarding this metaheuristic algorithm a computational experiment is reported as well.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133