检索结果-南通市图书馆

Robust Electric Vehicle Routing Problem with Time Windows under Demand Uncertainty and Weight-Related Energy Consumption

在线全文

学校读者我要写书评

暂无评论

Complex System Modeling and Simulation 2022年第1期2卷 18-34页

作者： yindong shen Leqin Yu Jingpeng Li Key Laboratory of Image Processing and Intelligent Control School of Artificial Intelligence and AutomationHuazhong University of Science and TechnologyWuhan 430074China Division of Computer Science and Mathematics University of StirlingStirlingFK94LAUK

Vehicle routing problem with time windows(VRPTW)is a core combinatorial optimization problem in distribution *** electric vehicle routing problem with time windows under demand uncertainty and weight-related energy consumption is an extension of the *** some researchers have studied either the electric VRPTW with nonlinear energy consumption model or the impact of the uncertain customer demand on the conventional vehicles,the literature on the integration of uncertain demand and energy consumption of electric vehicles is still ***,practically,it is usually not feasible to ignore the uncertainty of customer demand and the weight-related energy consumption of electronic vehicles(EVs)in actual ***,we propose the robust optimization model based on a route-related uncertain set to tackle this ***,adaptive large neighbourhood search heuristic has been developed to solve the problem due to the NP-hard nature of the *** effectiveness of the method is verified by experiments,and the influence of uncertain demand and uncertain parameters on the solution is further explored.

关键词： electric vehicle routing problem time windows uncertain demand energy consumption model robust optimization adaptive large neighbourhood search

A Discrete Artificial Bee Colony Algorithm for Stochastic Vehicle Scheduling

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Complex System Modeling and Simulation 2022年第3期2卷 238-252页

作者： Yuanyuan Li yindong shen Jingpeng Li Key Laboratory of Image Processing and Intelligent Control School of Artificial Intelligence and AutomationHuazhong University of Science and TechnologyWuhan 430074China Division of Computer Science and Mathematics University of StirlingStirlingFK94LAUK

Vehicle scheduling plays a profound role in public ***,stochastic vehicle scheduling may lead to more robust *** solve the stochastic vehicle scheduling problem(SVSP),a discrete artificial bee colony algorithm(DABC)is *** to the discreteness of SVSP,in DABC,a new encoding and decoding scheme with small dimensions is designed,whilst an initialization rule and three neighborhood search schemes(i.e.,discrete scheme,heuristic scheme,and learnable scheme)are devised individually.A series of experiments demonstrate that the proposed DABC with any neighborhood search scheme is able to produce better schedules than the benchmark results and DABC with the heuristic scheme performs the best among the three proposed search schemes.

关键词： public transportation stochastic vehicle scheduling discrete artificial bee colony search scheme

Dynamic vehicle scheduling based on HTN 36

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Dynamic vehicle scheduling based on HTN

Integrated optimization of Order Batching and Distribution based on EDA

第36届中国控制会议

作者： yindong shen Zhongyi Zeng Zhewei Wu School of Automation Huazhong University of Science and Technology Key Laboratory of Image Processing and Intelligent Control (Huazhong University of Science and Technology) Ministry of Education

ISBN: (纸本)9781538629185

Vehicle scheduling plays a crucial role in public transport bus companies. An efficient schedule can help bus companies reduce operating costs while being an essential guide to daily operations. However, the precompiled schedule is usually hard to be adhered to in practice due to the diversity of traffic and driving conditions. Therefore, dynamic vehicle scheduling becomes an important supplement to the daily operations. In this paper, a dynamic vehicle scheduling approach based on Hierarchical Task Network(HTN) is proposed. In the approach, two dynamic vehicle scheduling strategies are devised according to the practical scheduling philosophy. The first is to reschedule for individual vehicle independently, the objective is to maximize the execution of the precompiled schedule. The second is to reschedule for multiple vehicles simultaneously, which aims to maintain the scheduled headways. The two strategies are achieved in the HTN planning through different task decomposition processes, which are constrained by vehicle resources currently available. To verify the feasibility, this approach is implemented based on the Simple Hierarchical Ordered Planner 2(SHOP2), which is a domainindependent and state-based forward HTN planner. Experimental results show that the approach has good adaptability to solve dynamic vehicle schedule problem, meanwhile, it can be helpful to deal with the abnormal services agilely and hence to increase the service quality of public transit.

关键词： public transit dynamic vehicle scheduling scheduling strategies HTN planning SHOP2

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

Integrated optimization of Order Batching and Distribution b...

第32届中国控制与决策会议

作者： Shunli Feng yindong shen Key Laboratory of Image Processing and Intelligent Control School of Artificial Intelligence and AutomationHuazhong University of science and technology

The order picking and distribution are two necessary activities in logistics,the cost of which accounts for a considerable portion of the logistics *** there are dependencies between these two activities,a lot of work has been carried out on them independently;hence,the optimization may be *** paper proposes an integrated order batching and distribution *** objectives are to minimize the makespan（including picking time and delivery time） and to minimize the number of delivery *** solve the integrated model,an EDA approach is devised,in which an elaborate encoding/decoding method is employed and an incremental learning probability model is *** show that the proposed integrated model and its solution approach can lead to a significant reduction in the total cost（weighted sum of the makespan and the number of delivery trips）.

关键词： Order Batching Order picking Logistics Distribution EDA approach

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

基于多任务学习的多线路公交车程时间预测

华中科技大学学报（自然科学版） 2022年第11期50卷 90-95页

作者：谢文亮沈吟东华中科技大学人工智能研究院湖北武汉430074

针对现有公交车程时间预测方法不适用于公交有限数据集,且难以对区域内多条公交线路进行预测的不足,研究设计了一种基于多任务学习的多线路公交车程时间预测模型.首先,对多线路公交车程时间预测问题进行分析,并根据问题的特点建立多任... 详细信息

