Solving Multi-Pickup and Delivery Problem with Time Windows using Ant Colony Optimization
Keywords:
Ant Colony Optimization, Multi-pickup and Delivery Problems, Time Windows, Smooth Max-Min Ant System algorithm, NP-hard Problem, CPLEX OptimizerAbstract
This paper presents a meta-heuristic approach for the NP-hard multi-pickup and delivery problem with time windows based on Ant Colony Optimization (ACO) algorithm. ACO is an algorithm that mimics the behaviour of ant colonies in efficiently finding the shortest path from the nest to a food source. The Smooth Max-Min Ant System algorithm is used as
a rule to update pheromone in the ACO algorithm. Visual Studio 2019 is used as the program software. The test instances of 24 types are used in computational experiments. The experiments have been tested with 100, 200, 500, 1000, 2000, and 3000 iterations. The results are then compared with those generated by the CPLEX optimizer. Among three window types, the instances belonging to Normal Time Windows produced the best results. For the same node cases, the instances with long requests were solved faster than those with short requests due to having fewer requests that needed to work with than the latter. The results were assessed via a comparison with the Adaptive Large Neighborhood Search, CPLEX, in which the ACO algorithm performed well in most instances. Since mathematical programming could not handle instances with 400 nodes, it could be said that the problem is complicated and complex. This demonstrated the NP-hard characteristics of the multi-pickup and delivery problem with the time windows problem.
Downloads
Published
How to Cite
Issue
Section
License
TRANSFER OF COPYRIGHT AGREEMENT
The manuscript is herewith submitted for publication in the Journal of Telecommunication, Electronic and Computer Engineering (JTEC). It has not been published before, and it is not under consideration for publication in any other journals. It contains no material that is scandalous, obscene, libelous or otherwise contrary to law. When the manuscript is accepted for publication, I, as the author, hereby agree to transfer to JTEC, all rights including those pertaining to electronic forms and transmissions, under existing copyright laws, except for the following, which the author(s) specifically retain(s):
- All proprietary right other than copyright, such as patent rights
- The right to make further copies of all or part of the published article for my use in classroom teaching
- The right to reuse all or part of this manuscript in a compilation of my own works or in a textbook of which I am the author; and
- The right to make copies of the published work for internal distribution within the institution that employs me
I agree that copies made under these circumstances will continue to carry the copyright notice that appears in the original published work. I agree to inform my co-authors, if any, of the above terms. I certify that I have obtained written permission for the use of text, tables, and/or illustrations from any copyrighted source(s), and I agree to supply such written permission(s) to JTEC upon request.