Earticle

The melting of the sea ice in the Arctic area increases the possibility of exploiting the Northern Sea Route (NSR)by economic method. Compared to the traditional routes, navigating through the Northern Sea Route (NSR) will save much distance and time from Asia to Europe, but the ice condition along the NSR is a key obstacle to most vessels. To ensure the safety of the navigation, ice breaker assistance service becomes crucial. This paper introduces the procedure of icebreaker assistance service firstly, and then a static scheduling model is presented to illustrate icebreaker assistance service. Considering real operation, a dynamic model is proposed, and First Come First Serve (FCFS) principle is implemented into models. The experiment results show that this model is beneficial to control the average waiting time, while it may leads to wait too long for some vessels. And the average fuel cost of each trip remains stable even increasing service request.

Block matching for motion estimation has been widely used in video compression for effi-cient transmission and storage of video bit stream by reducing the temporal redundancy ex-isting in a video sequence. The motion estimation is a process to predict the motion between two successive frames. This paper is primarily a review of the block matching algorithms using fast computational and winner-update strategies. The paper describes and analyses different types of block matching algorithms, namely Full Search (FS), Fast Computational of Full Search (FCFS), Three Step Search (TSS), New Three Step Search (NTSS), Three Step Search with Winner Update Strategy (WinUpTSS), Four Step Search (FSS) and Diamond Search (DS) algorithms.

As vehicular networks become popular and many vehicles want to access data through a roadside unit. In this paper, there was a vehicle to roadside communication and we propose scheduling schemes for efficient delivery of data packets in vehicular adhoc network. On the basis of priority scheduling algorithm vehicles can download/upload the data from RSU. In this paper we can control the congestion and delay of data by assigning the priorities to the message. The process with highest priority is executed first and highest priority is assign to those processes which have the smallest data size and this scheme is the smallest data size first scheduling(SDF) . If the two processes having the same data size then we can assign the priority on the basis of first come first serve scheduling (FCFS). We can combine these two algorithms and the new algorithm D*A. is introduced. This algorithm is responsible for only sending the commercial messages and the safety messages will be send on the different channel. The emergency messages will be sending through control channel with help of EDF scheduling. This paper increases the efficiency and throughput of the process and decreases the turnaround time for the process.

To prepare for future warfare that requires rapid and efficient logistics support Army is currently making greater efforts to develop supply systems. From this point of view, analyzing the performance of the military AS/RS(Automated Storage and Retrieval System) is one of the most essential study. This research presents analytical approach to a performance model on a carousel pod applicable to military AS/RS with a few control policies. A simulation model for each case is also developed to validate it.

A sequential zone picking system is a warehouse strategy that divides the order picking process into distinct zones, where items for specific customer orders are retrieved sequentially across these zones. Warehouse operators have made substantial efforts to develop sequencing algorithms that reduce blocking delays and picker idle time, thereby shortening the makespan of the processing window. Recently, the dual-lane configuration of the conveyor system, which facilitates the transportation of picking orders between zones, has proven to be an effective solution for addressing inefficiencies in sequential zone picking systems. This study aims to evaluate the performance of the dual-lane configuration with the simple first-come-first-served batch sequencing rule, in comparison to the single-lane conveyor configuration employing various effective batch sequencing algorithms. The simulation experimental design and results assess these operational methods’ performance by examining both the picking completion time and the completion time of the entire order picking and packing process under various conditions.