检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]华中科技大学数字制造装备与技术国家重点实验室,湖北武汉430074
出 处:《工业工程与管理》2009年第3期13-19,共7页Industrial Engineering and Management
基 金:国家自然科学基金资助项目(50705036);国家863高技术研究发展计划资助项目(2007AA04Z190;2007AA04Z107)
摘 要:为了提高物流服务水平、降低物流运作成本,针对由多个第三方物流服务商组建而成的第三方物流联盟中物流任务与物流服务资源的优化调度问题展开研究,综合考虑各第三方物流服务商资源节点提供物流活动服务成本和物流服务总时间,以时间最短和成本最低为优化目标,提出了基于时间和成本的多目标优化调度模型,针对目前物流任务调度优化模型中只考虑各物流服务资源节点本身的服务成本和时间,而未考虑执行各个物流活动之间的物流资源节点之间的衔接时间与衔接成本的问题,提出一种计算不同物流服务资源节点之间的物流服务衔接时间和衔接成本的方法,在模型中,考虑了物流资源服务时间窗限制问题。最后提出了一个改进的遗传算法进行模型求解,并通过算例验证了研究的有效性。In order to improve customer services and reduce logistics costs, the scheduling of logistics tasks and logistics resources among third party logistics service providers in a third party logistics alliance is studied. A multi-objective scheduling model aiming at minimizing total operation costs and completion time of total logistics tasks in the alliance is proposed. Currently, other scheduling models in the fields only considered costs and completion time of each logistics resource node or logistics task. However, the joint cost and time between two adjacent resource nodes or services are not included. Therefore, a method to calculate the joint cost and time of logistics activities between two adjacent resource nodes is proposed. The time window constraint of each resource node is also considered in the proposed model. Finally, an improved genetic algorithm is designed to solve the model and the validity of proposed model and algorithm are verified by a corresponding case study.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.30