.png){kind=icon}
返回
The bi-objective periodic closed loop network design problem
.png){kind=icon}
OA
AI
DOI：10.1016/j.eswa.2019.113068.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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. (C) 2019 Elsevier Ltd. All rights reserved.
Keyword:
Network design
Closed loop supply chain
Periodic location-routing problem
Simultaneous pickup and delivery
Time window
Bi-objective
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.5
论文数:
3.0W
被引数:
10.2W
机构
引用论文
A bi-objective hybrid optimization algorithm to reduce noise and data dimension in diabetes diagnosis using support vector machines基于支持向量机的糖尿病诊断中降低噪声和数据维数的双目标混合优化算法
PREAI
分享收藏Location-Routing Problem with Simultaneous Home Delivery and Customer's Pickup for City Distribution of Online Shopping Purchases在线购物的城市分销中同时送货上门和客户提货的位置路径问题.png)
SUSTAINABILITYOAAI
SUSTAINABILITYIF3.3
OAAI分享收藏A unified-adaptive large neighborhood search metaheuristic for periodic location-routing problems
PREAI
分享收藏
查看更多内容