### 摘要

To model the distillation or decomposition of products in some manufacturing processes, a minimum distribution cost problem (MDCP) on a specialized manufacturing network flow model has been investigated. In a MDCP, a specialized node called D-node is used to model a distillation process which only connects with a single incoming arc and several outgoing arcs. The flows entering a D-node have to be distributed according to a pre-specified ratio associated with each of its outgoing arc. Such a proportional relationship between the arc flows associated with each D-node complicates the problem and makes the MDCP harder than conventional min-cost network flow problem. A network simplex algorithm for uncapacitated MDCP has been outlined in literature, but its detailed graphical procedures such as initial basic feasible solution computation, dual variables updates, and flow pivoting operations have not yet been given. In this paper, we resolve these issues and propose a modified network simplex algorithm including detailed graphical operations in each elementary procedure. Our method can not only deal with capacitated MDCP, but also offer more theoretical insights in the basis and properties of MDCP.

原文 | English |
---|---|

頁面 | 92-103 |

頁數 | 12 |

出版狀態 | Published - 2006 十二月 1 |

事件 | 36th International Conference on Computers and Industrial Engineering, ICC and IE 2006 - Taipei, Taiwan 持續時間: 2006 六月 20 → 2006 六月 23 |

### Other

Other | 36th International Conference on Computers and Industrial Engineering, ICC and IE 2006 |
---|---|

國家 | Taiwan |

城市 | Taipei |

期間 | 06-06-20 → 06-06-23 |

### All Science Journal Classification (ASJC) codes

- Industrial and Manufacturing Engineering

## 指紋 深入研究「A modified network simplex algorithm for solving the minimum distribution cost problem」主題。共同形成了獨特的指紋。

## 引用此

*A modified network simplex algorithm for solving the minimum distribution cost problem*. 92-103. 論文發表於 36th International Conference on Computers and Industrial Engineering, ICC and IE 2006, Taipei, Taiwan.