Improved Cross Entropy Algorithm for the Optimum of Charge Planning Problem

Fan Yang and Qiqiang Li

Abstract and Applied Analysis, 2014, vol. 2014, 1-5

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.

Date: 2014
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/AAA/2014/857521.pdf (application/pdf)
http://downloads.hindawi.com/journals/AAA/2014/857521.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlaaa:857521

DOI: 10.1155/2014/857521

Access Statistics for this article

More articles in Abstract and Applied Analysis from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().