By Topic

A hybrid algorithm of tabu search and benders decomposition for multi-product production distribution network design

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Wei Jiang ; Liaoning Key Laboratory of Manufacturing System and Logistics, The Logistics Institute Northeastern University Shenyang, 110004, China ; Lixin Tang ; Shixu Xue

A multi-product two-stage production distribution network design problem (PDND) is considered in this paper. The network consists of capacitated plants, capacitated distribution centers and customers. The known demand for multiple products at the customers is satisfied by shipping via distribution centers, and each customer demand is supplied via a single distribution center. A relatively efficient hybrid algorithm of tabu search and Benders decomposition is proposed to determine where distribution centers are located and by which distribution center each customer is served exclusively. In Benders decomposition framework, a tabu search algorithm is used to solve the master problem to obtain quickly approximate-optimal solutions. At the same time, three kinds of neighbourhood structure are used in tabu search. The computational experiments show that the hybrid algorithm saves tremendous computation time in comparison with conventional Benders decomposition.

Published in:

2009 IEEE International Conference on Automation and Logistics

Date of Conference:

5-7 Aug. 2009