Comparison of Metaheuristic Techniques for Parcel Delivery Problem: Malaysian Case Study

Most people preferred e-commerce ensuing the Coronavirus Disease-2019 (COVID-19) outbreak, resulting in delivery companies receiving large quantities of parcels to be delivered to clients. Hurdle emerges when delivery person needs to convey items to a large number of households in a single journey as they never face this situation before. As a result, they seek the quickest way during the trip to reduce delivery costs and time. Since the delivery challenge has been classified as an NP-hard (non-deterministic polynomial-time hard)) problem, this study aims to search the shortest distance, including the runtime for the real case study located in Melaka, Malaysia. Hence, two metaheuristic approaches are compared in this study namely, Ant-Colony Optimization (ACO) and Genetic Algorithm (GA). The results show that the GA strategy outperforms the ACO technique in terms of distance, price, and runtime for moderate data sizes that is less than 90 locations.

@article{Moganathan2022,
  title     = {Comparison of Metaheuristic Techniques for Parcel Delivery Problem: Malaysian Case Study},
  journal   = {International Journal of Advanced Computer Science and Applications},
  volume    = {13},
  number    = {10},
  year      = {2022},
  publisher = {The Science and Information Organization},
  author    = {Shamine A/P S. Moganathan and Siti Noor Asyikin binti Mohd Razali and Aida Mustapha and Safra Liyana binti Sukiman and Rosshairy Abd Rahman and Muhammad Ammar Shafi},
  doi       = {10.14569/IJACSA.2022.0131033},
  url       = {https://doi.org/10.14569/IJACSA.2022.0131033}
}