Search

An extended method of semidiscrete high-resolution finite volume is used in this paper to obtain numerical solutions for a formulated nonlinear lumped kinetic model of liquid chromatographic process to examine the effect of chromatographic column overloading gradient elution considering core-shell particles. The model constitutes linear solvent strength (LSS), Henry's constant, coefficient of nonlinearity, and coefficient of axial dispersion. The effects of modulator concentration changes for the elution of single and two components are analyzed. The advantages of introducing gradient elution against isocratic elution in terms of core radius fraction are investigated intensively. Numerical temporal moments are generated from the solutions obtained for a more in-depth examination of the considered model. Moreover, multiple forms of a single- and two-component mixture are generated to analyze the influences of core radius fractions on gradient elution. For example, the obtained results are utilized to investigate the effects of the slope of gradient, concentration of modulator, solvent strength parameter, coefficient of nonlinearity, coefficient of mass transfer, and coefficient of axial dispersion on the profiles of concentration in order to improve the process performance using optimal core radius fraction parameter values. [ABSTRACT FROM AUTHOR]

The rapid development of e-commerce has impacted the intelligence level of warehouses. The robotic mobile fulfillment system (RMFS) demonstrated that mobile-pod warehouse systems could process a significant number of order-picking operations within the same amount of time as other systems, saving money and improving operational efficiency. The order-picking mode in such a system is "parts-to-picker," which is becoming both a prevailing operation mode in industrial warehouses and an encouraging research field during these years. One of the most significant fundamental factors in RMFS is the operational efficiency that is affected by storage assignment and order batching. This paper considers the joint impact of the storage assignment policies and order batching policies on order picking process. Our goal is to minimize the moving times of robots, which reflects the order-picking cost or efficiency. We propose using order similarity and item similarity to batch orders and assign item storage locations, respectively. Both the order batching and item grouping are tackled by a clustering model which is an integer linear program. We also develop a policy evaluation model to measure the order picking cost. We conduct numerical tests on six order batching and storage assignment policy combinations. A comparative analysis and an ANOVA analysis are then performed on the test results to compare the performances of these policy combinations. We find that the Weighted Support Count-based storage allocation combining with the correlation-based order batching achieves the best order-picking performance. Also, the more accurate information about the items and orders we can get from the historical data, the more order-picking workload we can save by exploiting the similarity features. [ABSTRACT FROM AUTHOR]

In the order picking process of the warehouse center, considering the rapid increase in the volume of orders arriving at the picking center at the time of the promotional festival, a hybrid operation mode with multiple picking tables is used to meet the picking requirements of the huge number of real-time orders. Therefore, in this paper, a hybrid picking mode is proposed, taking into account both the idle degree of picking stations and their order item centers of gravity, and a new reinforcement learning algorithm embedding mechanism (PRL) with placeholder control is designed to solve the problem of a huge number of real-time item orders arriving at the picking center system on promotional holidays and in inconsistent quantities, and numerical simulations are performed for this algorithm. The experimental results show that the PRL algorithm in hybrid picking mode can handle a huge number of orders simultaneously and improve picking efficiency effectively. [ABSTRACT FROM AUTHOR]

Designing an order picking system can be very complex, as several interrelated control variables are involved. We address the sizing of the storage capacity of the picking bay, the crew of pickers, and the AGV fleet, which are the most important variables from a tactical viewpoint in a parts-to-pickers system. Although order picking is a widely explored topic in the literature, no analytical model that can simultaneously deal with these variables is currently available. To bridge this gap, we introduce a queue model for Markovian processes, which enables us to jointly optimise the aforementioned control variables. A discrete-event simulation is then used to validate our model, and we then test our proposal with real data under different operative scenarios, with the aim of assessing the usefulness of the proposal in real settings. [ABSTRACT FROM AUTHOR]

This paper studies joint algorithms of order picking and distribution in new retail enterprises. The problem will consider many factors, such as the type of goods, picking time, batch capacity of distribution, distribution time, and distribution cost. First of all, the research problems are summarized as mathematical programming problems. Then, a genetic algorithm and comparison algorithms are proposed. Finally, the rationality of the model and the effectiveness of the algorithms are verified by computational experiments, and management enlightenments are revealed. [ABSTRACT FROM AUTHOR]

