通过构建整数线性规划(ILP)来计算网络的能耗,求解ILP的解需要的计算机内存空间大,但内存不足仍然是需要考虑的问题之一。针对这一问题,提出了一种基于K算法来设计绿色IP over WDM网络的方法,该方法是基于传统的虚拓扑网络业务疏导方法...通过构建整数线性规划(ILP)来计算网络的能耗,求解ILP的解需要的计算机内存空间大,但内存不足仍然是需要考虑的问题之一。针对这一问题,提出了一种基于K算法来设计绿色IP over WDM网络的方法,该方法是基于传统的虚拓扑网络业务疏导方法,首先利用K算法求解网络中节点与节点之间的K条可能路径,然后通过构建整数线性规划(ILP)来求解网络资源的分布。分析网络能耗的模型,利用数学表达式来描述基于K算法下3种IP over WDM网络的能耗。展开更多
针对IP over WDM网络,建立了整数线性规划(ILP)最小功耗模型,计算了满足峰值业务需要开启的设备数目;对于低峰业务提出休眠机制,分别利用最小光路数算法与最小跳数算法,在保证连接无阻塞的情况下找出空闲设备,对比峰值业务得到不同算法...针对IP over WDM网络,建立了整数线性规划(ILP)最小功耗模型,计算了满足峰值业务需要开启的设备数目;对于低峰业务提出休眠机制,分别利用最小光路数算法与最小跳数算法,在保证连接无阻塞的情况下找出空闲设备,对比峰值业务得到不同算法下的设备使用率,确定IP over WDM网络的节能潜力。结果表明,ILP优化模型的网络功耗最小,最小光路数算法次之;低峰业务下利用休眠机制可以关闭设备的比例占40%～60%;采用最小光路数算法的休眠机制节能效果较优。展开更多
In this paper, we present a multiobjective approach for solving the one-way car relocation problem.We fix three objectives that include the number of remaining rejected demands, the number of jockeys used for the relo...In this paper, we present a multiobjective approach for solving the one-way car relocation problem.We fix three objectives that include the number of remaining rejected demands, the number of jockeys used for the relocation operations, and the total time used by these jockeys. For this sake, we propose to apply two algorithms namely NSGA-Ⅱ and an adapted memetic algorithm(MA) that we call MARPOCS which stands for memetic algorithm for the one-way carsharing system. The NSGA-Ⅱ is used as a reference to compare the performance of MARPOCS. The comparison of the approximation sets obtained by both algorithms shows that the hybrid algorithm outperforms the classical NSGA-Ⅱ and so solutions generated by the MARPOCS are much better than the solutions generated by NSGA-Ⅱ. This observation is proved by the comparison of different quality indicators’ values that are used to compare the performance of each algorithm. Results show that the MARPOCS is promising to generate very good solutions for the multiobjective car relocation problem in one-way carsharing system. It shows a good performance in exploring the search space and in finding solution with very good fitness values.展开更多
文摘通过构建整数线性规划(ILP)来计算网络的能耗,求解ILP的解需要的计算机内存空间大,但内存不足仍然是需要考虑的问题之一。针对这一问题,提出了一种基于K算法来设计绿色IP over WDM网络的方法,该方法是基于传统的虚拓扑网络业务疏导方法,首先利用K算法求解网络中节点与节点之间的K条可能路径,然后通过构建整数线性规划(ILP)来求解网络资源的分布。分析网络能耗的模型,利用数学表达式来描述基于K算法下3种IP over WDM网络的能耗。
文摘针对IP over WDM网络,建立了整数线性规划(ILP)最小功耗模型,计算了满足峰值业务需要开启的设备数目;对于低峰业务提出休眠机制,分别利用最小光路数算法与最小跳数算法,在保证连接无阻塞的情况下找出空闲设备,对比峰值业务得到不同算法下的设备使用率,确定IP over WDM网络的节能潜力。结果表明,ILP优化模型的网络功耗最小,最小光路数算法次之;低峰业务下利用休眠机制可以关闭设备的比例占40%～60%;采用最小光路数算法的休眠机制节能效果较优。
文摘In this paper, we present a multiobjective approach for solving the one-way car relocation problem.We fix three objectives that include the number of remaining rejected demands, the number of jockeys used for the relocation operations, and the total time used by these jockeys. For this sake, we propose to apply two algorithms namely NSGA-Ⅱ and an adapted memetic algorithm(MA) that we call MARPOCS which stands for memetic algorithm for the one-way carsharing system. The NSGA-Ⅱ is used as a reference to compare the performance of MARPOCS. The comparison of the approximation sets obtained by both algorithms shows that the hybrid algorithm outperforms the classical NSGA-Ⅱ and so solutions generated by the MARPOCS are much better than the solutions generated by NSGA-Ⅱ. This observation is proved by the comparison of different quality indicators’ values that are used to compare the performance of each algorithm. Results show that the MARPOCS is promising to generate very good solutions for the multiobjective car relocation problem in one-way carsharing system. It shows a good performance in exploring the search space and in finding solution with very good fitness values.
