检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:蔡建湖 丁玉姣 曹朕纲 俞武扬[2] CAI Jianhu;DING Yujiao;CAO Zhen'gang;YU Wuyang(Experimental Center for Data Science&Intelligent Decision Making,Hangzhou Dianzi University,Hangzhou 310018;School of Management,Hangzhou Dianzi University,Hangzhou 310018,China)
机构地区:[1]杭州电子科技大学数据科学与智能决策实验中心,浙江杭州310018 [2]杭州电子科技大学管理学院,浙江杭州310018
出 处:《物流技术》2024年第4期125-137,共13页Logistics Technology
基 金:浙江省社科规划专项课题资助“线上线下协同驱动的浙江省现代化交通物流网络构建方案研究”。
摘 要:随着社会行业数量增加、业务种类丰富,许多行业都需要通过交通运输来为客户提供特定的服务,不时会产生诸如道路拥堵的交通问题以及诸如二氧化碳气体排放的环境问题。为在合理运用道路交通资源的同时减少碳排放量,在共享经济的基础上将网约车行业与物流业相联系,使网约车协助快递公司配送货物,形成一种“人货合乘”的配送模式。基于此,考虑碳排放成本,构建以网约车利润最大、乘客与司机的等待时间总和最小的双目标优化模型,以NSGA-II算法为求解框架,采用启发式方法构造初始解,并设计了保序交叉算子和双车辆交叉算子,同时通过融合、替换、移动等变异算子对解产生扰动。最后结果验证了“人货合乘”配送模式在缓解交通问题和环境问题上的有效性。With the rapid development of Internet technology,the ride-hailing service has become in⁃creasingly popular.However,a significant issue arises:Ride-hailing vehicles often run unloaded,leading to a waste of road resources and further exacerbating traffic congestion.Additionally,the logistics industry faces the challenge of increasing distribution pressure over the years.The growing number of vehicles contributes to higher carbon emissions,posing a significant threat to the environment.Hence,this paper explores the po⁃tential for combining ride-hailing with the logistics industry and proposes the“cargo-passenger”joint trans⁃portation mode for the purpose to alleviate the empty runs of the ride-hailing vehicles,ease the distribution pressure on the logistics companies,and lower carbon emissions by the transportation sector.Under this mode,the ride-hailing vehicle has the option to pick up several minor cargoes from a distribution center de⁃pending on whether the passengers allow the additional stops while ensuring that both the passengers'board⁃ing time window and the deadline for receiving the cargoes are met during the trip.To optimize this process,a dual-objective programming model is designed to maximize the total profit for all ride-hailing vehicles and to minimize the total waiting time for both the passengers and the ride-hail⁃ing vehicles.To achieve these objectives,the NSGA-II algorithm is adopted as the framework for solving the problem.First,a heuristic initial solution scheme is designed,and individuals from the initial population are selected as parents according to a binary tournament.Second,the order-preserving crossover operator and two-vehicle crossover operator are designed in the crossover stage;and mutation operators for cargo ex⁃change,for moving cargo before the pick-up point,for moving the cargo between the pick-up and the drop-off points,and for vehicle fusion are designed in the mutation stage.Third,the crossed and mutated populations are sorted to form new progeny.Finally,
关 键 词:“人货合乘” 碳排放 NSGA-II 路径优化 网约车
分 类 号:F252[经济管理—国民经济] X322[环境科学与工程—环境工程] U492.22[交通运输工程—交通运输规划与管理]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.144.143.110