Abstract: Based?on?the?capacity?of?distribution?center?and?transfer?station,?the?scope?of?their?distribution?region?is?divided?respectively,?and?the?uncertain?border?region?is?divided?into?several?distribution?units?by?adding?road?grade.?Firstly,?the?transfer?stations?are?decided?to?divide?the?distribution?units.?According?to?distribution?costs?of?the?units,?the?fixed?costs?and?variable?costs?of?distribution?centers?and?transfer?stations,?the?operation?research?model?of?border?distribution?region?partition?is?established.?Genetic?algorithm?is?applied?to?design?the?encoded?scheme,?by?which?distribution?units?choose?the?distribution?centers?and?transfer?stations,?and?then?the?program?is?written?to?solve?the?partition?problem.

Key words: NP （ nondeterministic polynomial） problem , border distribution region , genetic algorithm , encode

摘要： 以配送中心和中转站的配送能力划分各自的配送范围后,将不确定的边界区域加入道路等级划分为若干配 送单元。并选择决策中转站规划配送单元,依据配送单元的配送成本、配送中心及中转站的固定成本和变动成本, 建立边界配送区域规划的运筹学模型。应用遗传算法设计了配送单元选择配送中心和中转站的编码方式,编写程 序求解模型。

关键词: NP问题, 边界配送区域, 遗传算法, 编码