A Multi-stage Heuristic Algorithm for Matching Problem in the Modified Miniload Automated Storage and Retrieval System of E-commerce

E-commerce, as an emerging marketing mode, has attracted more and more attention and gradually changed the way of our life. However, the existing layout of distribution centers can＇t fulfill the storage and picking demands of e-commerce sufficiently. In this paper, a modified miniload automated storage/retrieval system is designed to fit these new characteristics of e-commerce in logistics. Meanwhile, a matching problem, concerning with the improvement of picking efficiency in new system, is studied in this paper. The problem is how to reduce the travelling distance of totes between aisles and picking stations. A multi-stage heuristic algorithm is proposed based on statement and model of this problem. The main idea of this algorithm is, with some heuristic strategies based on similarity coefficients, minimizing the transportations of items which can not arrive in the destination picking stations just through direct conveyors. The experimental results based on the cases generated by computers show that the average reduced rate of indirect transport times can reach 14.36% with the application of multi-stage heuristic algorithm. For the cases from a real e-commerce distribution center, the order processing time can be reduced from 11.20 h to 10.06 h with the help of the modified system and the proposed algorithm. In summary, this research proposed a modified system and a multi-stage heuristic algorithm that can reduce the travelling distance of totes effectively and improve the whole performance of e-commerce distribution center.

Solving the maximal matching problem with DNA molecules in Adleman-Lipton model

The maximal matching problem （MMP） is to find maximal edge subsets in a given undirected graph, that no pair of edges are adjacent in the subsets. It is a vitally important NP-complete problem in graph theory and applied mathematics, having numerous real life applications in optimal combination and linear programming fields. It can be difficultly solved by the electronic computer in exponential level time. Meanwhile in previous studies deoxyribonucleic acid （DNA） molecular operations usually were used to solve NP-complete continuous path search problems, e.g. HPP, traveling salesman problem, rarely for NP-hard problems with discrete vertices or edges solutions, such as the minimum vertex cover problem, graph coloring problem and so on. In this paper, we present a DNA algorithm for solving the MMP with DNA molecular operations. For an undirected graph with n vertices and m edges, we reasonably design fixed length DNA strands representing vertices and edges of the graph, take appropriate steps and get the solutions of the MMP in proper length range using O（n^3） time. We extend the application of DNA molecular operations and simultaneously simplify the complexity of the computation.

On palaeogeographic map

The palaeogeographic map is a graphic representation of physical geographical character- istics in geological history periods and human history periods. It is the most important result of palaeogeographic study. The author, as the Editor-in-Chief oflournal of Palaeogeography, Chinese Edition and English Edition, aimed at the problems of the articles submitted to and published in the]ournal of Palaeogeography in recent years and the relevant papers and books of others, and integrated with his practice of palaeogeographic study and mapping, wrote this paper. The content mainly includes the data of palaeogeographic mapping, the prob- lems of palaeogeographic mapping method, the ＂Single factor analysis and multifactor comprehensive mapping method ---- Methodology of quantitative lithofacies palae- ogeography＇, i.e., the ＂4 steps mapping method＂, the nomenclature of each palaeogeographic unit in palaeogeographic map, the explanation of each palaeogeographic unit in palae- ogeographic map, the explanation of significance of palaeogeographic map and palae- ogeographic article, the evaluative standards of palaeogeographic map and palaeogeographic article, and the self-evaluation. Criticisms and corrections are welcome. 2016 China University of Petroleum {Beijing）. Production and hosting by Elsevier B.V. on behalf of China University of Petroleum （Beijing）. This is an open access article under