.png){kind=icon}
.png){kind=icon}
Return
A branch-and-cut algorithm for an assembly routing problem
.png){kind=icon}
OA
AI
DOI：10.1016/j.ejor.2019.10.007.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We consider an integrated planning problem that combines production, inventory and inbound transportation decisions in a context where several suppliers each provide a subset of the components necessary for the production of a final product at a central plant. We provide a mixed integer programming formulation of the problem and propose several families of valid inequalities to strengthen the linear programming relaxation. We propose two new algorithms to separate the subtour elimination constraints for fractional solutions. The inequalities and separation procedures are used in a branch-and-cut algorithm. Computational experiments on a large set of generated test instances show that both the valid inequalities and the new separation procedures significantly improve the performance of the branch-and-cut algorithm. (C) 2019 Elsevier B.V. All rights reserved.
Keywords:
Logistics
Assembly routing problem
Valid inequalities
Subtour elimination constraints separation
Branch-and-cut
Integrated production and routing
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W