A hybrid algorithm based on tabu search and large neighbourhood search for car sequencing problem

The car sequencing problem(CSP)concerns a production sequence of different types of cars in the mixed-model assembly line.A hybrid algorithm is proposed to find an assembly sequence of CSP with minimum violations.Firstly,the hybrid algorithm is based on the tabu search and large neighborhood search(TLNS),servicing as the framework.Moreover,two components are incorporated into the hybrid algorithm.One is the parallel constructive heuristic(PCH)that is used to construct a set of initial solutions and find some high quality solutions,and the other is the small neighborhood search(SNS)which is designed to improve the new constructed solutions.The computational results show that the proposed hybrid algorithm(PCH+TLNS+SNS)obtains100best known values out of109public instances,among these89instances get their best known values with100%success rate.By comparing with the well-known related algorithms,computational results demonstrate the effectiveness,efficiency and robustness of the proposed algorithm.

Parallel Construction Heuristic Combined with Constraint Propagation for the Car Sequencing Problem

For the car sequencing（CS） problem, the draw-backs of the ＂sliding windows＂ technique used in the objective function have not been rectified, and no high quality initial solution has been acquired to accelerate the improvement of the solution quality. Firstly, the objective function is improved to solve the double and bias counting of violations broadly discussed. Then, a new method combining heuristic with constraint propagation is proposed which constructs initial solutions under a parallel framework. Based on constraint propagation, three filtering rules are designed to intersecting with three greedy functions, so the variable domain is narrowed in the process of the construction. The parallel framework is served to show its robustness in terms of the quality of the solution since it greatly increases the performance of obtaining the best solution. In the computational experiments, 109 instances of 3 sets from the CSPLib＇ s benchmarks are used to test the performance of the proposed method. Experiment results show that the proposed method outperforms others in acquiring the best-known results for 85 best-known results of 109 are obtained with only one construction. The proposed research provides an avenue to remedy the deficiencies of ＂sliding windows＂ technique and construct high quality initial solutions.

Migrating Birds Optimization for Flow Shop Sequencing Problem

FSSP is a typical NP-Hard problem which is desired to be minimum makespan. This study consid- ers Migrating Birds Optimization (MBO) which is metaheuristic approach for the solution of Flow Shop Sequencing Problem (FSSP). As the basic MBO algorithm is designed for discrete problems. The performance of basic MBO algorithm is tested via some FSSP data sets exist in literature. Obtained results are compared with optimal results of related data sets.

Efficient Security Sequencing Problem over Insecure Channel Based on Homomorphic Encryption

In the field of sequencing of secret number,an important problem is how to establish an efficient and secure protocol for sorting the secret number.As a powerful tool in solving privacy sequencing problems,secure multipart computation is more and more popular in anonymous voting and online auction.In the present study,related secure computation protocol for sequencing problem is not many by far.In order to improve the efficiency and safety,we propose a security sequencing protocol based on homomorphic encryption.We also give analysis of correctness and security to highlight its feasibility.

Test sequencing problem arising at the design stage for reducing life cycle cost

Previous test sequencing algorithms only consider the execution cost of a test at the application stage. Due to the fact that the placement cost of some tests at the design stage is considerably high compared with the execution cost, the sequential diagnosis strategy obtained by previous methods is actually not optimal from the view of life cycle. In this paper, the test sequencing problem based on life cycle cost is presented. It is formulated as an optimization problem, which is non-deterministic polynomial-time hard （NP-hard）. An algorithm and a strategy to improve its computational efficiency are proposed. The formulation and algorithms are tested on various simulated systems and comparisons are made with the extant test sequencing methods. Application on a pump rotational speed control （PRSC） system of a spacecraft is studied in detail. Both the simulation results and the real-world case application results suggest that the solution proposed in this paper can significantly reduce the life cycle cost of a sequential fault diagnosis strategy.

Pick sequencing optimization problem in the rotary rack S/R system

The problem of pick sequencing in the rotary rack S/R system (PPS-RRS) is investigated with the objective of minimizing the execution time. The rotary rack S/R system consists of one S/R machine and multiple levels of carousels that can rotate independently in bi-directions. The routing policy, namely the decision on the storage or retrieval sequence, dominates the efficiency and the throughput for such S/R systems, due to the complicated relationship between all levels of carousels and the S/R machine. For the purpose of optimizing the PPS-RRS, a computational model is developed in terms of execution time for picking multiple items in one trip. Characteristics of the PPS-RRS are analyzed and a local search heuristic based on a newly proposed neighborhood is presented. Integrated with the proposed local search procedure a new hybrid genetic algorithm is developed. Experimental results demonstrate the structure characteristics of good sequence and the efficiency and effectiveness of the proposed sequencing algorithms.

Sequential fault diagnosis strategy with imperfect tests considering life cycle cost

The problem of sequential fault diagnosis is to construct a diagnosis tree that can isolate the failure sources with minimal test cost. Pervious sequential fault diagnosis strategy generating algorithms only consider the execution cost at application stage, which may result in a solution with poor quality from the view of life cycle cost. Furthermore, due to the fact that uncertain information exists extensively in the real-world systems, the tests are always imperfect. In order to reduce the cost of fault diagnosis in the realistic systems, the sequential fault diagnosis problem with imperfect tests considering life cycle cost is presented and formulated in this work, which is an intractable NP-hard AND/OR decision tree construction problem. An algorithm based on AND/OR graph search is proposed to solve this problem. Heuristic search based on information theory is applied to generate the sub-tree in the algorithm. Some practical issues such as the method to improve the computational efficiency and the diagnosis strategy with multi-outcome tests are discussed. The algorithm is tested and compared with previous algorithms on the simulated systems with different scales and uncertainty. Application on a wheel momentum system of a spacecraft is studied in detail. Both the simulation and application results suggest that the cost of the diagnosis strategy can be reduced significantly by using the proposed algorithm, especially when the placement cost of the tests constitutes a large part of the total cost.