Abstract

No abstract

No abstract

<span style="font-size: 10pt; font-family: &quot;Times New Roman&quot;; mso-fareast-font-family: 宋体; mso-fareast-language: EN-US; mso-ansi-language: EN-US; mso-bidi-language: AR-SA;" lang="EN-US">The tobacco distribution in China is organized by the tobacco company in the unit of city. The distribution cycle is commonly a week with five fixed distribution districts started from the center depot, and the routes in each district are fixed for the vehicles and drivers. This method with low efficiency and high cost has continued for several decades because of the poor technology and economic reasons. In this paper, we propose a feasible and optimal method for the tobacco distribution partition balance problem (TDPBP) by breaking the fixed partitions. An immune co-evolutionary algorithm (ICEA) is proposed to search the optimal partitions. Moreover, the decision support system (DSS) for partition balance is designed. Linfen city in China as a real-world case is proved that the DSS can discover the efficient distribution planning. The comparisons among three solutions, &lsquo;Fixed&rsquo;, &lsquo;the DSS&rsquo; and &lsquo;Pure VRP&rsquo;, further prove that the DSS is an effective decision support tool for TDPBP.</span>