检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:史有鑫 SHI Youxin(Business School,University of Shanghai for Science&Technology,Shanghai 200093,China)
出 处:《物流技术》2023年第1期78-82,123,共6页Logistics Technology
摘 要:结合装修垃圾收运特点,提出中转站自营收运与第三方物流收运相结合的联合收运模式,将时间窗、容量作为主要约束条件,建立以中转站自营收运运输成本、运营成本、居民可支付费用、时间惩罚成本、第三方物流车辆租赁成本为最小目标的数学模型,进行路径优化求解。并设计改进遗传算法,结合算例,对装修垃圾收运模式问题进行仿真,并将结果与自营收运模式和经典遗传算法下的联合收运模式进行对比,结果表明,联合收运模式成本较低,改进遗传算法在求解过程中收敛速度快,不仅证明了联合收运模式的可行性,也证明了改进遗传算法是解决此问题的一种有效算法。In connection with the characteristics of construction waste collection and transportation, this paper put forward the joint collection and transportation mode involving both the transfer station and the third-party logistics company. Taking time window and capacity as the main constraint conditions, it established a mathematical path optimization model with minimizing the self-operated collection and transportation cost of the transfer station, the operating cost, the payment due from the residents, the time penalty cost and the third-party logistics vehicle rental cost as the objective. Next, it designed an improved genetic algorithm, and simulated the construction waste collection and transportation mode through a numerical example, and compared the result obtained with that under the self-operated collection and transportation mode using the classical genetic algorithm, through which it was shown that the proposed joint collection and transportation mode could arrive at lower cost, and the improved genetic algorithm could have quicker convergence in the solving process, which proved not only the feasibility of the joint collection and transportation mode, but also that the improved genetic algorithm was effective in solving such problems.
分 类 号:X799.1[环境科学与工程—环境工程] U492.22[交通运输工程—交通运输规划与管理] F224[交通运输工程—道路与铁道工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.7