Heuristic Approaches for Minimum Weighted Latency Problem
- 10.2991/icmmita-16.2016.102How to use a DOI?
- Minimum weighted latency problem; Heuristic algorithm; Ant colony optimization.
This paper addresses the MWLP (Minimum Weighted Latency Problem). The problem has previously been proven NP-hard, which makes finding the exact solution impractical when the graph's scale is large. This paper explores the feasibility of using heuristics to solve MWLP. Five classic heuristic algorithms are tested in different situations. Different heuristics' effectiveness and efficiency are compared and analyzed.
- © 2017, the Authors. Published by Atlantis Press.
- Open Access
- This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).
Cite this article
TY - CONF AU - Ziqi Wei AU - H.MacGregor Mike PY - 2017/01 DA - 2017/01 TI - Heuristic Approaches for Minimum Weighted Latency Problem BT - Proceedings of the 2016 4th International Conference on Machinery, Materials and Information Technology Applications PB - Atlantis Press SP - 552 EP - 556 SN - 2352-538X UR - https://doi.org/10.2991/icmmita-16.2016.102 DO - 10.2991/icmmita-16.2016.102 ID - Wei2017/01 ER -