摘要
多式联运环境下带时间窗的路径选择问题是广泛应用于物流配送领域的一类组合优化问题,然而目前相关研究主要聚焦于多式联运环境下单个起点到单个终点的一种货物配送问题,其研究成果难以直接适用于汽车销售、钢铁运输等环境下单个供货商到多个零售商的多产品运输问题。因此,文中以汽车销售为研究背景,对多式联运环境下带时间窗的多产品运输问题进行研究,建立了该问题的数学模型,然后利用蚁群算法进行了求解,最后通过实验验证了算法的有效性。
Path selection problem with time windows in the multimodal transportation environment is a kind of combinatorial optimization problem which plays an important role in the fields of physical distribution and logistics.However, related studies focus mainly on freight distribution problem from a single origin to a single destination in the multimodal transportation environment,so the research results can not be directly applied to a multi-product distribution problem from one supplier to multiple retailers in the automobile sales and steel transportation system.This paper studies the path selection problem with time windows in the automobile sales sysytem of the mulimodal environment,stablishes the mathematical model of this problem,then solves the problem with improved ant colony algorithm and finally proves the algorithm effective through an experiment.
出处
《物流工程与管理》
2014年第5期74-77,12,共5页
Logistics Engineering and Management
基金
国家自然科学基金项目(71001032)
国家自然科学基金重点项目(71131002)
中央高校基本科研业务费专项基金资助(2012HGZY0009)
中航工业产学研专项(CXY2011HFGD20)
关键词
多式联运
路径选择
时间窗
蚁群算法
multimodal transportation
path selection
time windows
ant colony algorithm
