In this study, we consider a tactical problem where a time slot combination for delivery service over a given planning horizon must be selected in each zone of a geographical area. Based on the selected time slot combinations, routes are then constructed for the fleet of delivery vehicles for each period of the planning horizon. The routing plan serves as a blueprint for the following operation...

For this paper, we explored the implementation of the cuckoo search algorithm applied to the capacitated vehicle routing problem. The cuckoo search algorithm was implemented with Lévy flights with the 2-opt and double-bridge operations, and with 500 iterations for each run. The algorithm was tested on the problem instances from the Augerat benchmark dataset. The algorithm did not perform well o...

In this paper, a new algorithm for solving the single loop routing problem is presented. The purpose of the single loop routing problem(SLRP) is to find the shortest loop for an automated guided vehicle covering at least one edge of each department of a block layout. First it shown that this problem can be represented as a graph model. Then a meta-heuristic algorithm based on and colony system ...