The Modeling of Service Composition Path Selection Problem: Research on Linear-Structured Composed Service Routing Problem

2010 ◽  
Author(s):  
Yan-mei Zhang ◽  
Jian Wang
Keyword(s):  
Service Composition ◽  
Path Selection ◽  
Selection Problem ◽  
Routing Problem ◽  
Service Routing ◽  
Composition Path

Exact and hybrid methods for the multiperiod field service routing problem

2011 ◽  
Vol 21 (2) ◽  
pp. 359-377 ◽  
Author(s):  
Fabien Tricoire ◽  
Nathalie Bostel ◽  
Pierre Dejax ◽  
Pierre Guez
Keyword(s):  
Hybrid Methods ◽  
Routing Problem ◽  
Field Service ◽  
Service Routing

Analysis of Quality of Service Routing Algorithms

2011 ◽  
pp. 159-169
Author(s):  
E.George Dharma Prakash Raj ◽  
Sinthu Janita Prakash ◽  
S.V.Kasmir Raja
Keyword(s):  
Multicast Routing ◽  
Source Node ◽  
Destination Node ◽  
Path Delay ◽  
Quality Of Service Routing ◽  
Routing Problem ◽  
Unicast Routing ◽  
Service Routing ◽  
Feasible Path

The routing problems can be divided into two major classes. They are 1) Unicast routing and 2) Multicast routing. The Unicast routing problem is as follows. Given a source node sr, a destination node dn, a set of QoS constraints qc and an optimization goal (optional), find the best feasible path from sr to dn, which satisfies qc. The Multicast routing problem is as follows. Given a source node sr, a set st of destination nodes, a set of constraints cts and an optimization goal (optional), find the best feasible path covering sr and all nodes in st, which satisfies cts. This article presents two such Unicast QoS based algorithms called as Source Routing and the proposed Heuristic Routing. A Client Server based model has been generated to study the performance of the two algorithms with respect to the message overhead, response time and path delay. The Experiments and the results are analyzed.

scholarly journals Route and Path Choices of Freight Vehicles: A Case Study with Floating Car Data

2020 ◽  
Vol 12 (20) ◽  
pp. 8557
Author(s):  
Antonello Ignazio Croce ◽  
Giuseppe Musolino ◽  
Corrado Rindone ◽  
Antonino Vitetta
Keyword(s):  
Decision Process ◽  
Choice Model ◽  
Road Transport ◽  
Path Selection ◽  
Commercial Vehicles ◽  
Routing Problem ◽  
Floating Car Data ◽  
Choice Decision ◽  
Definition Of ◽  
Choice Set

According to the literature, the path choice decision process of a user of a (road) transport network, named path choice problem (PCP), is composed of two levels/models: the definition of perceived alternative paths (choice set) and the choice of one path in the path choice set. The path choice probability can be estimated with two models: a choice model of the path choice set and a choice model of a path (Mansky paradigm). In this research, the paper’s contribution concerns two elements: extension of the PCP paradigm (two-level models) consolidated in the literature to the route choice decision process (vehicle routing problem (VRP)) and identification of common elements in the PCP and VRP concerning the criteria in the two decision levels and the procedure for route and path selection and choice. The experiment concerns the comparison of observed routes with simulated and optimized routes of commercial vehicles to analyse the level of similarity and coverage. The observed routes are extracted from floating car data (FCD) from commercial vehicles travelling inside a study area inside the Calabria Region (Southern Italy). The comparison is executed in terms of similarity of the sequences of nodes visited between observed routes and simulated/optimized routes.

scholarly journals Time-Dependent Electric Vehicle Routing Problem with Time Windows and Path Flexibility

2020 ◽  
Vol 2020 ◽  
pp. 1-19
Author(s):  
Li Wang ◽  
Shuai Gao ◽  
Kai Wang ◽  
Tong Li ◽  
Lin Li ◽  
...  
Keyword(s):  
Vehicle Routing ◽  
Electric Vehicle ◽  
Vehicle Routing Problem ◽  
Time Windows ◽  
Optimal Path ◽  
Travel Speed ◽  
Path Selection ◽  
Time Dependent ◽  
Mixed Integer ◽  
Routing Problem

With energy and environmental issues becoming increasingly prominent, electric vehicles (EVs) have become the important transportation means in the logistics distribution. In the real-world urban road network, there often exist multiple paths between any two locations (depot, customer, and charging station) since the time-dependent travel times. That is, the travel speed of an EV on each path may be different during different time periods, and thus, this paper explicitly considers path selection between two locations in the time-dependent electric vehicle routing problem with time windows, denoted as path flexibility. Therefore, the integrated decision-making should include not only the routing plan but also the path selection, and the interested problem of this paper is a time-dependent electric vehicle routing problem with time windows and path flexibility (TDEVRP-PF). In order to determine the optimal path between any two locations, an optimization model is established with the goal of minimizing the distance and the battery energy consumption associated with travel speed and cargo load. On the basis of the optimal path model, a 0-1 mixed-integer programming model is then formulated to minimize the total travel distance. Hereinafter, an improved version of the variable neighborhood search (VNS) algorithm is utilized to solve the proposed models, in which multithreading technique is adopted to improve the solution efficiency significantly. Ultimately, several numerical experiments are carried out to test the performance of VNS with a view to the conclusion that the improved VNS is effective in finding high-quality distribution schemes consisted of the distribution routes, traveling paths, and charging plans, which are of practical significance to select and arrange EVs for logistics enterprises.

