Open Access
2014 Improved Cross Entropy Algorithm for the Optimum of Charge Planning Problem
Fan Yang, Qiqiang Li
Abstr. Appl. Anal. 2014(SI53): 1-5 (2014). DOI: 10.1155/2014/857521


To solve the charge planning problem involving charges and the orders in each charge, a traveling salesman problem based charge planning model and the improved cross entropy algorithm are proposed. Firstly, the charge planning problem with unknown charge number is modeled as a traveling salesman problem. The objective of the model is to minimize the dissimilarity costs between each order and its charge center order, the open order costs, and the unselected order costs. Secondly, the improved cross entropy algorithm is proposed with the improved initial state transition probability matrix which is constructed according to the differences of steel grades and order widths between orders. Finally, an actual numerical example shows the effectiveness of the model and the algorithm.


Download Citation

Fan Yang. Qiqiang Li. "Improved Cross Entropy Algorithm for the Optimum of Charge Planning Problem." Abstr. Appl. Anal. 2014 (SI53) 1 - 5, 2014.


Published: 2014
First available in Project Euclid: 27 February 2015

MathSciNet: MR3230537
Digital Object Identifier: 10.1155/2014/857521

Rights: Copyright © 2014 Hindawi

Vol.2014 • No. SI53 • 2014
Back to Top