dc.contributor.author | Jelodari Mamaghani, Elham | |
dc.contributor.author | Davari, Soheil | |
dc.date.accessioned | 2019-11-02T01:08:45Z | |
dc.date.available | 2019-11-02T01:08:45Z | |
dc.date.issued | 2020-04-15 | |
dc.identifier.citation | Jelodari Mamaghani , E & Davari , S 2020 , ' The Bi-objective Periodic Closed Loop Network Design Problem ' , Expert Systems with Applications , vol. 144 , 113068 . https://doi.org/10.1016/j.eswa.2019.113068 | |
dc.identifier.issn | 0957-4174 | |
dc.identifier.other | ORCID: /0000-0002-0037-6484/work/64327882 | |
dc.identifier.uri | http://hdl.handle.net/2299/21839 | |
dc.description | © 2019 Elsevier Ltd. This manuscript is made available under the terms of the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International licence (CC BY-NC-ND 4.0). For further details please see: https://creativecommons.org/licenses/by-nc-nd/4.0/ | |
dc.description.abstract | Reverse supply chains are becoming a crucial part of retail supply chains given the recent reforms in the consumers’ rights and the regulations by governments. This has motivated companies around the world to adopt zero-landfill goals and move towards circular economy to retain the product’s value during its whole life cycle. However, designing an efficient closed loop supply chain is a challenging undertaking as it presents a set of unique challenges, mainly owing to the need to handle pickups and deliveries at the same time and the necessity to meet the customer requirements within a certain time limit. In this paper, we model this problem as a bi-objective periodic location routing problem with simultaneous pickup and delivery as well as time windows and examine the performance of two procedures, namely NSGA-II and NRGA, to solve it. The goal is to find the best locations for a set of depots, allocation of customers to these depots, allocation of customers to service days and the optimal routes to be taken by a set of homogeneous vehicles to minimise the total cost and to minimise the overall violation from the customers’ defined time limits. Our results show that while there is not a significant difference between the two algorithms in terms of diversity and number of solutions generated, NSGA-II outperforms NRGA when it comes to spacing and runtime. | en |
dc.format.extent | 14 | |
dc.format.extent | 7700058 | |
dc.language.iso | eng | |
dc.relation.ispartof | Expert Systems with Applications | |
dc.subject | Bi-objective | |
dc.subject | Closed loop supply chain | |
dc.subject | Network design | |
dc.subject | Periodic location-routing problem | |
dc.subject | Simultaneous pickup and delivery | |
dc.subject | Time window | |
dc.subject | General Engineering | |
dc.subject | Computer Science Applications | |
dc.subject | Artificial Intelligence | |
dc.title | The Bi-objective Periodic Closed Loop Network Design Problem | en |
dc.contributor.institution | Enterprise and Value Research Group | |
dc.contributor.institution | Hertfordshire Business School | |
dc.description.status | Peer reviewed | |
dc.date.embargoedUntil | 2020-11-01 | |
dc.identifier.url | http://www.scopus.com/inward/record.url?scp=85075118540&partnerID=8YFLogxK | |
rioxxterms.versionofrecord | 10.1016/j.eswa.2019.113068 | |
rioxxterms.type | Journal Article/Review | |
herts.preservation.rarelyaccessed | true | |