Layout of Logistics Facilities Based on Binary Tree Representation

A representation algorithm for logistics facility layout based on a binary tree (BT) was proposed following the approach for design of very large integrated circuit. The binary tree coding was to represent the mutual position relation among various operation units for logistics facility layout and make a complex facility layout solution space mapped to a relatively simple binary code space. On the basis of binary tree representation (BTR), an algorithm to obtain an optimum in area utilization ratio was developed, combined with the characteristics of logistics facilities layout. A genetic Algorithm with binary tree as its gene coding was further proposed to find optimized logistics facilities layout solution by random perturbation to the binary tree, its solution space is O(m!2^2m–2 /m^1.5), and computational complexity is O(1). Simulation results verify the efficiency and feasibility of the binary tree representation and corresponding algorithm.