Product distribution via a bi-level programming approach: Algorithms and a case study in municipal waste system
© 2015 Elsevier Ltd. All rights reserved. The design of distribution network influences the performance of supply chain systems. A well-designed distribution network can help a supply chain system to achieve maximum profits or minimize total cost. In this work, algorithms are designed to allocate cu...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Journal |
| Published: |
2018
|
| Subjects: | |
| Online Access: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84944080878&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/55540 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Chiang Mai University |
| Summary: | © 2015 Elsevier Ltd. All rights reserved. The design of distribution network influences the performance of supply chain systems. A well-designed distribution network can help a supply chain system to achieve maximum profits or minimize total cost. In this work, algorithms are designed to allocate customer demands to the distribution centers (DCs) in the supply chain network. The best locations for DCs and production distributions through DC in this work are found via a bi-level programming model. The upper-level model under the firm's consideration is to determine the optimal locations for DCs and allocate supplies to minimize the total cost, while the lower-level model is to minimize the total transportation cost of all customers. In this work, the demands of customer (or the demands of DC) can be split among DCs (or plants). Propositions for optimal assignment are presented where supplies cannot be split. All 5 algorithms are proposed to solve each level of the problem. The priorities in allocating process in each algorithm are different, taking into account the structure of the problem. The effectiveness of these algorithms are compared with the optimal/best solutions found using CPLEX and an existing algorithm. The simulation results show that all of the proposed algorithms are superior to CPLEX in large-scale problems. The proposed algorithms can execute up to 4200 DCs and 4200 customers while CPLEX can execute only problems up to 500 × 500 in size. Experiments are done to solve the municipal waste system (3,211 demand nodes and up to 48 DCs) covering 5 provinces of Northern Thailand. |
|---|