A HYBRID LAGRANGIAN HEURISTIC/SIMULATED ANNEALING ALGORITHM FOR THE MULTI-DEPOT LOCATION ROUTING
スポンサーリンク
概要
- 論文の詳細を見る
The design of a logistics system can be defined as a Location Routing Problem (LRP), which is to find the optimal number and locations of the distribution centers, simultaneously with the vehicle routing to minimize the total system cost. In this research, a three-phase hybrid heuristic approach (LH-SA), combining the Lagrangian heuristic (LH) and simulated annealing (SA), is developed to solve the multi-depot location routing problem (MDLRP). Firstly, the LH is applied to determine the facility location set and the allocation of customers. Then an independent vehicle routing problem (VRP) for each selected facility location is solved by SA. Finally, the SA is used to perform a global search for all routing moves. The performance of the proposed algorithm is tested on two different groups of benchmark instances and compared with other algorithms in the literature. The results show that the LH-SA is competitive and updates 20 best-known solutions.
著者
-
TING Ching-Jung
Department of Industrial Engineering and Management Yuan Ze University
-
CHEN Chia-Ho
Department of Industrial Engineering and Management, Yuan Ze University
-
CHEN Chia-Ho
Department of Global Marketing and Logistics, MingDao 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