A hybrid algorithm for capacitated plant location problem

doi:10.1016/j.eswa.2010.06.104

A hybrid algorithm for capacitated plant location problem

2010-12-01

35

PRE

AI

DOI：10.1016/j.eswa.2010.06.104

原文链接

原文求助

摘要

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.

Keyword:

Genetic algorithm

Benders' decomposition

Capacity

Plant location

Mixed-integer programming

A hybrid algorithm for capacitated plant location problem

摘要

AI总结

期刊

机构

引用论文