A Study on Storage allocation problem based on clustering algorithms for the improvement of warehouse efficiency

The operation of warehouses has long been a focus of industry research. Faced with rapidly growing business needs, improving storage efficiency, and reducing customer response times have become crucial issues for improving the operational efficiency of a warehouse. Given a fixed area of space, optimizing the storage strategy can reduce the cost of goods handling, improve the efficiency of storage and delivery, accelerate the overall operational efficiency of the warehouse, and reduce logistical costs. In this paper we study the improvement of a real-life company’s storage location strategy using cluster and association analysis. Two different clustering techniques namely pairwise comparison clustering and K-means clustering are used, and their performances are compared with the current random storage policy used by the company. Both clustering algorithms consider item association and classify items into groups based on how frequently they appear with each other in customer's orders. The next stage applies assignment techniques to locate the clustered group in each aisle so as to minimize the total number of aisle visits and ultimately picking distance. By emphasizing the item association, our model is suitable for orders with multiple items in the modern retailing sector. It also more effectively shortens the picking distance compared with random assignment storage method. In our case, Warehouse studied herein, both models prove more effective as it reduces over 35% and 25 % of the picking distances versus the current set-up. However, when compared with each other the K-means clustering method outperforms the pairwise comparison

Echo State Networks for Proactive Caching in Cloud-Based Radio Access Networks with Mobile Users

In this paper, the problem of proactive caching is studied for cloud radio access networks (CRANs). In the studied model, the baseband units (BBUs) can predict the content request distribution and mobility pattern of each user, determine which content to cache at remote radio heads and BBUs. This problem is formulated as an optimization problem which jointly incorporates backhaul and fronthaul loads and content caching. To solve this problem, an algorithm that combines the machine learning framework of echo state networks with sublinear algorithms is proposed. Using echo state networks (ESNs), the BBUs can predict each user's content request distribution and mobility pattern while having only limited information on the network's and user's state. In order to predict each user's periodic mobility pattern with minimal complexity, the memory capacity of the corresponding ESN is derived for a periodic input. This memory capacity is shown to be able to record the maximum amount of user information for the proposed ESN model. Then, a sublinear algorithm is proposed to determine which content to cache while using limited content request distribution samples. Simulation results using real data from Youku and the Beijing University of Posts and Telecommunications show that the proposed approach yields significant gains, in terms of sum effective capacity, that reach up to 27.8% and 30.7%, respectively, compared to random caching with clustering and random caching without clustering algorithm.Comment: Accepted in the IEEE Transactions on Wireless Communication

Integrating memory context into personal information re-finding

Personal information archives are emerging as a new challenge for information retrieval (IR) techniques. The user’s memory plays a greater role in retrieval from person archives than from other more traditional types of information collection (e.g. the Web), due to the large overlap of its content and individual human memory of the captured material. This paper presents a new analysis on IR of personal archives from a cognitive perspective. Some existing work on personal information management (PIM) has begun to employ human memory features into their IR systems. In our work we seek to go further, we assume that for IR in PIM system terms can be weighted not only by traditional IR methods, but also taking the user’s recall reliability into account. We aim to develop algorithms that combine factors from both the system side and the user side to achieve more effective searching. In this paper, we discuss possible applications of human memory theories for this algorithm, and present results from a pilot study and a proposed model of data structure for the HDMs achieves

Design and Control of Warehouse Order Picking: a literature review

Order picking has long been identified as the most labour-intensive and costly activity for almost every warehouse; the cost of order picking is estimated to be as much as 55% of the total warehouse operating expense. Any underperformance in order picking can lead to unsatisfactory service and high operational cost for its warehouse, and consequently for the whole supply chain. In order to operate efficiently, the orderpicking process needs to be robustly designed and optimally controlled. This paper gives a literature overview on typical decision problems in design and control of manual order-picking processes. We focus on optimal (internal) layout design, storage assignment methods, routing methods, order batching and zoning. The research in this area has grown rapidly recently. Still, combinations of the above areas have hardly been explored. Order-picking system developments in practice lead to promising new research directions.Order picking;Logistics;Warehouse Management

The essence of P2P: A reference architecture for overlay networks

The success of the P2P idea has created a huge diversity of approaches, among which overlay networks, for example, Gnutella, Kazaa, Chord, Pastry, Tapestry, P-Grid, or DKS, have received specific attention from both developers and researchers. A wide variety of algorithms, data structures, and architectures have been proposed. The terminologies and abstractions used, however, have become quite inconsistent since the P2P paradigm has attracted people from many different communities, e.g., networking, databases, distributed systems, graph theory, complexity theory, biology, etc. In this paper we propose a reference model for overlay networks which is capable of modeling different approaches in this domain in a generic manner. It is intended to allow researchers and users to assess the properties of concrete systems, to establish a common vocabulary for scientific discussion, to facilitate the qualitative comparison of the systems, and to serve as the basis for defining a standardized API to make overlay networks interoperable

Signal synthesis by means of evolutionary algorithms

In this article, we investigate a procedure for generating signals with genetic algorithms. Signals are obtained from elementary patterns characterized by different degrees of freedom. These patterns are repeated and combined in order to reach specific signal shapes. The whole signal parametrization has to be determined by solving a difficult inverse problem of high dimensionality and strong multimodality. This can be carried out using evolutionary algorithms with the aim of finding all pattern configurations in the signal. The different signal synthesis schemes are evaluated, tested and applied to the generation of particular railway driving profiles