Dynamic region soft partitioning method was also proposed which can reduce the complexity of analysis and modeling of complex system . every dynamic sub-region is one aggregation which including continuous variables and discrete events, and their mutual actions . at the same time, every dynamic sub-region is one unit, which has its dynamic characters and developing rules 動態(tài)區(qū)間軟劃分后得到的每一個動態(tài)子區(qū)間都是一個既包含連續(xù)變量和離散變量又具有兩種變量相互作用的復(fù)雜集合體,同時(shí)每一個動態(tài)子區(qū)間又都是具有其動態(tài)特性和變化規(guī)律的獨(dú)立整體。
Clustering processes are always carried out in the condition with no pre-known knowledge, so the most research task is to solve that how to get the clustering result in th is premise . as the development of data mining, a number of clustering algorithms has been founded, in general, major clustering methods, can be classified into the following categories : partitioning methods; hierarchical methods; density-based methods; grid-based methods; model-methods; besides these, some clustering algorithms integrate the ideas of several clustering methods 正是由于聚類分析的重要性和特殊性,近年來在該領(lǐng)域的研究取得了長足的發(fā)展,涌現(xiàn)出了許多聚類分析的方法,如劃分聚類方法(partitioningmethod)、層次聚類方法(hierarchicalmethod)、基于密度(density?based)的聚類方法、基于網(wǎng)格(grid?based)的聚類方法、基于模型(model?based)的聚類方法等等。
Secondly, in the first phase, this paper solves the inventory supplement sub-problem through integer programming model, using the reduction of vehicle routes as the breakthrough to this problem, divides a whole distribution region into many customer subsets by radius-circle partitioning method, determines the optimal number of vehicle of service distribution region, applies two practice-oriented conclusions to reduce the number of routes on the basis of customer grouping, thus decreases considerably the variable scale of integer programming, and solves the problem through professional software to fix inventory supplement plan in plan period 其次,在第一階段使用整數(shù)規(guī)劃數(shù)學(xué)模型來規(guī)劃庫存補(bǔ)充計(jì)劃子問題,以減少車輛巡回路線數(shù)目為求解該整數(shù)規(guī)劃的突破口,提出與固定劃分策略(fpp)相似的客戶分組思想,通過徑?環(huán)切割法把整個配送區(qū)域劃分成多個客戶子集,實(shí)現(xiàn)客戶分組并確定服務(wù)整個配送區(qū)域的最佳車輛數(shù)目。在客戶分組的基礎(chǔ)上建立了精簡路線的整數(shù)模型,然后通過運(yùn)用兩條基于實(shí)際經(jīng)驗(yàn)的判斷來進(jìn)一步減少巡回路線數(shù)目,進(jìn)而極大地減少了整數(shù)規(guī)劃的變量規(guī)模,并利用專業(yè)的求解軟件來求解該整數(shù)規(guī)劃問題,從而確定計(jì)劃期的庫存補(bǔ)充計(jì)劃。