检索结果-内蒙古大学图书馆

Multi-objective new product development by complete Pareto front and ripple-spreading algorithm

NEUROCOMPUTING 2014年 142卷 4-15页

作者： Hu, Xiao-Bing Wang, Ming Ye, Qian Han, Zhangang Leeson, Mark S. Beijing Normal Univ State Key Lab Earth Surface Proc & Resource Ecol Beijing 100875 Peoples R China Beijing Normal Univ Sch Syst Sci Beijing 100875 Peoples R China Univ Warwick Sch Engn Coventry CV4 7AL W Midlands England

Given several different new product development projects and limited resources, this paper is concerned with the optimal allocation of resources among the projects. This is clearly a multi-objective optimization problem (MOOP), because each new product development project has both a profit expectation and a loss expectation, and such expectations vary according to allocated resources. In such a case, the goal of multi-objective new product development (MONPD) is to maximize the profit expectation while minimizing the loss expectation. As is well known, Pareto optimality and the Pareto front are extremely important to resolve MOOPs. Unlike many other MOOP methods which provide only a single Pareto optimal solution or an approximation of the Pareto front, this paper reports a novel method to calculate the complete Pareto front for the MONPD. Some theoretical conditions and a ripple-spreading algorithm together play a crucial role in finding the complete Pareto front for the MONPD. Simulation results illustrate that the reported method, by calculating the complete Pareto front, can provide the best support to decision makers in the MONPD. (C) 2014 Elsevier B.V. All rights reserved.

关键词： Multi-objective optimization New product development Pareto front ripple-spreading algorithm

来源：评论

学校读者我要写书评

暂无评论

Co-Evolutionary path optimization by ripple-spreading algorithm

引用

TRANSPORTATION RESEARCH PART B-METHODOLOGICAL 2017年 106卷 411-432页

作者： Hu, Xiao-Bing Zhang, Ming-Kong Zhang, Qi Liao, Jian-Qin Civil Aviat Univ China Tianjin Key Lab Adv Signal Proc Tianjin Peoples R China Beijing Normal Univ Acad Disaster Reduct & Emergence Management Beijing Peoples R China Civil Aviat Univ China Teaching & Learning Dev Ctr Tianjin Peoples R China Chengdu MiidShare Technol Ltd Chengdu Sichuan Peoples R China

Static path optimization (SPO) is a foundation of computational intelligence, but in reality, the routing environment is usually time-varying (e.g., moving obstacles, spreading disasters and uncertainties). Thanks to scientific and technical advances in many relevant domains nowadays, changes in the routing environment are often more or less predictable. This study mainly focuses on path optimization in a given dynamic routing environment (POGDRE). A common practice to deal with dynamic routing environment is to conduct online re-optimization (OLRO), i.e., at each time t, environmental parameters are measured/predicted first, and then the best path is re-calculated by resolving SPO based on the newly measured/predicted environmental parameters. In theory, POGDRE is equivalent to time-dependent path optimization (TDPO), which is usually resolved as SPO on a time expanded hypergraph (TEHG) with a significantly enlarged size. In other words, during a single online run of OLRO-based methods or a single run of TEHG-based methods, the route network is actually fixed and static. Inspired by the multi-agent co-evolving nature reflected in many methods of evolutionary computation, this paper proposes a methodology of co-evolutionary path optimization (CEPO) to resolve the POGDRE. Distinguishing from OLRO and TEHG methods, in CEPO, future routing environmental parameters keep changing during a single run of optimization on a network of original size. In other words, the routing environment co-evolves with the path optimization process within a single run. This paper then reports a ripple-spreading algorithm (RSA) as a realization of CEPO to resolve the POGDRE with both optimality and efficiency. In just a single run of RSA, the optimal actual travelling trajectory can be achieved in a given dynamic routing environment. Simulation results clearly demonstrate the effectiveness and efficiency of the proposed CEPO and RSA for addressing the POGDRE. (C) 2017 Elsevier Ltd. All righ

关键词： Co-evolution Path optimization Agent-based model ripple-spreading algorithm

来源：评论

学校读者我要写书评

暂无评论

Integrated optimization for shelter service area demarcation and evacuation route planning by a ripple-spreading algorithm

引用

INTERNATIONAL JOURNAL OF DISASTER RISK REDUCTION 2017年 24卷 539-548页

