.png){kind=icon}
返回
Classification, models and exact algorithms for multi-compartment delivery problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2014.10.059.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The distribution of products using compartmentalized vehicles involves many decisions such as the allocation of products to vehicle compartments, vehicle routing and inventory control. These decisions often span several periods, yielding a difficult optimization problem. In this paper we define and compare four main categories of the Multi-Compartment Delivery Problem (MCDP). We propose two mixed-integer linear programming formulations for each case, as well as specialized models for particular versions of the problem. Known and new valid inequalities are introduced in all models. We then describe a branch-and-cut algorithm applicable to all variants of the MCDP. We have performed extensive computational experiments on single-period and multi-period cases of the problem. The largest instances that could be solved exactly for these two cases contain 50 and 20 customers, respectively. (C) 2014 Elsevier B.V. All rights reserved.
Keyword:
Multi-compartment delivery
Vehicle-routing
Inventory-routing
Multi-products
Multi-vehicles
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
A BRANCH-AND-CUT ALGORITHM FOR THE RESOLUTION OF LARGE-SCALE SYMMETRICAL TRAVELING SALESMAN PROBLEMS.png)
SIAM REVIEW
SIAM REVIEWIF6.1
PREAI
分享收藏A tabu search heuristic for the undirected selective travelling salesman problem无向选择性旅行商问题的禁忌搜索启发式
PREAI
分享收藏
查看更多内容