生产与分配联合问题的双阶段方法

Nejah Ben Mabrouk, B. Jarboui, M. Eddaly, H. Chabchoub
{"title":"生产与分配联合问题的双阶段方法","authors":"Nejah Ben Mabrouk, B. Jarboui, M. Eddaly, H. Chabchoub","doi":"10.1109/LOGISTIQUA.2011.5939429","DOIUrl":null,"url":null,"abstract":"In this paper, we are interested to the problem of the production distribution planning in supply chain management while minimizing three costs simultaneously such as production setups, inventories and distribution. The complexity of this problem is known to be NP-hard. In order to solve this problem, we propose a bi-phase Variable Neighbourhood Search algorithm (VNS). The computational experiments, according to the instances of the literature, have shown the effectiveness of our proposed algorithm against the existing approaches.","PeriodicalId":324478,"journal":{"name":"2011 4th International Conference on Logistics","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A bi-phase approach for the combined production and distribution problem\",\"authors\":\"Nejah Ben Mabrouk, B. Jarboui, M. Eddaly, H. Chabchoub\",\"doi\":\"10.1109/LOGISTIQUA.2011.5939429\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we are interested to the problem of the production distribution planning in supply chain management while minimizing three costs simultaneously such as production setups, inventories and distribution. The complexity of this problem is known to be NP-hard. In order to solve this problem, we propose a bi-phase Variable Neighbourhood Search algorithm (VNS). The computational experiments, according to the instances of the literature, have shown the effectiveness of our proposed algorithm against the existing approaches.\",\"PeriodicalId\":324478,\"journal\":{\"name\":\"2011 4th International Conference on Logistics\",\"volume\":\"2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-07-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 4th International Conference on Logistics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/LOGISTIQUA.2011.5939429\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 4th International Conference on Logistics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LOGISTIQUA.2011.5939429","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本文主要研究供应链管理中的生产分配计划问题,同时使生产设置、库存和配送三种成本最小化。这个问题的复杂性被称为np困难。为了解决这一问题,我们提出了一种双相可变邻域搜索算法(VNS)。计算实验,根据文献的实例,表明了我们所提出的算法相对于现有方法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A bi-phase approach for the combined production and distribution problem
In this paper, we are interested to the problem of the production distribution planning in supply chain management while minimizing three costs simultaneously such as production setups, inventories and distribution. The complexity of this problem is known to be NP-hard. In order to solve this problem, we propose a bi-phase Variable Neighbourhood Search algorithm (VNS). The computational experiments, according to the instances of the literature, have shown the effectiveness of our proposed algorithm against the existing approaches.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信