有时间窗物流配送路径优化问题的并购算法
收稿日期: 2009-08-25
修回日期: 2009-12-09
网络出版日期: 2010-12-25
基金资助
浙江省科技计划项目(2008C111062)
A Mergers and Acquisitions Algorithm of Optimizing the Physical Distribution Routing Problem with Time Windows
Received date: 2009-08-25
Revised date: 2009-12-09
Online published: 2010-12-25
刘芳华,赵建民,徐慧英,朱信忠 . 有时间窗物流配送路径优化问题的并购算法[J]. 计算机工程与科学, 2010 , 32(12) : 80 -84 . DOI: 10.3969/j.issn.1007130X.2010.
According to studying the market activities of optimizing the market resource distribution,we extract the essence of the Mergers & Acquisitions (M & A) behavior,which is one of the market activities,and simplify the model of the M & A behavior. M & A and restructuring the activities may be operated reasonably among enterprises according to their bad credits,and it is also a reintegration of the market resources,in order to fully optimize,as well as to improve the market competitiveness of all the enterprises. We construct a model of optimizing the physical distribution routing problem with time windows based on the M & A algorithm. The model consists of encoding,initialization,pretreatment,bad credit assessment,M & A,restructuring and selection in seven modules,on the basis of establishing a mathematic model of optimizing the physical distribution routing problem. After making some experiments on the Solomon data sets and comparing with the optimal solution obtained currently,we obtain the optimal or nearly optimal solutions of optimizing the physical distribution routing problem with time windows.
/
| 〈 |
|
〉 |