摘要
以电子商务企业交易为背景,分析了B2C环境下客户订单的特点及客户对订购货物配送服务的要求,针对该环境下的物流配送问题建立了相应的数学模型,设计了一种改进的禁忌搜索算法,进行了算例测试,并将测试结果与相关文献结果进行了比较.实验结果表明:改进的禁忌搜索算法在优化效果及计算时间等方面比有记忆功能的遗传模拟退火算法具有更优的性能.该算法能适应电子商务环境下快速、低成本的配送要求且简单易行,为电子商务环境下订单配送问题的研究提供了新的思路.
Discussing the characteristics of the orders placed by customers and what they require for the distribution and delivery of the goods on order in B2C e-commerce, a relevant mathematical model was developed with an improved tabu search algorithm designed and tested via numerical examples. And the testing results were compared with some earlier works as shown in the reference of this paper. It was found that the improved tabu search algorithm as a new approach is superior to GA-SA algorithm with memory function in both routing optimizing effect and computing time, and it is simple and easy to implement especially adaptable to the quick distribution/delivery of the goods on order in e-commerce.
出处
《东北大学学报(自然科学版)》
EI
CAS
CSCD
北大核心
2009年第11期1554-1557,共4页
Journal of Northeastern University(Natural Science)
基金
国家自然科学基金资助项目(70771020
70721001)
国家高技术研究发展计划项目(2007AA04Z194)
教育部新世纪优秀人才支持计划项目(NCET-06-0286)
关键词
B2C电子商务
物流配送
路径优化
数学模型
禁忌搜索算法
B2C(business to customers) E-commerce
logistic distribution
routing optimization
mathematical model
tabu search algorithm