针对现有公交车程时间预测方法不适用于公交有限数据集,且难以对区域内多条公交线路进行预测的不足,研究设计了一种基于多任务学习的多线路公交车程时间预测模型.首先,对多线路公交车程时间预测问题进行分析,并根据问题的特点建立多任务学习预测模型,实现同时对多条公交线路的车程时间的预测.然后,采用湖北省X市五条不同公交线路的车程时间数据集进行预测实验.实验结果表明:所设计的多任务学习预测模型能够有效实现对区域内多条公交线路的车程时间的预测,且建模资源消耗少于对每条公交线路单独建立预测模型的总和,对于每条公交线路车程时间的预测精度也优于对每条线路建立的单任务预测模型.

关键词：区域调度多条公交线路多任务学习公交车程时间预测模型

在线全文

学校读者我要写书评

暂无评论

基于区域划分的地铁网络脆弱性评价方法

系统工程学报 2018年第3期33卷 289-297,307页

作者：沈吟东宫剑华中科技大学自动化学院图像信息处理与智能控制教育部重点实验室湖北武汉430074

结合地铁网络的拓扑结构和运营客流分布的特点,提出了基于区域划分的地铁网络脆弱性评价方法,其中分别定义了站点、路段和区域的脆弱值计算公式.由于区域脆弱值与区域划分密切相关,因此进一步设计了两种区域划分方法.一种是站点聚合法,... 详细信息

结合地铁网络的拓扑结构和运营客流分布的特点,提出了基于区域划分的地铁网络脆弱性评价方法,其中分别定义了站点、路段和区域的脆弱值计算公式.由于区域脆弱值与区域划分密切相关,因此进一步设计了两种区域划分方法.一种是站点聚合法,侧重于反映地铁网络区域的结构脆弱性,其基本思路是以脆弱值高的站点为中心,迭代聚合与之耦合度高的站点进而形成脆弱区域;另一种是路段剔除法,侧重于反映客流分布对地铁网络脆弱性的影响,其基本思路是对给定的一个区域逐步从中剔除脆弱值低的线路实现区域划分.最后,利用一个现实的城市地铁系统验证评价方法的有效性.

关键词：地铁网络脆弱性评价区域划分拓扑结构运营客流分布

An Integrated Mathematical Model for Optimizing the Component Placement Process with a Multi-heads Placement Machine

在线全文

学校读者我要写书评

暂无评论

An Integrated Mathematical Model for Optimizing the Componen...

第二十九届中国控制会议

作者： CHEN Shijun,shen yindong Department of Control Science and Engineering,Huazhong University of Science and Technology,Wuhan 430074,P.R.China

The placement machine with multi-heads is broadly applied in practice and is generally much more efficient than the machine with a single head on placing components on Printed Circuit Boards（PCBs）.However,the formation of a placement process using a machine with multi-heads becomes very *** component placement problem with multi-heads machine is known to be NP-hard and is usually solved by solving two sub-problems:feeders arrangement problem and components sequencing problems in ***,the optimization is *** solve the problem more effectively,an integrated mathematical model is proposed in this paper,which can represent the problem *** the model,both the assignments of all feeder slots and orders of all components to be placed are treated as variables while the whole process is regarded as a series of picking-up and placing *** show that the proposed model is efficient and applicable to solving the placement problem with multi-heads.

关键词： Multi-heads placement machine Component sequencing Feeder arrangement Mathematical model

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

公共交通驾驶员调度研究综述

运筹学学报 2021年第1期25卷 1-16页

作者：沈吟东钱壮李媛媛华中科技大学人工智能与自动化学院图像信息处理与智能控制教育部重点实验室武汉430074

公共交通驾驶员调度是公共交通运营企业必不可少的核心业务之一,自20世纪60年代起就受到企业界和学术界的广泛重视,并且一直是公共交通研究领域的热点课题之一。首先阐述驾驶员调度问题与数学模型;然后对现有的驾驶员调度研究成果进行... 详细信息

公共交通驾驶员调度是公共交通运营企业必不可少的核心业务之一,自20世纪60年代起就受到企业界和学术界的广泛重视,并且一直是公共交通研究领域的热点课题之一。首先阐述驾驶员调度问题与数学模型;然后对现有的驾驶员调度研究成果进行归纳分析,总结出主要求解模式,并且根据驾驶员调度问题研究的历史发展,对驾驶员调度方法进行综述;最后展望未来的趋势和研究方向。

关键词：驾驶员调度公共交通整数规划智能优化综述

在线全文

学校读者我要写书评

暂无评论

基于层次分析法的地铁站点脆弱性评价

武汉理工大学学报（信息与管理工程版） 2016年第5期38卷 519-523页

作者：宫剑沈吟东华中科技大学自动化学院湖北武汉430074

针对地铁网络的脆弱性分析,利用地铁拓扑结构和运营客流分布,提出一个基于层次分析法的站点脆弱性评价方法。首先建立了由干扰因子、脆弱点和脆弱元件构成的地铁网络脆弱链模型;然后从地铁拓扑结构和运营客流分布角度,对站点脆弱性进行... 详细信息

针对地铁网络的脆弱性分析,利用地铁拓扑结构和运营客流分布,提出一个基于层次分析法的站点脆弱性评价方法。首先建立了由干扰因子、脆弱点和脆弱元件构成的地铁网络脆弱链模型;然后从地铁拓扑结构和运营客流分布角度,对站点脆弱性进行定量分析,并应用层次分析法自动选择脆弱站点;最后通过实例验证了该评价方法的有效性。

关键词：地铁网络脆弱性评价层次分析法拓扑结构运营客流分布