Please use this identifier to cite or link to this item: http://hdl.handle.net/10419/157748
Authors: 
Behmanesh, Elham
Pannek, Jürgen
Year of Publication: 
2016
Citation: 
[Journal:] Logistics Research [ISSN:] 1865-0368 [Volume:] 9 [Year:] 2016 [Issue:] 1 [Pages:] 1-12
Abstract: 
Logistics network design is a major strategic issue in supply chain management of both forward and reverse flow, which industrial players are forced but not equipped to handle. To avoid sub-optimal solution derived by separated design, we consider an integrated forward reverse logistics network design, which is enriched by using a complete delivery graph. We formulate the cyclic seven-stage logistics network problem as a NP hard mixed integer linear programming model. To find the near optimal solution, we apply a memetic algorithm with a neighborhood search mechanism and a novel chromosome representation including two segments. The power of extended random path-based direct encoding method is shown by a comparison to commercial package in terms of both quality of solution and computational time. We show that the proposed algorithm is able to efficiently find a good solution for the flexible integrated logistics network.
Subjects: 
Memetic algorithm
Closed-loop supply design
Random path
Flexible delivery
Persistent Identifier of the first edition: 
Creative Commons License: 
http://creativecommons.org/licenses/by/4.0/
Document Type: 
Article
Appears in Collections:

Files in This Item:
File
Size





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.