作者： Hu, Fuyu Yang, Saini Hu, Xiaobing Wang, Weiping Beijing Normal Univ Key Lab Environm Change & Nat Disaster Minist Educ Beijing Peoples R China Beijing Normal Univ State Key Lab Earth Surface Proc & Resource Ecol Beijing Peoples R China Beijing Normal Univ Acad Disaster Reduct & Emergency Management Minist Civil Affairs Beijing Peoples R China Beijing Normal Univ Minist Educ Beijing Peoples R China Beijing Normal Univ 19 XinJieKouWai St Beijing 100875 Peoples R China

Shelter is one type of emergency facilities and plays a critical role in disaster response. In operation level, a shelter is the destination of post-disaster evacuation route, whose scientific service area demarcation can have a great positive influence on evacuation route planning. Effective evacuation route planning can also validate and support the service area demarcation of shelter. This study aims to optimize shelter service area demarcation and post-disaster evacuation route planning simultaneously in order to improve the efficiency of current shelter operation and further reduce disaster risk, which is seldom addressed before. We proposed an integrated optimization model for jointly solving shelter service area demarcation and evacuation route planning problems, which keeps contiguity of service areas, ensures an evacuation route within the same service district, shortens the evacuation route, satisfies capacity constraints and maintains integrity. To solve the problem, a ripple-spreading algorithm is adopted with combining contiguity and capacity operators. A real-world case study was conducted in the Chaoyang district of Beijing, China. A locally optimal scheme for service area demarcation and evacuation route planning was obtained with satisfying constraints as much as possible, which confirm the validity of ripple-spreading algorithm application in the joint problem.

关键词： Emergency shelter Service area demarcation Evacuation route planning ripple-spreading algorithm

来源：评论

学校读者我要写书评

暂无评论

A ripple-spreading algorithm for Network Performance Assessment

A Ripple-Spreading Algorithm for Network Performance Assessm...

引用

IEEE Symposium Series on Computational Intelligence (IEEE SSCI)

作者： Hu, Xiao-Bing Zhang, Ming-Kong Liao, Jian-Qin Beijing Normal Univ Acad Disaster Reduct & Emergence Management Beijing Peoples R China Chengdu MiidShare Technol Ltd Chengdu Peoples R China

ISBN: (纸本)9781509042401

To assess the performance of a network system against disturbances, existing methods are usually concerned with two different extreme situations: (i) how likely the system will degrade into some separated sub-graphs because of disturbances;(ii) how likely the 1st best paths will be cut off by disturbances. However, a more general situation, i.e., how likely those paths whose lengths are within a given range will be affected by disturbances, is barely discussed. Basically, to address this general situation, all (not just a proportion) of those paths whose lengths are within the given range must be found out between all pairs of origin and destination (OD) of interest. Unfortunately, no effective method has ever been reported to accomplish this task, although there are many methods capable of calculating all the 1st best paths between all OD pair of interest. This paper, for the first time, attempts to address the above general situation of network performance assessment. To this end, a novel ripple-spreading algorithm (RSA) is proposed to carry out a ripple relay race on the network, in order to identify all of those paths whose lengths are within the given range. Surprisingly, the proposed RSA can find all such paths between all OD pairs of interest by just a single run of ripple relay race. This work makes progress towards the general performance assessment of a network system against disturbances.

关键词： ripple-spreading algorithm network system performance assessment path optimization disturbances

来源：评论

学校读者我要写书评

暂无评论

A ripple-spreading algorithm for Route Optimization

A Ripple-Spreading Algorithm for Route Optimization

引用

IEEE Symposium on Foundations of Computational Intelligence (FOCI)

作者： Hu, Xiao-Bing Wang, Ming Sun, Qiong Leeson, Mark S. Di Paolo, Ezequiel Beijing Normal Univ State Key Lab Earth Surface Proc & Resource Ecol Beijing 100875 Peoples R China Beijing Union Univ Tourism Inst Beijing Peoples R China Univ Warwick Sch Engn Coventry CV4 7AL W Midlands England Univ Basque Country Ikerbasque San Sebastian Spain

ISBN: (纸本)9781467359016

