Please use this identifier to cite or link to this item:
https://doi.org/10.1016/j.cor.2009.09.018
Title: | A memetic algorithm for bi-objective integrated forward/reverse logistics network design | Authors: | Pishvaee, M.S. Farahani, R.Z. Dullaert, W. |
Keywords: | Closed loop supply chain network Integrated logistics network Memetic algorithm Multi-objective optimization |
Issue Date: | Jun-2010 | Citation: | Pishvaee, M.S., Farahani, R.Z., Dullaert, W. (2010-06). A memetic algorithm for bi-objective integrated forward/reverse logistics network design. Computers and Operations Research 37 (6) : 1100-1112. ScholarBank@NUS Repository. https://doi.org/10.1016/j.cor.2009.09.018 | Abstract: | Logistics network design is a major strategic issue due to its impact on the efficiency and responsiveness of the supply chain. This paper proposes a model for integrated logistics network design to avoid the sub-optimality caused by a separate, sequential design of forward and reverse logistics networks. First, a bi-objective mixed integer programming formulation is developed to minimize the total costs and maximize the responsiveness of a logistics network. To find the set of non-dominated solutions, an efficient multi-objective memetic algorithm is developed. The proposed solution algorithm uses a new dynamic search strategy by employing three different local searches. To assess the quality of the novel solution approach, the quality of its Pareto-optimal solutions is compared to those generated by an existing powerful multi-objective genetic algorithm from the recent literature and to exact solutions obtained by a commercial solver. © 2009 Elsevier Ltd. All rights reserved. | Source Title: | Computers and Operations Research | URI: | http://scholarbank.nus.edu.sg/handle/10635/114979 | ISSN: | 03050548 | DOI: | 10.1016/j.cor.2009.09.018 |
Appears in Collections: | Staff Publications |
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.