Combining Von Neumann Neighborhood Topology with Approximate-Mapping Local Search for ABC-Based Service Composition

Min, Xunyou; Xu, Xiaofei; Wang, Zhongjie

doi:10.1109/scc.2014.33

Cited by 12 publications

(10 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Instead, most reviewed ASC approaches only concentrate on one nonfunctional consideration, and the most widely studied nonfunctional consideration in ASC research is the QoS. Pure QoS-based service selection approaches, such as [27], [28], [31], [39], [71], [72], [77], [79], [80], [81], [91], [92], [93], [94], [95], [96], [97], and [98], only require the QoS information that is relevant to their available component services. Consequently, their SD formulation only needs to contain one composite tuple Q (QoS), and its child elements vary from approach to approach.…”

Section: Generic Tuple-based Sd Modelmentioning

confidence: 99%

An Overview and Classification of Service Description Approaches in Automated Service Composition Research

Fanjiang

Syu

et al. 2017

IEEE Trans. Serv. Comput.

View full text Add to dashboard Cite

In recent years, automated service composition has been a fervid research area in service computing. Within this area, service description plays a crucial role in terms of the development of a diverse number of automation schemes. In this paper, we provide an investigation and classification of the service description approaches that have been used in a diverse collection of automated service composition studies. To position the service description approaches used in automated service composition throughout the service description world and to clearly classify them, we propose five two-value dimensions. Using the proposed dimensions, we first perform a categorization and provide a simple introduction to current representative industrial service description standards. Subsequently, because we discovered that most of the studied automated composition approaches follow a tuple-based service description paradigm, an exhaustive classification and discussion of this paradigm is made, with the automated composition approaches adopting this paradigm as an example. Finally, we discuss issues that are currently relevant to the service description field and possible solutions. With this study, the reader can obtain a complete understanding of service description approaches used in automated service composition research, including their common formulation and assumptions.

show abstract

Section: Generic Tuple-based Sd Modelmentioning

confidence: 99%

An Overview and Classification of Service Description Approaches in Automated Service Composition Research

Fanjiang

Syu

et al. 2017

IEEE Trans. Serv. Comput.

View full text Add to dashboard Cite

show abstract

“…Distance is calculated using Manhattan metrics [25] with Von Neumann neighbourhood [26]. In practice, that means that every cell in a maze has only four neighbouring cells (north, east, south, and west).…”

Section: Ev3 Virtual Environment Applicationmentioning

confidence: 99%

Cognitive Agents and Learning Problems

Zaharija¹,

Mladenović²,

Dunić³

2017

IJISA

View full text Add to dashboard Cite

Abstract-Goals, Operators, Methods, and Selection rules (GOMS) model is a widely recognised concept in Human-Computer Interaction (HCI). Since the initial idea, several GOMS techniques were developed that were used for analysis, differing in their form defined by the logical structure and prediction power. Through defined operators and methods and following the certain rules, the user can reach a specific goal. This work represents an effort to apply GOMS method in the field of artificial intelligence, specifically on a state-space search problems. Card, Morgan, Newman GOMS (CMN-GOMS) model has been chosen, since it represents ground-floor of the GOMS idea that solves the given task through a sequence of operators. Compared with the informed search algorithms for solving the given task, CMN-GOMS model gave better results. Moreover, it was shown that this model could be used in any other space motion problem in the natural environment. LEGO® MINDSTORMS® EV3 robot was used to demonstrate the application of GOMS model in real world pathfinding problems and as a test-bed for comparing proposed model with well-known search algorithms.

show abstract

“…Chen proposes a method based on QoS and PSO [18]. Wang et al improves the Artificial Bee Colony (ABC) algorithm [19,20].…”

Section: Related Workmentioning

confidence: 99%

“…In addition, each candidate service has five QoS indicators, namely response time, price, availability, reputation and throughput, and the value ranges of the five indicators are [1,10], [20, [1,20] respectively. The requirements raised by users are QoS constraints.…”

Section: Figure4 Web Service Composition Workflowmentioning

confidence: 99%

See 1 more Smart Citation

Web Services Optimal Composition Based on Improved Artificial Bee Colony Algorithm With the Knowledge of Service Domain Features

Liu¹

2016

STSC

View full text Add to dashboard Cite

Web service composition is a key technology for creating value-added services by integrating available services. With the rapid development of Service Computing, Cloud Computing, Big Data and Internet of Things, a fast increasing number of services with similar functionalities but different Quality of Service (QoS) are available on the Internet, and make Web service optimal composition a NP-hard problem. Meanwhile, over the last decade's development and evolution of the service industries, service domain features (such as priori and similarity of services) are gradually formed. These features have valuable domain knowledge for improving Web service optimal composition. However, existing research works on Web service composition don't make full use of the service domain features, and leading to unfavorable results. Therefore, how to improve the efficiency and effectiveness of Web service optimal composition with the knowledge of service domain features becomes a significant challenge. To attack this issue, this paper firstly analyzes the influences of service domain features on Web service optimal composition; then, improves key optimization strategies of ABC with the knowledge of service domain features; finally, proposes the Web service optimal composition method based on improved artificial bee colony algorithm (S-ABCSC). The performance of S-ABCSC is verified through simulation experiment; Moreover, the underlying dependencies between service domain features and S-ABCSC's optimality are analyzed and S-ABCSC's parameter settings are determined through several experiments with different service usage data sets.

show abstract

Combining Von Neumann Neighborhood Topology with Approximate-Mapping Local Search for ABC-Based Service Composition

Cited by 12 publications

References 13 publications

An Overview and Classification of Service Description Approaches in Automated Service Composition Research

An Overview and Classification of Service Description Approaches in Automated Service Composition Research

Cognitive Agents and Learning Problems

Web Services Optimal Composition Based on Improved Artificial Bee Colony Algorithm With the Knowledge of Service Domain Features

Contact Info

Product

Resources

About