Inspired by the natural ripple-spreading phenomenon that occur on a water surface, this paper proposes a novel route optimization method: the ripple-spreading algorithm (RSA). In nature, a ripple spreads at a constant speed in all directions, and the node closest to the source will be the first to be reached. This very simple principle forms the foundation of the proposed RSA. An initial ripple starts from the source, and triggers new ripples at other nodes as it spreads out. A new ripple can also trigger ripples at nodes farther away, until the destination is reached. Then the first ripple that reaches the destination determines the shortest route. Unlike search-and-test algorithms, such as evolutionary algorithms, the RSA is a deterministic method that can always guarantee the global optimal solution with a very good scalability. The RSA is particularly compared with two of the most well-known route optimization algorithms, and the experimental results clearly illustrate the advantages of the RSA reported in this paper in terms of efficiency and effectiveness.

关键词： ripple-spreading algorithm route planning optimization

来源：评论

学校读者我要写书评

暂无评论

Co-Evolutionary Path Optimization by ripple-spreading algorithm

Co-Evolutionary Path Optimization by Ripple-Spreading Algori...

引用

IEEE Congress on Evolutionary Computation (CEC) held as part of IEEE World Congress on Computational Intelligence (IEEE WCCI)

作者： Hu, Xiao-Bing Liao, Jian-Qin Beijing Normal Univ Acad Disaster Reduct & Emergence Beijing Peoples R China Chengdu MiidShare Technol Ltd Chengdu Peoples R China

ISBN: (纸本)9781509006229

Inspired by the multi-agent co-evolving nature reflected in many methods of evolutionary computation, this paper proposes a challenging routing problem - co-evolutionary path optimization (CEPO). Static path optimization (SPO) is a foundation of computational intelligence, but in reality, the routing environment is usually time-varying (e.g., moving obstacles, spreading disasters and uncertainties), and therefore dynamic path optimization (DPO) has to be addressed. To resolve DPO, a common practice is as following: at each time t, environmental parameters are measured/predicted first, and then the best path is re-calculated by resolving SPO based on the newly measured/predicted environmental parameters. In other words, during the path optimization process of time t, the routing environment is actually fixed and static. Usually, DPO cannot lead to optimal actual travelling trajectory, and it demands high online computation capacity. Distinguishing from DPO, in CEPO, future environmental parameters keep changing during the optimization process of time t. In other words, the routing environment co-evolves within the path optimization process of time t. No existing method can address CEPO without losing optimality or efficiency. This paper then reports a ripplespreading algorithm (RSA), which can resolve CEPO with both optimality and efficiency. Surprisingly, in just a single offline run of RSA for the CEPO, the optimal actual travelling trajectory can be achieved in a given dynamical routing environment. Simulation results clearly demonstrate that: (i) the solutions to CEPO are far better than those to DPO, and (ii) the reported RSA is an effective and efficient method for addressing CEPO.

关键词： Co-Evolution Path Optimization Agent-Based Model ripple-spreading algorithm

来源：评论

学校读者我要写书评

暂无评论

Improving the Computational Efficiency of ripple-spreading algorithm for the k Shortest Paths Problem

Improving the Computational Efficiency of Ripple-Spreading A...

引用

IEEE Congress on Evolutionary Computation (CEC) held as part of IEEE World Congress on Computational Intelligence (IEEE WCCI)

作者： Hu, Xiao-Bing Zhang, Ming-Kong Hu, Di Beijing Normal Univ Acad Disaster Reduct & Emergence Management Beijing Peoples R China Cent Univ Finance & Econ Sch Stat Beijing Peoples R China

ISBN: (纸本)9781509006229

The k shortest paths problem (k-SPP) has a wide application background. Inspired by the natural ripple-spreading phenomenon that occurs on a water surface, we have recently proposed an original ripple-spreading algorithm (RSA) for the k-SPP. However, the computational efficiency of the reported algorithm is poor. This paper is concerned with how to improve the scalability of RSA for the k-SPP. To this end, two methods are proposed in this study. One is to impose an upper bound of k as the maximal number of ripples a node may generate. The other is to start ripple relay race from both the source and the destination simultaneously. Some theoretical analyses on the optimality and time complexity of improved RSA for the k-SPP are given. Surprisingly, the improved RSA can be extended from one-to-one k-SPP to one-to-all k-SPP, with no increase in computational complexity. The experimental results demonstrate the effectiveness and efficiency of the proposed methods.

关键词： k Shortest Paths Problem ripple-spreading algorithm Optimization Computational Efficiency

来源：评论

学校读者我要写书评

暂无评论

A ripple-spreading algorithm for the k Shortest Paths Problem

A Ripple-Spreading Algorithm for the <i>k</i> Shortest Paths...

