期刊
APPLIED SOFT COMPUTING
卷 66, 期 -, 页码 311-318出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/j.asoc.2018.02.032
关键词
Routing; Production planning; Guided variable neighborhood descent; Skewed general variable neighborhood search
资金
- NSFC [71571092]
- Jiangsu Overseas Research & Training Program for University Prominent Young & Middle-aged Teachers and Presidents
- General Research Project for Humanities and Social Sciences from Chinese Ministry of Education [11YJCZH137]
- Priority Academic Program Development of Jiangsu Higher Education Institutions(PAPD)
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据