About this Journal Submit a Manuscript Table of Contents
Abstract and Applied Analysis
Volume 2014 (2014), Article ID 857521, 5 pages
http://dx.doi.org/10.1155/2014/857521
Research Article

Improved Cross Entropy Algorithm for the Optimum of Charge Planning Problem

School of Control Science and Engineering, Shandong University, Jinan 250061, China

Received 14 March 2014; Accepted 13 June 2014; Published 1 July 2014

Academic Editor: Qi-Ru Wang

Copyright © 2014 Fan Yang and Qiqiang Li. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract

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.