scholarly journals Binary PSO for Web Service Location-Allocation

2016 ◽  
pp. 366-377 ◽  
Author(s):  
Boxiong Tan ◽  
Hai Huang ◽  
Hui Ma ◽  
Mengjie Zhang
Keyword(s):  
Web Service ◽  
Location Allocation ◽  
Binary Pso ◽  
Service Location

scholarly journals Fire service location-allocation models

1972 ◽  
Author(s):  
Donald Colner ◽  
David Gilsinn
Keyword(s):  
Fire Service ◽  
Location Allocation ◽  
Service Location

Spatial Service Location-Allocation Analysis for Siting Recycling Depots

2013 ◽  
Vol 139 (8) ◽  
pp. 1035-1041
Author(s):  
Jehng-Jung Kao ◽  
Yung-Tai Tsai ◽  
You-Ti Huang
Keyword(s):  
Location Allocation ◽  
Service Location

A Service Publishing and Service Location Algorithm for Internet of Things

2013 ◽  
Vol 433-435 ◽  
pp. 1581-1587
Author(s):  
Shu Ren Zhu
Keyword(s):  
Web Service ◽  
Service Discovery ◽  
Dynamic Change ◽  
Two Phase ◽  
Web Service Discovery ◽  
Hierarchy Model ◽  
Abstract Level ◽  
Data Source ◽  
Location Algorithm ◽  
Service Location

The designation idea and the hierarchy model for the WSDS based on double hierarchy topology have been described. In order to support QoS-based Web services publish and discovery, the QoS broker mechanism is introduced into the traditional Web service discovery model. On the basis of these, according to the characteristics of QoS requirements of different users, a QoS-based Web service discovery algorithm is proposed. Put forward dynamic tuple model, give two-phase service location algorithm adapting double hierarchy topology network, and then compare and test with the correlative work of UDDI. Hierarchy model is introduced to defining dynamic tuple model in the data-level for resolving the heterogeneity between diversified data source and data modal. The unified publish and query API customized to implement unified accessing mode in the abstract level. The scalability, agility and robustness of the WSDS are assured by a double hierarchy topology structure. The experiment result indicate, double hierarchy topology system has obvious self-organization and well scalability, and adopt to the independence of web service, dynamic change and strong distributing, at one time, two-phase service location algorithm has well abilities of service location.

Gifts from the Web: Service Learning

2005 ◽  
Vol 8 (1) ◽  
pp. 16-18
Author(s):  
Howard F. Wilson
Keyword(s):  
Service Learning ◽  
Web Service ◽  
The Web

Fuzzy multi-objective location and routing problem

2020 ◽  
Vol 39 (3) ◽  
pp. 3259-3273
Author(s):  
Nasser Shahsavari-Pour ◽  
Najmeh Bahram-Pour ◽  
Mojde Kazemi
Keyword(s):  
Firefly Algorithm ◽  
High Reliability ◽  
Research Area ◽  
Nsga Ii ◽  
Location Routing Problem ◽  
Routing Problem ◽  
Location Allocation ◽  
Multi Objective ◽  
Location Routing ◽  
The Cost

The location-routing problem is a research area that simultaneously solves location-allocation and vehicle routing issues. It is critical to delivering emergency goods to customers with high reliability. In this paper, reliability in location and routing problems was considered as the probability of failure in depots, vehicles, and routs. The problem has two objectives, minimizing the cost and maximizing the reliability, the latter expressed by minimizing the expected cost of failure. First, a mathematical model of the problem was presented and due to its NP-hard nature, it was solved by a meta-heuristic approach using a NSGA-II algorithm and a discrete multi-objective firefly algorithm. The efficiency of these algorithms was studied through a complete set of examples and it was found that the multi-objective discrete firefly algorithm has a better Diversification Metric (DM) index; the Mean Ideal Distance (MID) and Spacing Metric (SM) indexes are only suitable for small to medium problems, losing their effectiveness for big problems.

Sign in / Sign up

Export Citation Format

Share Document