Search

This paper ostablishod secondary distribution model of optimization problem, aiming at fchfl minimum logistics eosl under optimal layout of I he workshop, and anl colony-genetic hybrid algorithm is used Lo solve quadratic assignment model. The hybrid algorithm combined Lhe advantages of the anl colony algorithm with the Kinetic algorithm, using the solution of ant colony system as the initial population of the genetic algorithm, overcoming the flaws of converging slowly, falling into the local optimum of the ant colony algorithm and easy to premature convergence of the genetic algorithm, which will achieve the global optimal model. This paper regarded a machine factory workshop as an example, using MATLA1J to solve the results, which shows that: it will save 10.0% logistics fees by using the new layout of genetic ant algorithm than the original program; while it is better and faster to use the hybrid algorithm to solve the shop I.nuni optimization problem than the .nil colony algorithm nv genetic algorithm. [ABSTRACT FROM AUTHOR]

To address the uncertainty of surgery duration, this paper investigates surgery planning scheduling problem with multiple servers, which proposes chance constraints of operating rooms overtime to guarantee the surgery durations of patients is no more than the time limit of operating rooms with a high probability. A stochastic chance-constrained program is proposed to determine which operating rooms to operate, and surgeries to operating rooms allocation. Based on a finite support set of the surgery duration, this paper introduces 0-1 variables to formulate the chance constraints, and derives 0-1 integer linear program counterpart. To improve the efficiency of the model, this paper presents two classes of valid inequalities and uses the longest path algorithm to separate the second class of valid inequalities, which are implemented in a branch-and-cut framework. Computational experiments based on real-life data from hospital in Beijing are conducted to verify the algorithm performance and determine the optimal planning scheme, so as to take full utilization of healthcare resources, i.e. operating rooms. [ABSTRACT FROM AUTHOR]

The recommendation technology based on trust relationship is applied in the field of mobile e-commerce, and the use of social trust network to realize personalized recommendation has been widely studied. The inaccurate measurement of social trust has great influence on the accuracy of recommendation system. The paper is concerned with the problem that trust mechanism is ignored the asymmetric effect brought by the distrust relationship, and then restricts the accurate measurement of social trust. A novel algorithm of recommendation is proposed which is a real-value constrained Boltzmann machine recommendation algorithm based on trust-distrust relationship (TDA-RBM), establish restricted Boltzmann machine for each user, using normalized real value analysis and training process of RBM. Construct trust-distrust supervision mechanism, trust, distrust and the trust transfer are introduced, and the trust as weights for the TDA-RBM prediction score. Finally, we experimented on Epinions datasets and the comparison experiment proves that the TDA-RBM algorithm can effectively improve the accuracy of recommendation, which shows the effectiveness and excellency of the algorithm. [ABSTRACT FROM AUTHOR]

With the assumption that each appointment patient up in clinic arrives on time, this paper investigates the appointment scheduling problem with no-show. An integer programming model is established with the numbers of appointment patient and probability distribution of remaining patients at each slot as optimization variables. The objective function includes the benefits of serving patients, the patient waiting time costs, and system overtime expenses. By relaxing the coupled constraints about probability distribution of remaining patients at each slot, this paper proposes a Lagrangian relaxation method to solve the model with a dynamic programming algorithm solving the relaxation problem and a sub-gradient method solving the dual problem. Numerical experiments show that the algorithm can find the optimal solution for small scale problems, and that the best solution from the proposed algorithm is better than the one in the related literature for large scale problems. [ABSTRACT FROM AUTHOR]

The block allocation strategy affects the operation efficiency of the center terminal yard directly. This paper focuses on the container allocation problem during the loading and unloading process on center terminal, and establishes a dynamic container allocation optimization model to minimize the newly-added numbers of those stacked containers and allocate containers to the optimal positions. A heuristic algorithm is designed based on the characteristic of block relocation problem. Compared the optimization allocation strategy and the lowest allocation strategy, the experiments of different circumstances indicate that the optimization allocation strategy is better than the lowest allocation strategy. The data also shows that the algorithm is effective and the model is efficient in solving this problem. The experiments discuss the effects of container number, bay scales and arrival frequency for trains and trucks, which provide decision supports for the center terminal yard. [ABSTRACT FROM AUTHOR]

This paper, based on the consideration of the handling time, aimed to conduct a study on the optimization of the batches processing modes and resource scheduling for the mixed-model manufacturing system. The time models of the processing and handling for batch parts were established in order to obtain the solutions to the makespan and optimize the handling frequency. In this foundation, a principle was analyzed for determining the optimum processing sequencing. Besides, an optimization algorithm of the mutual-aid teams was also designed to schedule the handling equipments needed by the optimum processing sequencing. The results show that the study in this thesis can provide effective solutions to the makespan of batch parts, optimize the handling time and frequency, acquire the optimum processing sequencing, and schedule the resources of the handling equipments sensibly. [ABSTRACT FROM AUTHOR]