.png){kind=icon}
返回
A variable neighborhood search heuristic algorithm for production routing problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.asoc.2018.02.032.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In a production routing problem (PRP), the aim is to integrate planning of production, inventory, delivery schedules and vehicle routes in supply chains. In this work, we present a variable neighborhood search metaheuristic for the PRP. In the metaheuristic, variables of delivery and routing decisions are handled by local search based on skewed general variable neighborhood search and guided variable neighborhood descent, respectively. Binary variables for production setups and continuous variables for production quantities and the depot inventory are determined in a production-inventory subproblem with a mixed integer programming solver. The computational results show that the proposed heuristic is competitive with the state-of-the-art algorithms on the benchmark instances. Furthermore, the proposed heuristic outperforms existing heuristics on the standard and high transportation cost benchmark instances in Archetti et al. [1] and large size benchmark instances in Boudia et al. [2] within comparable computing times. (C) 2018 Elsevier B.V. All rights reserved.
Keyword:
Routing
Production planning
Guided variable neighborhood descent
Skewed general variable neighborhood search
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.6
论文数:
1.4W
被引数:
4.8W
机构
引用论文
Investigation of morphologies and characterization of rare earth metal samarium hexacyanoferrate and its composite with surfactant intercalated graphene oxide for sensor applications.png)
RSC Adv.
RSC Adv.IF0
PREAI
分享收藏分享收藏Drug therapy for alcohol dependence in primary care in the UK: A Clinical Practice Research Datalink studyPLOS ONE
OAAI
PLOS ONEIF0
OAAI分享收藏
查看更多内容