QoS Correlation-based Service Composition Algorithm for Multi-constraint Optimal Path

2021 ◽  
Author(s):  
Jian Yu ◽  
Zhixing Lin ◽  
Qiong Yu ◽  
Xiangmei Xiao
Keyword(s):  
Service Composition ◽  
Optimal Path ◽  
Path Selection ◽  
Approximate Algorithm ◽  
Solution Path ◽  
Network Service ◽  
Integrated Network ◽  
Qos Guarantee ◽  
Optimal Service

Abstract With the development of network service integration, in order to obtain a better quality of service (QoS) guarantee, In this Paper,We consider the characteristics of integrated network service composition and correlation, this paper proposes a approximate algorithm based on multi-constraint optimal path selection (MCOPS). We analyses the QoS correlation criteria, correlation ratios, and Skyline algorithms to calculate the optimal path by dynamic programming, record the path nodes, and obtain the optimal service composition path that meets the user's demand. Simulation results demonstrate the good performance of the proposed algorithm in both the average calculation time and the solution path quality.

Marketing Policy Based Service Composition Model for Supplier Selection in Network Manufacturing

2012 ◽  
Vol 472-475 ◽  
pp. 2600-2603
Author(s):  
Tao Zhou
Keyword(s):  
Service Composition ◽  
Manufacturing Process ◽  
Supplier Selection ◽  
Critical Factor ◽  
Selection Problem ◽  
Manufacturing Enterprise ◽  
Marketing Policy ◽  
Supplier Selection Problem

Supplier selection, which is the first step of the network manufacturing, is evaluated as a critical factor for the manufacturing enterprise desiring to be successful in nowadays competition conditions. In network manufacturing, we first construct manufacturing process, and then select suitable suppliers. No matter suppliers provide components or services, we can unified consider they are all some types of manufacturing services. It’s very familiar with service composition, so we introduce marketing policy based service composition model to resolve supplier selection problem in network manufacturing. With the scope of this paper, we categorize manufacturing supplier selection constraints into three groups based on QoS, and propose a simple business constraint service composition model of marketing policy for supplier selection, which means that purchasers can get better manufacturing services from this model by choosing most suitable suppliers.

scholarly journals Implementasi Simulated Annealing untuk Penentuan Rute pada Jaringan

MATICS ◽  
2021 ◽  
Vol 13 (2) ◽  
pp. 42-46
Author(s):  
Gusti Eka Yuliastuti ◽  
Citra Nurina Prabiantissa ◽  
Agung Mustika Rizki
Keyword(s):  
Simulated Annealing ◽  
Simulated Annealing Algorithm ◽  
Computer Network ◽  
Travelling Salesman Problem ◽  
Optimal Solution ◽  
Network Routing ◽  
Path Selection ◽  
Travelling Salesman ◽  
Routing Problem ◽  
Stored Information

Abstract—Recently computer networks are increasingly complex. It needs to be a supporting device for network management such as a router. Router is a device that plays an important role in the routing process. In a router stored information in the form of routing paths, where the information includes data and which routers will be passed. In certain cases, a router can have more than one gateway. This is because the router needs to send data packets to several networks that have different segments. Such cases can be handled by using the appropriate routing path selection rules. The routing problem can be regarded as a traveling salesman problem (TSP), where a mechanism is needed to determine the shortest route to be traversed. The author implements the Simulated Annealing Algorithm because it can produce an optimal solution with light computing, so that the routing process can be more effective and efficient. Index Terms—Computer Network, Routing, Simulated Annealing, Travelling Salesman Problem Abstrak–-Jaringan komputer saat ini semakin kompleks. Perlu adanya suatu perangkat pendukung untuk manajemen jaringan seperti router. Router merupakan perangkat yang berperan penting dalam proses routing. Pada sebuah router tersimpan informasi berupa jalur routing, dimana informasi tersebut mencakup data dan router mana saja yang akan dilewati. Pada kasus tertentu, router dapat memiliki lebih dari satu gateway. Hal ini disebabkan karena router perlu mengirimkan paket data ke beberapa jaringan yang memiliki segmen berbeda. Kasus tersebut dapat ditangani dengan menggunakan aturan pemilihan jalur routing yang tepat. Permasalahan routing dapat dikatakan sebagai suatu permasalahan travelling salesman problem (TSP), dimana diperlukan suatu mekanisme dalam menentukan rute terpendek untuk dilalui. Penulis mengimplementasikan Algoritma Simulated Annealing karena dapat menghasilkan solusi yang optimal dengan komputasi ringan, sehingga proses routing dapat lebih efektif dan efisien. Kata Kunci—Jaringan Komputer, Penentuan Rute, Travelling Salesman Problem, Algoritma Simulated Annealing 

Sign in / Sign up

Export Citation Format

Share Document