**9. References**


418 Bio-Inspired Computational Algorithms and Their Applications

In this chapter, we have demonstrated that Benders' decomposition algorithm for solving the capacitated plant location problem can be accelerated substantially when the master problem is solved heuristically. The hybrid Benders/GA algorithm is a variation of Benders' algorithm in which, instead of using a costly branch-and-bound method, a genetic algorithm is used to obtain "good" subproblem solutions to the master problem. The numerical example shows that the hybrid algorithm is effective to solve the capacitated plant location problem. The results imply that the hybrid algorithm is much more practical when only near-optimal solutions are required. Future work could extend the proposed algorithm to

This work was partially supported by the US Department of Agriculture (USDA under

Baker, J. E. (1985). Adaptive selection methods for genetic algorithms. *Proceedings of the 1st* 

Beasley, D.; Bull, D. R. & Martin, R. R. (1993). An Overview of Genetic Algorithms: Part 1,

Benders, J. F. (1962). Partitioning Procedures for Solving Mixed-Variables Programming

Biles, J. A. (2001). GenJam: evolution of a jazz improviser. In: *Creative Evolutionary Systems* 

Cakir, O. (2009). Benders decomposition applied to multi-commodity, multi-mode distribution planning. *Expert Systems with Applications*, Vol. 36, pp. 8212-8217. Chatterjee, S.; Carrera, C. and Lynch, L. (1996). Genetic algorithms and traveling salesman problems. *European journal of operational research,* Vol. 93, No. 3, pp. 490-510. Cordeau, J.-F.; Soumis, F. & Desrosiers, J. (2000). A Benders decomposition approach for the

Cordeau, J.-F.; Soumis, F. & Desrosiers, J. (2001). Simultaneous assignment of locomotives and cars to passenger trains. *Operations research*, Vol. 49, No. 4, pp. 531-548. Cortinhal, M. J. & Captivo, M. E. (2003). Upper and lower bounds for the single source

Davis, L. (1991). *Handbook of Genetic Algorithms*, Van Nostrand Reinhold Company, ISBN

Delmaire, H.; Di´az, J. A. & Ferna´ndez, E. (1999). Reactive GRASP and tabu search based

Fundamentals. *University Computing*, Vol. 15, No. 4, pp. 170-181.

Problems. *Numerische Mathematik*, Vol. 4, pp. 238-252.

*International Conference on Genetic Algorithms*, pp. 101-111, ISBN 0-8058-0426-9,

*(The Morgan Kaufmann Series in Artificial Intelligence)*, P. J. Bentley & D. W. Corne (Ed.), pp. 165-188, Morgan Kaufmann, ISBN 978-1558606739, SanFrancisco, CA,

locomotive and car assignment problem. *Transportation science*, Vol. 34, No. 2, pp.

capacitated location problem. *European journal of operational research*, Vol. 151, No. 2,

heuristics for the single source capacitated plant location problem. *INFOR,* 

**7. Conclusion** 

other location problems.

**8. Acknowledgment** 

grant #2011-38422-30803).

USA.

133-149.

pp. 333-351.

978-0442001735, New York, USA.

Pittsburgh, PA, USA, July, 1985.

**9. References** 

*Canadian Journal of Operational Research and Information Processing*, Vol. 37, pp. 194- 225.


420 Bio-Inspired Computational Algorithms and Their Applications

Reeves, R. C. (1997). Genetic algorithms for the operations researcher. *INFORMS Journal on* 

Rolland, E.; Schilling, D. A. & Current, J. R. (1996). An efficient tabu search procedure for the p-median problem. *European Journal of Operational Research*, Vol. 96, pp. 329-342. Salkin, H. M.; Mathur, K. & Haas, R. (1989). *Foundations of Integer Programming*, Appleton &

Uno, T.; Hanaoka, S. & Sakawa, M. (2005). An application of genetic algorithm for multi-

Van Roy, T. J. (1986). A cross decomposition algorithm for capacitated facility location.

Van Roy, T. J. & Erlenkotter, D. (1982). Dual-based procedure for dynamic facility location.

Whitley, D. (1989). The GENITOR algorithm and selective pressure: Why rank-based

dimensional competitive facility location problem. *Proceedings of IEEE International Conference on Systems, Man and Cybernetics*, pp. 3276-3280, ISBN 0-7803-9298-1, Big

allocation of reproductive trials is best. Proceedings of the 3rd International Conference on Genetic Algorithms, pp. 116-121, ISBN 1-55860-066-3, Fairfax,

*computing*, Vol. 9, No. 3, pp. 231-250.

Island, Hawaii, USA, October 12, 2005

*Operations Research*, Vol. 34, pp. 145-163.

Virginia, USA, June 1989.

*Management Science*, Vol. 28, pp. 1091-1105.

Lange, ISBN 978-0130550392, New York, USA
