Abstract
VRP is a common problem that occurred in logistics, including determination a route of products from the source to the destination. VRPTW is variation of VRP that use routing concepts in the serving process at the certain time interval. Recently, many methods are used to solve this optimization problem, for example ACO. LTKC-ACO was developed to improve the ACO solutions that apply LTKC to obtain a number of classes that are considered as the candidate list in ACO. Local Search is also used to avoid ACO getting stuck in the local optimum. In this study, two types of LTKC-ACO are developed that’s related to time windows parameter usage in clustering. The experimental result of 56 Solomon’s datasets showed that LTKC-ACO can improve the ACO solutions on 73,21% of datasets and can out performed then the other methods, especially on the datasets that have longer scheduling of service time. Full Text: PDF DOI: http://dx.doi.org/10.11591/telkomnika.v16i2.8800
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Indonesian Journal of Electrical Engineering and Computer Science
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