This paper studies joint algorithms of order picking and distribution in new retail enterprises. The problem will consider many factors, such as the type of goods, picking time, batch capacity of distribution, distribution time, and distribution cost. First of all, the research problems are summarized as mathematical programming problems. Then, a genetic algorithm and comparison algorithms are proposed. Finally, the rationality of the model and the effectiveness of the algorithms are verified by computational experiments, and management enlightenments are revealed. [ABSTRACT FROM AUTHOR]

This paper studies joint algorithms of order picking and distribution in new retail enterprises. The problem will consider many factors, such as the type of goods, picking time, batch capacity of distribution, distribution time, and distribution cost. First of all, the research problems are summarized as mathematical programming problems. Then, a genetic algorithm and comparison algorithms are proposed. Finally, the rationality of the model and the effectiveness of the algorithms are verified by computational experiments, and management enlightenments are revealed. [ABSTRACT FROM AUTHOR]

Robotic Mobile Fulfillment System (RMFS) is a new type of parts-to-picker order picking system and has become the development trend of e-commerce logistics distribution centers. There are usually a large number of tasks need to be allocated to many robots and the picking time for e-commerce orders is usually very tight, which puts forward higher requirements for the efficiency of multirobot task allocation (MRTA) in e-commerce RMFS. Current researches on MRTA in RMFS seldom consider task correlation and the balance among picking stations. In this paper, a task time cost model considering task correlation is built according to the characteristics of the picking process. Then, a multirobot task allocation model minimizing the overall picking time is established considering both the picking time balance of picking stations and the load balance of robots. Finally, a four-stage balanced heuristic auction algorithm is designed to solve the task allocation model and the tasks with execution sequence for each robot are obtained. By comparing with the traditional task time cost model and the algorithm without considering the balance among picking stations, it is found that the proposed model and algorithm can significantly shorten the overall picking time. [ABSTRACT FROM AUTHOR]

Due to the importance of the drive system reliability, several diagnostic methods have been investigated for the SSTPI-IM association in the literature. Based on the normalized currents and the current vector slope, this paper investigates a fuzzy diagnostic method for this association. The fuzzy logic technique is appealed in order to process the diagnosis variable symptoms and the faulty IGBT information. Indeed, the design, inputs, and rules of the fuzzy logic are distinct compared with the other existing diagnostic methods. The proposed fuzzy diagnostic method allows the best efficient detection and identification of the single and phase OCF of the SSTPI-IM association. Accordingly, after the fault detection and identification using this proposed FLC diagnostic method, a reconfiguration step of IGBT OCFs must be applied in order to compensate for these faults and ensure the drive system continuity. This reconfiguration is based on the change of the SSTPI-IM topology to the FSTPI-IM topology by activating or deactivating the used relays. Several simulation results utilizing a direct RFOC controlled SSTPI-IM drive system are investigated, showing the fuzzy diagnostic and reconfiguration methods' performances, their robustness, and their fast fault detection during distinct operating conditions. [ABSTRACT FROM AUTHOR]

In order to monitor the process variance, this paper proposes a combined upper-sided synthetic S2 chart for monitoring the process standard deviation of a normally distributed process. This combined upper-sided synthetic S2 chart comprises a synthetic chart and an upper-sided S2 chart. The design and performance of the proposed chart are presented, and the steady-state average run length comparisons show that the combined upper-sided synthetic S2 chart outperforms the standard synthetic S2 chart as well as several run rules S2 charts, especially for larger shifts in the process variance. [ABSTRACT FROM AUTHOR]

This paper addresses the order picking problem in a material handling system consisting of multiple carousels and one picker. Carousels are rotatable closed-loop storage systems for small items, where items are stored in bins along the loop. An order at carousels consists of n different items stored there. The objective is to find an optimal picking sequence to minimizing the total order picking time. After proving the problem to be strongly NP-hard and deriving two characteristics, we develop a dynamic programming algorithm (DPA) for a special case (two-carousel storage system) and an improved nearest items heuristics (INIH) for the general problem. Experimental results verify that the solutions are quickly and steadily achieved and show their better performance. [ABSTRACT FROM AUTHOR]