Hybrid harmony search-simulated annealing algorithm for location-inventory-routing problem in supply chain network design with defect and non-defect items

• Main Authors: Farahanim, Misni, Lee, Lai Soon, Seow, Hsin-Vonn
• Format: Article
• Language: English
• Published: MDPI 2020
• Subjects: QA Mathematics
• Online Access: http://umpir.ump.edu.my/id/eprint/30003/1/Hybrid%20harmony%20search-simulated%20annealing%20algorithm%20for%20location.pdf; http://umpir.ump.edu.my/id/eprint/30003/; https://doi.org/10.3390/app10186625; https://doi.org/10.3390/app10186625

This paper considers a location-inventory-routing problem (LIRP) that integrates the strategic, tactical, and operational decision planning in supply chain network design. Both defect and non-defect items of returned products are considered in the cost of reverse logistics based on the economic production quantity model. The objective of the LIRP is to minimize the total cost of location-allocation of established depots, the cost of inventory, including production setup and holding cost, as well as the cost of travelled distance by the vehicles between the open depots and assigned customers. A Hybrid Harmony Search-Simulated Annealing (HS-SA) algorithm is proposed in this paper. This algorithm incorporates the dynamic values of harmony memory considering rate and pitch adjustment rate with the local optimization techniques to hybridize with the idea of probabilistic acceptance rule from simulated annealing, to avoid the local extreme points. Computational experiments on popular benchmark data sets show that the proposed hybrid HS-SA algorithm outperforms a standard HS and an improved HS for all cases.