Improved Cross Entropy Algorithm for the Optimum of Charge Planning Problem

<table class="table-group" id="tab1"><tr><td><table class="table"><tr><td class="thead-hr" colspan="3"><hr/></td></tr><tr class="thead"><td align="left"> </td><td align="center">ICE</td><td align="center">CE</td></tr><tr><td class="thead-hr" colspan="3"><hr/></td></tr><tr><td align="left">Optimum value</td><td align="center">2352</td><td align="center">2354</td></tr><tr><td align="left">Mean running time</td><td align="center">26.06</td><td align="center">28.98</td></tr><tr><td align="left">Mean deviation</td><td align="center">8.6</td><td align="center">55.3</td></tr><tr class="table-tr"><td colspan="3"><hr class="tbody-hr"/></td></tr></table></td></tr></table>

Abstract and Applied Analysis

tab1

Table 1

Table 1: Improved Cross Entropy Algorithm for the Optimum of Charge Planning Problem 