International Conference on Artificial Intelligence and Data Processing (IDAP), Malatya, Türkiye, 28 - 30 Eylül 2018
Since vehicle routing problem was first expressed in mathematical terms in late 1950s, it has found ways of application for many daily problems in different disciplines (waste collection, product transportation from warehouses to supermarkets, school buses etc.) as well as being one of the most academically researched subjects. Apart from small scale problems, vehicle routing problem becomes np-hard combinatorial optimization problem especially when trying to solve real daily life problems. Therefore, although heuristic algorithms do not guarantee optimum results, they are used quite often in vehicle routing problems.