A hybrid spanning tree-based genetic/simulated annealing algorithm for a closed-loop logistics network design problem Online publication date: Mon, 08-Feb-2016
by Ehsan Yadegari; Mostafa Zandieh; Hesamaddin Najmi
International Journal of Applied Decision Sciences (IJADS), Vol. 8, No. 4, 2015
Abstract: Affecting the efficiency and responsiveness of the logistics, supply chain network design, in particular, closed-loop logistics has attracted more attention in recent years. The problem in this paper is to minimise the total cost of the cyclic logistic network model by determining the best locations of plants, distribution centres (DCs), and dismantlers. Due to the NP-hard nature of the problem, it is inevitable to appeal to metaheuristic procedures to achieve satisfactory solutions for large-size problems. To tackle such an NP-hard problem, this paper proposes a simulated annealing (SA), a modified genetic algorithm (MGA), and a hybrid algorithm, applying these two algorithms based on a revised spanning tree and determinant encoding representation. To evaluate the proposed algorithms, we compare them with the genetic algorithm (GA) taken from the recent literature. Finally, it is shown that the proposed hybrid algorithm outperforms other algorithms.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Applied Decision Sciences (IJADS):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook