scholarly journals A Shortest Path Heuristic for Evaluating the Quality of Stowage Plans in Roll-On Roll-Off Liner Shipping

2017 ◽  
pp. 351-365
Author(s):  
Jone R. Hansen ◽  
Kjetil Fagerholt ◽  
Magnus Stålhane
Keyword(s):  
Shortest Path ◽  
Liner Shipping

Shortest path establishment approaches for static and dynamic mobile nodes with quality of service

2018 ◽  
Vol 14 (1) ◽  
pp. 1 ◽  
Author(s):  
S. Sundar ◽  
Aritra Basu ◽  
Arunava Kar ◽  
R. Kumar ◽  
Harish Mallikarjun Kittur
Keyword(s):  
Quality Of Service ◽  
Shortest Path ◽  
Mobile Nodes

A Novel QoS Aware Shortest Path Algorithm for VSDN

2017 ◽  
Vol 6 (1) ◽  
pp. 1-14
Author(s):  
Amandeep Kaur Sandhu ◽  
Jyoteesh Malhotra
Keyword(s):  
Energy Consumption ◽  
Shortest Path ◽  
Service Providers ◽  
Service Level Agreement ◽  
Service Level ◽  
Software Defined Networks ◽  
Shortest Path Algorithm ◽  
Internet Service ◽  
Decrease Energy Consumption

This article describes how a rapid increase in usage of internet has emerged from last few years. This high usage of internet has occurred due to increase in popularity of multimedia applications. However, there is no guarantee of Quality of Service to the users. To fulfill the desired requirements, Internet Service Providers (ISPs) establish a service level agreement (SLA) with clients including specific parameters like bandwidth, reliability, cost, power consumption, etc. ISPs make maximum SLAs and decrease energy consumption to raise their profit. As a result, users do not get the desired services for which they pay. Virtual Software Defined Networks are flexible and manageable networks which can be used to achieve these goals. This article presents shortest path algorithm which improves the matrices like energy consumption, bandwidth usage, successful allocation of nodes in the network using VSDN approach. The results show a 40% increase in the performance of proposed algorithms with a respect to existing algorithms.

scholarly journals On the Inherent Segment Length in Music

2010 ◽  
pp. 317-333
Author(s):  
Kristoffer Jensen
Keyword(s):  
Time Scales ◽  
Shortest Path ◽  
Automatic Segmentation ◽  
Feature Representation ◽  
Segment Length ◽  
The Mean ◽  
The Cost ◽  
Different Time Scales

In this work, automatic segmentation is done using different original representations of music, corresponding to rhythm, chroma and timbre, and by calculating a shortest path through the selfsimilarity calculated from each time/feature representation. By varying the cost of inserting new segments, shorter segments, corresponding to grouping, or longer, corresponding to form, can be recognized. Each segmentation scale quality is analyzed through the use of the mean silhouette value. This permits automatic segmentation on different time scales and it gives indication on the inherent segment sizes in the music analyzed. Different methods are employed to verify the quality of the inherent segment sizes, by comparing them to the literature (grouping, chunks), by comparing them among themselves, and by measuring the strength of the inherent segment sizes.

scholarly journals Improving the Quality of Service and Privacy by Integrating Dijkstra‟s, SafeQ and Extended Watchdog Algorithm in Wireless Sensor Networks

2019 ◽  
Vol 9 (1) ◽  
pp. 5409-5414
Keyword(s):  
Wireless Sensor Networks ◽  
Quality Of Service ◽  
Sensor Networks ◽  
Shortest Path ◽  
Clustering Algorithm ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Destination Node ◽  
Hop Count

The fundamental issue is framing the sensor nodes and steering the information from sender node to receiver node in wireless sensor networks (WSN). To resolve this major difficulty, clustering algorithm is one of the accessible methods employed in wireless sensor networks. Still, clustering concept also faces some hurdles while transmitting the data from source to destination node. The sensor node is used to sense the data and the source node helps to convey the information and the intended recipient receives the sensed information. The clustering proposal will choose the cluster head depending on the residual energy and the sensor utility to its cluster members. The cluster heads will have equal cluster number of nodes. The complexity is generated in computing the shortest path and this can be optimized by Dijkstra’s algorithm. The optimization is executed by Dijkstra’s shortest path algorithm that eliminates the delay in packet delivery, energy consumption, lifetime of the packet and hop count while handling the difficulties. The shortest path calculation will improve the quality of service (QoS). QoS is the crucial problem due to loss of energy and resource computation as well as the privacy in wireless sensor networks. The security can be improvised in this projected work. The preventive metrics are discussed to upgrade the QoS facility by civilizing the privacy parameter called as Safe and Efficient Query Processing (SAFEQ) and integrating the extended watchdog algorithm in wireless sensor networks.

scholarly journals A Class of Evolutionary Algorithms for Determining Shortest Path Routing in 5G Ultra Dense Heterogeneous Networks

2020 ◽  
Vol 14 ◽  
Keyword(s):  
Shortest Path ◽  
Optimal Path ◽  
Pso Algorithm ◽  
Small Cells ◽  
5G Networks ◽  
Routing Problem ◽  
Shortest Path Routing ◽  
Individual Fitness ◽  
Evolutionary Optimization Algorithms

Ultra Dense Network (UDN), an important element of the upcoming 5G networks are characterised by extremely dynamic operations due to the presence and mobility of large number of users spread over small cells of varying sizes. It makes optimal path between the source/destination pairs for communication and data transmission be highly dynamic in nature and hence a challenging issue to deal with. Under such dynamic backdrops, routing procedures have to exhibit robustness, scalability and time efficiency in order to ensure seamless link reliability and Quality of Service (QOS) of the network. In the proposed work, the shortest optimal route of the source and destination pair is found using a combination of evolutionary optimization algorithms namely Genetic Algorithm (GA), Particle Swarm Optimization (PSO) Algorithm and our novel hybrid PSOGA approach which searches for an optimized solution by determining cost functions of individual fitness state and comparing states generated between individual solutions. Application of all the three above mentioned algorithms to the Shortest Path Routing Problem in UDNs and the results obtained have shown that the hybrid PSO-GA comparatively provided enhanced optimized solution.

METHODOLOGY FOR SUBSTANTIATING THE RATIONAL ROUTE OF INFORMATION TRANSMISSION IN THE INFORMATION AND TELECOMMUNICATION NETWORK IN THE CONDITIONS OF THE COMPLEX IMPACT OF THE ENEMY

2020 ◽  
Author(s):  
С.А. БАГРЕЦОВ ◽  
Н.Б. АЧКАСОВ ◽  
О.С. ЛАУТА ◽  
Д.Ю. ВАСЮКОВ
Keyword(s):  
Information Transmission ◽  
Shortest Path ◽  
Transfer Process ◽  
Data Exchange ◽  
Data Transfer ◽  
Telecommunication Network ◽  
Quality Of Information ◽  
Transfer Path ◽  
The Stability

Представлены подходы к повышению устойчивости функционирования информационно-телекоммуникационной сети, которые способствуют оптимизации процесса передачи данных среди обменников информации за счет повышения быстродействия и нахождения оптимального пути передачи данных. Отмечается, что сокращение времени обмена информацией между абонентами будет происходит по наиболее короткому пути и это должно существенно повлиять на качество информации,ее важность и необходимость при ведении боевых действий в условиях радиоэлектронного противодействия противника. Various approaches to improving the stability of telecommunications networks, which lead to optimizing the data transfer process by increasing the speed and finding the most optimal data transfer path, are presented. It is noted that the reduction of the data exchange time between subscribers will occur along the shortest path, which will significantly affect the quality of information, its importance, and the need for conducting combat operations in the condition of electronic counteraction of the enemy.

scholarly journals Comparison of Decisions Quality of Heuristic Methods with Limited Depth-First Search Techniques in the Graph Shortest Path Problem

2017 ◽  
Vol 7 (1) ◽  
pp. 428-434
Author(s):  
Eduard Vatutin
Keyword(s):  
Shortest Path ◽  
Optimization Method ◽  
Search Tree ◽  
Random Structure ◽  
Heuristic Methods ◽  
Combinatorial Search ◽  
Search Techniques ◽  
Depth First Search ◽  
Limited Depth

AbstractThe article deals with the problem of analysis of effectiveness of the heuristic methods with limited depth-first search techniques of decision obtaining in the test problem of getting the shortest path in graph. The article briefly describes the group of methods based on the limit of branches number of the combinatorial search tree and limit of analyzed subtree depth used to solve the problem. The methodology of comparing experimental data for the estimation of the quality of solutions based on the performing of computational experiments with samples of graphs with pseudo-random structure and selected vertices and arcs number using the BOINC platform is considered. It also shows description of obtained experimental results which allow to identify the areas of the preferable usage of selected subset of heuristic methods depending on the size of the problem and power of constraints. It is shown that the considered pair of methods is ineffective in the selected problem and significantly inferior to the quality of solutions that are provided by ant colony optimization method and its modification with combinatorial returns.

scholarly journals Solving fuzzy multi-objective shortest path problem based on data envelopment analysis approach

2021 ◽  
Author(s):  
M. Bagheri ◽  
Ali Ebrahimnejad ◽  
S. Razavyan ◽  
F. Hosseinzadeh Lotfi ◽  
N. Malekmohammadi
Keyword(s):  
Data Envelopment Analysis ◽  
Shortest Path ◽  
Shortest Path Problem ◽  
Data Envelopment ◽  
Practical Applications ◽  
Multi Objective ◽  
Decision Making Unit ◽  
Wide Range ◽  
Time Distance

AbstractThe shortest path problem (SPP) is a special network structured linear programming problem that appears in a wide range of applications. Classical SPPs consider only one objective in the networks while some or all of the multiple, conflicting and incommensurate objectives such as optimization of cost, profit, time, distance, risk, and quality of service may arise together in real-world applications. These types of SPPs are known as the multi-objective shortest path problem (MOSPP) and can be solved with the existing various approaches. This paper develops a Data Envelopment Analysis (DEA)-based approach to solve the MOSPP with fuzzy parameters (FMOSPP) to account for real situations where input–output data include uncertainty of triangular membership form. This approach to make a connection between the MOSPP and DEA is more flexible to deal with real practical applications. To this end, each arc in a FMOSPP is considered as a decision-making unit with multiple fuzzy inputs and outputs. Then two fuzzy efficiency scores are obtained corresponding to each arc. These fuzzy efficiency scores are combined to define a unique fuzzy relative efficiency. Hence, the FMOSPP is converted into a single objective Fuzzy Shortest Path Problem (FSPP) that can be solved using existing FSPP algorithms.

scholarly journals Service quality and customer satisfaction in liner shipping

2015 ◽  
Vol 7 (2/3) ◽  
pp. 170-183 ◽  
Author(s):  
Kum Fai Yuen ◽  
Vinh Van Thai
Keyword(s):  
Customer Satisfaction ◽  
Service Quality ◽  
Online Survey ◽  
Measurement Model ◽  
Liner Shipping ◽  
Service Differentiation ◽  
Content Type ◽  
Cost Leadership ◽  
Quality Dimensions

Purpose – This paper aims to identify the dimensions of service quality (SQ) in liner shipping and examine their effects on customer satisfaction. Design/methodology/approach – The indicators of SQ in liner shipping were identified from reviewing the literature and interviewing six qualified industry practitioners. An online survey was then administered to 183 liner shippers in Singapore. Subsequently, exploratory factor analysis and regression analysis were conducted. Findings – SQ in liner shipping can be represented by four key quality dimensions. In descending order of their impact on customer satisfaction, they are reliability, speed, responsiveness and value. Service differentiation by time-related attributes results in greater customer satisfaction than practising cost leadership in liner shipping. Research limitations/implications – Allocation of resources to develop SQ in liner shipping should mirror the priorities established in this research. In addition, the developed measurement model for SQ can serve as a reference for liner shipping firms to assess the quality of their services. Originality/value – A parsimonious and updated set of variables can now be used to represent SQ in the liner shipping sector. The paper also identifies the key drivers of customer satisfaction in liner shipping.

Sign in / Sign up

Export Citation Format

Share Document