引用

3rd Global Congress on Intelligent Systems (GCIS)

作者： Hu, Xiao-Bing Wang, Ming Hu, Xiao-Bing Leeson, Mark S. Hines, Evor L. Hu, Di Di Paolo, Ezequiel Beijing Normal Univ State Key Lab Earth Surface Proc & Resource Ecol Beijing 100875 Peoples R China Univ Warwick Sch Engn Coventry W Midlands England Cent Univ Finance & Econ Sch Stat Beijing Peoples R China Univ Basque Country Ikerbasque San Sebastian Spain

ISBN: (纸本)9781467330725;9780769548609

Inspired by the natural ripple-spreading phenomenon that occurs on a water surface, this paper proposes a novel ripple-spreading algorithm (RSA) for the k shortest paths problem (k-SPP). In nature, a ripple spreads at a constant speed in all directions, and the node closest to the source will be the first to be reached. This very simple principle forms the foundation of the proposed RSA. By mimicking the natural ripple-spreading phenomenon, the new algorithm starts an initial ripple from the source, and initial ripple triggers new ripples at other nodes as it spreads out. A new ripple can also trigger ripples at nodes farther away, until the destination is reached by k ripples. Then the kth ripple that reaches the destination determines the kth shortest path. The comparative experimental results illustrate the effectiveness and efficiency of the proposed algorithm.

关键词： k Shortest Paths Problem ripple-spreading algorithm Optimization

来源：评论

学校读者我要写书评

暂无评论

An Approximate ripple-spreading algorithm to Identify the k Best Paths 13

An Approximate Ripple-Spreading Algorithm to Identify the <i...

引用

13th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD)

作者： Hu, Xiao-Bing Zhang, Ming-Kong Hu, Di Civil Aviat Univ China Tianjin Key Lab Adv Signal Proc Tianjin Peoples R China Beijing Normal Univ Fac Geog Sci Acad Disaster Reduct & Emergence Management Beijing Peoples R China Cent Univ Finance & Econ Sch Stat Beijing Peoples R China

ISBN: (纸本)9781538621653

As a newly reported nature-inspired algorithm, ripple-spreading algorithm (RSA) can resolve the k shortest paths problem (k-SPP) with a guarantee of optimality and a just-so-so computational efficiency, given each node can be triggered to produce up to k ripples. This paper reports an approximate RSA by allowing every node to produce no more than h ripples, 1 <= h

关键词： k Shortest Paths Problem ripple-spreading algorithm Optimization Approximation

来源：评论

学校读者我要写书评

暂无评论

A ripple-spreading algorithm for Calculating Weighted Betweenness in Networks 13

A Ripple-Spreading Algorithm for Calculating Weighted Betwee...

引用

13th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD)

作者： Hu, Xiao-Bing Zhang, Ming-Kong Liao, Jian-Qin Civil Aviat Univ China Tianjin Key Lab Adv Signal Proc Tianjin Peoples R China Beijing Normal Univ Acad Disaster Reduct & Emergence Management Fac Geog Sci Beijing Peoples R China Chengdu MiidShare Technol Ltd Chengdu Sichuan Peoples R China

ISBN: (纸本)9781538621653

ripple-spreading algorithm (RSA) is a relatively new nature-inspired method. On one hand, it is important to compare RSA with relevant existing methods on some classical problems. On the other hand, it is useful to explore the potential of RSA to resolve some problems which existing methods pay little attention to or can hardly deal with. This paper aims to apply RSA to the study of weighted betweenness in networks. Betweenness is an important property of networks, and the traditional definition of betweenness focuses on those 1st shortest paths between all node pairs. Differently, this paper proposes weighted betweenness, which demands the information of all of those suitable paths whose length is within certain given ranges between all node pairs. Weighted betweenness has a more realistic application background, but it has rarely been investigated in research literature, largely because there lack effective methods to find the information of all suitable paths between all node pairs, particularly for large-scale networks. This paper modifies and extends RSA to calculate weighted betweenness in networks, in order to demonstrate the potential capability of RSA beyond those existing methods. Experimental results based on various kinds of networks clearly show that (i) weighted betweenness is different from traditional betweenness, and thus is worth investigation in depth, and (ii) the reported RSA can effectively calculate weighted betweenness.

关键词： ripple-spreading algorithm weighted betweenness network system path optimization disturbances

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：