A Bi-level Programming for the Multi-echelon Supply Chain Distribution Network Design
スポンサーリンク
概要
- 論文の詳細を見る
This paper considers a multi-plant and multi-distribution centers (DCs) supply chain distribution network (SCDN). The decisions are to locate the open DCs, allocate customers to DCs, and DCs to plants to minimize the total logistics cost including the fixed costs and warehousing cost of DCs, and shipping cost from plants to DCs and from DCs to customers. Also, it takes workload balance requirements into consideration to avoid those open DCs being congested or idle. A bi-level programming model is proposed to deal with this problem. The upper level considers DC location problem and production-allocation problem. The lower level focuses on allocating customers to DCs such that the workload of each open DC is balanced. We propose a double threshold accepting (TA) approach to solve this problem. Four different examples are tested and the results show that our double threshold accepting algorithm can obtain a good solution efficiently.
著者
-
YANG Yu-Ju
Material Procurement Divison AU Optronics Corporation
-
TING Ching-Jung
Department of Industrial Engineering and Management Yuan Ze University
関連論文
- Applying Two-Stage Ant Colony Optimization to Solve the Large Scale Vehicle Routing Problem
- A Beam Search Heuristic for the Traveling Salesman Problem with Time Windows
- A Threshold Accepting Algorithm for the Uncapacitated Single Allocation p-Hub Median Problem
- A Bi-level Programming for the Multi-echelon Supply Chain Distribution Network Design
- APPLING TABU SEARCH FOR MINIMIZING RESHUFFLE OPERATIONS AT CONTAINER YARDS
- A HYBRID LAGRANGIAN HEURISTIC/SIMULATED ANNEALING ALGORITHM FOR THE MULTI-DEPOT LOCATION ROUTING
- A HYBRID ANT COLONY SYSTEM FOR VEHICLE ROUTING PROBLEM WITH TIME WINDOWS
- ANT COLONY SYSTEM BASED APPROACHES TO THE AIR-EXPRESS COURIER'S ROUTING PROBLEM