面向B2C及C2C业务的快递服务网点选址优化模型与算法  

Model and Algorithm of Location Optimization of Express Service Point for B2C and C2C Business

作　　者：杜培全[1] 陈森发[1] 

机构地区：[1]东南大学,江苏南京211189

出　　处：《物流科技》2008年第11期56-59,共4页Logistics Sci-Tech

基　　金：教育部博士点基金资助项目(20060286005)

摘　　要：在分析各小区域潜在顾客群的特点及其构成的基础上,为了以最小的费用、最短的时间服务尽可能多的顾客,结合快递物流的特点,建立了混合0-1整数规划的快递服务网点的选址优化模型。该模型是一个高维、非线性、非凸性的复杂函数优化问题。为求解此模型,开发了一种改进遗传算法,实例表明,该算法能高效求得模型的最优解,是求解快递物流服务网点选址这类复杂优化问题的一个较好方法。Based on＇analyzing the characteristics and composition of potential customers in every small area, in order to serve as many customers as possible with the least cost and the shortest time, combining characteristics of express, a mixed 0-1 integer programming model is built for optimizing the location of express service point, which is a high-dimensional, non-linear, non- convex complicated function optimization problem. To solve this model, a modified genetic algorithm is developed. Examples show that the algorithm can find the optimal solution efficiently to this model, and it is a good method to solve the complicated optimization problems of the location of express service point.

关 键 词：B2C及C2C 快递服务网点 选址 遗传算法 顾客群 

分 类 号：U115[交通运输工程]