Abstract and Applied Analysis
- Abstr. Appl. Anal.
- Volume 2014, Special Issue (2013), Article ID 857521, 5 pages.
Improved Cross Entropy Algorithm for the Optimum of Charge Planning Problem
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.
Abstr. Appl. Anal., Volume 2014, Special Issue (2013), Article ID 857521, 5 pages.
First available in Project Euclid: 27 February 2015
Permanent link to this document
Digital Object Identifier
Mathematical Reviews number (MathSciNet)
Yang, Fan; Li, Qiqiang. Improved Cross Entropy Algorithm for the Optimum of Charge Planning Problem. Abstr. Appl. Anal. 2014, Special Issue (2013), Article ID 857521, 5 pages. doi:10.1155/2014/857521. https://projecteuclid.org/euclid.aaa/1425049084