Martino, Giada, Yuce, Baris ORCID: https://orcid.org/0000-0002-9937-1535, Iannone, Raffaele and Packianather, Michael Sylvester ORCID: https://orcid.org/0000-0002-9436-8206 2016. Optimisation of the replenishment problem in the fashion retail industry using Tabu-Bees algorithm. IFAC-PapersOnLine 49 (12) , pp. 1685-1690. 10.1016/j.ifacol.2016.07.823 |
Abstract
The problem of properly allocating several different products in the stores network is one of the crucial processes in the Retail Industry. This means trying to meet market demand and at the same time reducing logistics costs. In this context, main aims of the presented work are to (a) otpimise the replenishment process for the retailer’s network of companies with multi-product multi-store configuration and (b) propose a new algorithm which combines the Basic Bees algorithm, a swarm based optimization technique, with the Tabu-Search principles. Attention is focused on the particular case of lost sales and budget constraints for a fashion company. Simulation results show that the use of the Tabu-Bees algorithm can guarantee an average 10% improvement in results allowing the model to overcome local minima.
Item Type: | Article |
---|---|
Date Type: | Publication |
Status: | Published |
Schools: | Engineering |
Publisher: | Elsevier |
ISSN: | 2405-8963 |
Last Modified: | 19 Nov 2023 15:54 |
URI: | https://orca.cardiff.ac.uk/id/eprint/98277 |
Citation Data
Cited 16 times in Scopus. View in Scopus. Powered By Scopus® Data
Actions (repository staff only)
Edit Item |