.png){kind=icon}
Return
A hybrid algorithm for capacitated plant location problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.eswa.2010.06.104.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper presents a new hybrid algorithm for a classical capacitated plant location problem. Benders' decomposition algorithm has been successfully applied in many areas. A major difficulty with this decomposition lies in the solution of master problem, which is a hard problem, costly to compute. Our proposed algorithm, instead of using a costly branch-and-bound method, incorporates a genetic algorithm to obtain good suboptimal solutions to the master problem at a tremendous saving in the computational effort. The performance of the proposed algorithm is tested on randomly generated data and also well-known existing data. The computational results indicate that the proposed algorithm is effective and efficient for the capacitated plant location problem and competitive with the Benders' decomposition algorithm. (C) 2010 Elsevier Ltd. All rights reserved.
Keywords:
Genetic algorithm
Benders' decomposition
Capacity
Plant location
Mixed-integer programming
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.5
Papers:
3.0W
Citations:
10.2W
Organization
View more organizations
Cited Papers
No cited papers available