Abstract: The Travelling Salesman Problem (TSP) is a well known method for the optimisation problem that asks you to find the shortest route that visits each city in a set exactly once and then goes ...

Identified and explained in detail the gaps and possible future works for improvement in two popular research papers that used heuristic and meta-heuristic algorithms to solve multi-objective vehicle ...

ABSTRACT: This study presents a two-echelon inventory routing problem (2E-IRP) with an end-of-tour replenishment (ETR) policy whose distribution network consists of a supplier, several distribution ...

This project aimed to implement three well-known meta-heuristic algorithms: cuckoo search (CS), bat algorithm (BA), and flower pollination algorithm (FPA). We found that three algorithms could have a ...