Considering that the vehicle routing problem （VRP） with many extended features is widely used in actual life, such as multi-depot, heterogeneous types of vehicles, customer service priority and time windows etc., a ...Considering that the vehicle routing problem （VRP） with many extended features is widely used in actual life, such as multi-depot, heterogeneous types of vehicles, customer service priority and time windows etc., a mathematical model for multi-depot heterogeneous vehicle routing problem with soft time windows （MDHVRPSTW） is established. An improved ant colony optimization （IACO） is proposed for solving this model. First, MDHVRPSTW is transferred into different groups according to the nearest principle, and then the initial route is constructed by the scanning algorithm （SA）. Secondly, genetic operators are introduced, and crossover probability and mutation probability are adaptively adjusted in order to improve the global search ability of the algorithm. Moreover, the smooth mechanism is used to improve the performance of the ant colony optimization （ACO）. Finally, the 3-opt strategy is used to improve the local search ability. The proposed IACO was tested on three new instances that were generated randomly. The experimental results show that IACO is superior to the other three existing algorithms in terms of convergence speed and solution quality. Thus, the proposed method is effective and feasible, and the proposed model is meaningful.展开更多
We present a discrete time single-server two-level mixed service polling systems with two queue types, one center queue and N normal queues. Two-level means the center queue will be successive served after each normal...We present a discrete time single-server two-level mixed service polling systems with two queue types, one center queue and N normal queues. Two-level means the center queue will be successive served after each normal queue. In the first level, server visits between the center queue and the normal queue. In the second level, normal queues are polled by a cyclic order. Mixed service means the service discipline are exhaustive for center queue, and parallel 1-limited for normal queues. We propose an imbedded Markov chain framework to drive the closed-form expressions for the mean cycle time, mean queue length, and mean waiting time. Numerical examples demonstrate that theoretical and simulation results are identical the new system efficiently differentiates priorities.展开更多
高速串行现场总线(controller area network,简称CAN)被广泛部署到机器人通信系统中.而服务机器人任务具有并发性和高实时性的特点,因此,如何根据总线协议规范和应用需求精化设计模型,保证系统设计的正确性和实时性要求,避免设计阶段的...高速串行现场总线(controller area network,简称CAN)被广泛部署到机器人通信系统中.而服务机器人任务具有并发性和高实时性的特点,因此,如何根据总线协议规范和应用需求精化设计模型,保证系统设计的正确性和实时性要求,避免设计阶段的漏洞十分必要.针对传统方法的局限性,提出使用形式化方法对基于CAN现场总线型控制系统进行建模分析.首先,对系统进行模型抽象和形式表达;其次进行形式建模和自动验证,在UPPAAL中实现主控制器、关节控制器、收发器、仲裁器和CAN总线的时间自动机模型;最后对机器人通信系统进行正确性验证和实时性分析.实时性分析发现:随着总线上关节节点数的增多,低优先级节点的最坏仲裁时延的增长速率加大.针对这个问题,在形式模型中加入了改进的动态优先级策略.实验结果表明:部署动态优先级策略后不仅减小了低优先级节点的仲裁时延,而且还可以加大CAN总线的节点负载量,为系统设计提供有效的指导和参考.展开更多
基金The National Natural Science Foundation of China(No.61074147)the Natural Science Foundation of Guangdong Province(No.S2011010005059)+2 种基金the Foundation of Enterprise-University-Research Institute Cooperation from Guangdong Province and Ministry of Education of China(No.2012B091000171,2011B090400460)the Science and Technology Program of Guangdong Province(No.2012B050600028)the Science and Technology Program of Huadu District,Guangzhou(No.HD14ZD001)
文摘Considering that the vehicle routing problem （VRP） with many extended features is widely used in actual life, such as multi-depot, heterogeneous types of vehicles, customer service priority and time windows etc., a mathematical model for multi-depot heterogeneous vehicle routing problem with soft time windows （MDHVRPSTW） is established. An improved ant colony optimization （IACO） is proposed for solving this model. First, MDHVRPSTW is transferred into different groups according to the nearest principle, and then the initial route is constructed by the scanning algorithm （SA）. Secondly, genetic operators are introduced, and crossover probability and mutation probability are adaptively adjusted in order to improve the global search ability of the algorithm. Moreover, the smooth mechanism is used to improve the performance of the ant colony optimization （ACO）. Finally, the 3-opt strategy is used to improve the local search ability. The proposed IACO was tested on three new instances that were generated randomly. The experimental results show that IACO is superior to the other three existing algorithms in terms of convergence speed and solution quality. Thus, the proposed method is effective and feasible, and the proposed model is meaningful.
基金Supported by the National Natural Science Foundation of China (No. 61072079)Science Foundation of Yunnan Provincial Department (No. 2011Y117)
文摘We present a discrete time single-server two-level mixed service polling systems with two queue types, one center queue and N normal queues. Two-level means the center queue will be successive served after each normal queue. In the first level, server visits between the center queue and the normal queue. In the second level, normal queues are polled by a cyclic order. Mixed service means the service discipline are exhaustive for center queue, and parallel 1-limited for normal queues. We propose an imbedded Markov chain framework to drive the closed-form expressions for the mean cycle time, mean queue length, and mean waiting time. Numerical examples demonstrate that theoretical and simulation results are identical the new system efficiently differentiates priorities.
文摘高速串行现场总线(controller area network,简称CAN)被广泛部署到机器人通信系统中.而服务机器人任务具有并发性和高实时性的特点,因此,如何根据总线协议规范和应用需求精化设计模型,保证系统设计的正确性和实时性要求,避免设计阶段的漏洞十分必要.针对传统方法的局限性,提出使用形式化方法对基于CAN现场总线型控制系统进行建模分析.首先,对系统进行模型抽象和形式表达;其次进行形式建模和自动验证,在UPPAAL中实现主控制器、关节控制器、收发器、仲裁器和CAN总线的时间自动机模型;最后对机器人通信系统进行正确性验证和实时性分析.实时性分析发现:随着总线上关节节点数的增多,低优先级节点的最坏仲裁时延的增长速率加大.针对这个问题,在形式模型中加入了改进的动态优先级策略.实验结果表明:部署动态优先级策略后不仅减小了低优先级节点的仲裁时延,而且还可以加大CAN总线的节点负载量,为系统设计提供有效的指导和参考.
