Interactive AR-assisted product disassembly sequence planning (ARDIS)

This paper presents a proof-of-concept novel near real-time interactive AR-assisted product disassembly sequence planning system (ARDIS) based on product information, such as interference matrix and 3D models. The system is developed using Unity and consists of three modules, including an intelligent disassembly sequence planning module, an automatic content authoring module and an intuitive augmented reality (AR) user interface (UI) with various features, such as a virtual panel for customisation and an option panel for sequence regeneration. Given the retrieval targets specified by a user, optimised disassembly sequences are computed using an evolutionary computing algorithm. For the sequences computed, the respective AR disassembly instruction sequences, such as 2D text instructions and animated 3D models, are generated dynamically based on a taxonomy that links each disassembly step in a sequence with the corresponding Unity templates that have been created beforehand. Hence, the need for manual authoring to provide AR disassembly guidance is reduced. If necessary, the user can request for alternative disassembly sequences which can be re-computed in near real-time. Several case studies have been carried out to demonstrate and evaluate the performance of the system within the laboratory environment.     

Assembly sequence influence on geometric deviations propagation of compliant parts

This paper presents a non-rigid part variation simulation method for fulfilling functionnal requirements on compliant assemblies. This method is based on the propagation of different geometrical deviations (manufacturing and assembly process defects) using the method of influence coefficient. Tolerance analysis of compliant assemblies is also achieved very early in the design stage. As a consequence, designers and manufacturing engineers can efficiently analyse the assembly design principles both in terms of installed stresses and geometric variation clearance. They can also set optimised sequences that enable ridding of geometric variations.     

Assembly block location and sequencing for flat transporters in a planar storage yard of shipyards

Assembly block location and sequencing are two important and related problems for scheduling a flat transporter to perform block storage and transport within a planar storage yard in shipyards. They affect not only the transport efficiency of storage yards but also the productivity and coordination of related workshops. This paper addresses the block location and sequencing at the same time with the purpose of reducing unproductive moves. A heuristic approach is proposed based on a sequencing strategy, a location selecting procedure for the incoming blocks and a policy for relocating blocks. A tabu search algorithm is proposed to improve the solution. Numerical experiments are conducted to validate the effectiveness and efficiency of the proposed approach.     

A hybrid particle swarm based method for process planning optimisation

A process planning (PP) problem is defined as to determine a set of operation-methods (machine, tool, and set-up configuration) that can convert the given stock to the designed part. Essentially, the PP problem involves the simultaneous decision making of two tasks: operation-method selection and sequencing. This is a combinatorial optimisation problem and it is difficult to find the best solution in a reasonable amount of time. In this article, an optimisation approach based on particle swarm optimisation (PSO) is proposed to solve the PP problem. Due to the characteristic of discrete process planning solution space and the continuous nature of the original PSO, a novel solution representation scheme is introduced for the application of PSO in solving the PP problem. Moreover, two kinds of local search algorithms are incorporated and interweaved with PSO evolution to improve the best solution in each generation. The numerical experiments and analysis have demonstrated that the proposed algorithm is capable of gaining a good quality solution in an efficient way.     

Ant colony optimisation with elitist ant for sequencing problem in a mixed model assembly line

Optimised sequencing in the Mixed Model Assembly Line (MMAL) is a major factor to effectively balance the rate at which raw materials are used for production. In this paper we present an Ant Colony Optimisation with Elitist Ant (ACOEA) algorithm on the basis of the basic Ant Colony Optimisation (ACO) algorithm. An ACOEA algorithm with the taboo search and elitist strategy is proposed to form an optimal sequence of multi-product models which can minimise deviation between the ideal material usage rate and the practical material usage rate. In this paper we compare applications of the ACOEA, ACO, and two other commonly applied algorithms (Genetic Algorithm and Goal Chasing Algorithm) to benchmark, stochastic problems and practical problems, and demonstrate that the use of the ACOEA algorithm minimised the deviation between the ideal material consumption rate and the practical material consumption rate under various critical parameters about multi-product models. We also demonstrate that the convergence rate for the ACOEA algorithm is significantly more than that for all the others considered.     

A rolling horizon approach for material requirement planning under fuzzy lead times

This paper proposes a fuzzy multi-objective integer linear programming (FMOILP) approach to model a material requirement planning (MRP) problem with fuzzy lead times. The objective functions minimise the total costs, back-order quantities and idle times of productive resources. Capacity constraints are included by considering overtime resources. Into the crisp MRP multi-objective model, we incorporate the possibility of occurrence of each uncertain lead time using fuzzy numbers. Then FMOILP is transformed into an auxiliary crisp mixed-integer linear programming model by a fuzzy goal programming approach for each fuzzy lead time combination. In order to defuzzify the set of solutions associated with each fuzzy lead time combination, a solution method based on the centre of gravity concept is addressed. Model validation with a numerical example is carried out by a novel rolling horizon procedure where uncertain lead times are updated during each planning period according to the centre of gravity obtained. For illustration purposes, the proposed solution approach is satisfactorily compared to a rolling horizon approach in which lead times are allocated when the possibility of occurrence is established at one.     

考虑转换约束的汽车混流装配线投产排序研究

讨论了有生产线线边替补人员协助完成超载工作量的情况下,汽车混流装配线投产排序的问题,并且考虑工作人员行走占用的时间。通过对某整车厂进行实地调研,将汽车装配生产中的优化问题从以往文献中只考虑的总装车间向前延伸到涂装车间,给出连续喷涂某种颜色的车辆数的上界s。在此基础上,并考虑总装线线边物料消耗速率波动均衡和子装配工负荷均衡的约束条件,建立涂装切换成本和总装车间人工成本最小化的数学模型。最后,用CPLEX对模型进行优化求解,并分析得出生产节拍和工作站长度等参数与总成本之间的变化关系。     

Robust production planning and control for multi-stage systems with flexible final assembly lines

Production planning of final assembly systems is a challenging task, as the often fluctuating order volumes require flexible solutions. Besides, the calculated plans need to be robust against the process-level disturbances and stochastic nature of some parameters like manual processing times or machine availability. In the paper, a simulation-based optimisation method is proposed that utilises lower level shop floor data to calculate robust production plans for final assembly lines of a flexible, multi-stage production system. In order to minimise the idle times when executing the plans, the capacity control that specifies the proper operator–task assignments is also determined. The analysed multi-stage system is operated with a pull strategy, which means that the production at the final assembly lines generates demands for the preceding stages providing the assembled components. In order to guarantee the feasibility of the plans calculated for the final assembly lines, a decomposition approach is proposed to optimise the production plan of preceding stages. By this way, the robust production can be ensured resulting in reduced losses and overall production costs even though the system is exposed to changes and disturbances.     

免疫粒子群算法在混流装配线排序中的应用

混流装配线上的产品投产排序是影响装配线生产效率的重要因素.建立以最小化装配线总闲置—超载成本为优化目标的装配线排序模型,采用粒子群算法来解决混流装配线的投产排序问题.考虑到基本粒子群算法易陷入局部最优解的问题,引入免疫算法思想对其进行改进,根据抗体亲和性与浓度值的计算,及时进行粒子的替换以维持种群的多样性,防止粒子过早...     

优化交货可靠性的装配作业车间分批调度

装配作业车间生产多规格小批量装配型产品,通常具有差异BOM结构,主要由客制零件组成,但同规格产品仍然包含一定比例的可互用零件,每类零件具有一定批量。此类车间分批调度需要最优化零件类的批次分割和子批加工序列。考虑客户对高交货可靠性的需求,构建了基于最优化交货可靠性为决策优化目标的分批调度数学模型,建立了基于遗传算法和优先级分派规则的混合求解算法。最后通过仿真实验分析和验证了所提方法的有效性。     

Clamping-sequence optimisation based on heuristic algorithm for sheet-metal components

The traditional clamping-sequence optimisation of sheet-metal parts requires many complicated finite element analyses, and clamping-sequence planning does not account for the springback from clamp-release. Therefore, this paper proposes a new optimisation method based on a heuristic algorithm. We first propose a new contact model of parts, clamps and supporting locators to analyse assembly deformation. Then, we use the distance between the actual and nominal positions to evaluate the clamp layout. Finally, we apply the heuristic algorithm to optimise the clamping sequence. We illustrate the proposed method with a case study of a taillight bracket, whose results show that the method of clamping-sequence optimisation can effectively decrease the deformation of sheet metal from clamping.     

An improved multi-objective genetic algorithm for heterogeneous coverage RFID network planning

Recent research has demonstrated the potential benefits of radio frequency identification (RFID) technology in the supply chain and production management via its item-level visibility. However, the RFID coverage performance is largely impacted by the surrounding environment and potential collisions between the RFID devices. Thus, through RFID network planning (RNP) to achieve the desired coverage within the budget becomes a key factor for success. In this study, we establish a novel and generic multi-objective RNP model by simultaneously optimising two conflicted objectives with satisfying the heterogeneous coverage requirements. Then, we design an improved multi-objective genetic algorithm (IMOGA) integrating a divide-and-conquer greedy heuristic algorithm to solve the model. We further construct a number of computational cases abstracted from an automobile mixed-model assembly line to illustrate how the proposed model and algorithm are applied in a real RNP application. The results show that the proposed IMOGA achieves highly competitive solutions compared with Pareto optimal solutions and the solutions given by four recently developed well-known multi-objective evolutionary and swarm-based optimisers (SPEA2, NSGA-II, MOPSO and MOPS²O) in terms of solution quality and computational robustness.     

Improved variable neighbourhood search for integrated tundish planning in primary steelmaking processes

Production planning (or product design) in the steel industry needs specific, sophisticated procedures in order to guarantee competitive plant performance. This paper describes an integrated tundish planning problem, considering the steelmaking-continuous casting-hot rolling and other downstream integrated technical constraints, and a multi-objective optimisation model is proposed with the objective to optimise the number of tundish, the additional cost of technical operations and the throughput balance to each flow. Also, instead of using traditional metaheuristic algorithm or artificial intelligence (AI)-based heuristic approaches, this paper develops two new approaches, the improved variable neighbourhood descent (IVND) search method and improved reduced variable neighbourhood search (IRVNS) method, by introducing the iterated local search into local search to the problem described above. The performance of IVND and IRVNS are analysed based on changing the number of local iteration and weights of objective function, these two algorithms are also compared with tabu search(TS) and heuristic method based on numeral analysis of the actual data, and the results show that the model and algorithm are feasible and efficient.     

Order-oriented cooperative sequencing optimisation in multi-mix-model assembly lines

Order-oriented products assembly sequence among different assembly lines becomes a critical problem for mass customisation manufacturing systems. It significantly affects system productivity, delivery time, and manufacturing cost. In this paper, we propose a new approach to extend the traditional products sequencing from mixed model assembly line (MMAL) to multi-mixed model assembly lines (MMMALs) to obtain the optimal assembly sequence with the objectives of minimising consumption waviness of each material in the lines, assembly line setup cost, and lead-time. A multi-objective optimisation algorithm based on variable neighbourhood search methods (VNS) is developed. We perform an industrial case study in order to demonstrate the practicality and effectiveness of the proposed approach.     

GRASP with path relinking for a multiple objective sequencing problem for a mixed-model assembly line

This research presents a new application of greedy randomised adaptive search procedure (GRASP) to address a production sequencing problem for mixed-model assembly line in a just-in-time (JIT) production system in two different cases. In the former case, small size sequencing problems are considered and two objectives are presented; minimisation of setups and optimisation of stability of material usage rates. These two objectives are inversely correlated with each other, so simultaneous optimisation of both is challenging. This type of problem is NP-hard. The GRASP, with path relinking, searches for efficient frontier where simultaneous optimisation of number of setups and usage rates is desired. Several test problems are solved via GRASP and its performance is compared to solutions obtained via complete enumeration and simulated annealing (SA), tabu search (TS) and genetic algorithms (GA) approaches from the literature. Experimental results reveal that the GRASP with path relinking provides near-optimal solutions in terms of the two objectives and its ‘average inferiority%’ and ‘average percentile’ performances are superior to that of other heuristics. In the latter case, the goal is to explore varying the emphasis of these two conflicting objectives. Larger sequencing problems are considered and solved via GRASP with path relinking. Its objective function values are compared to the solutions obtained via a SA approach from the literature. Experimental results show that GRASP also provides good performance on large size problems and its percentage improvement is better than that of SA. Overall results also show, however, that the GRASP performs poorly with regard to CPU time.     

面向虚拟装配的"顶点表示活动"网络排序装配顺序规划的研究

基于信息化制造这样一种新型制造模式，阐述了信息化制造的研究方向之一是虚拟装配技术，讨论了装配顺序规划的研究现状。研究了面向虚拟装配将顶点表示活动网络（Activity On Vertices，简称AOV网络）排序应用到装配顺序规划中的方法，探讨了AOV网络排序在减速器装配顺序规划中的应用。研究结果表明：该方法对于产品装配顺序规划的应用达到了预期的效果。     

Aggregate production planning for shipbuilding with variation-inventory trade-offs

Shipbuilding is a complex production system characterised by a complicated work and organisation structure, prolonged production lead time, and heterogeneous resource requirements. Thus, effectively planning all involved activities presents a challenging task and requires the timely coordination between the successive production stages at the plant level and effective resource allocation at the workshop level. With the work breakdown structure of all projects and their corresponding building strategies, the aggregate production planning (APP) is to address two important issues, namely, workforce level and inventory usage so that the fluctuating demands from downstream processes can be satisfied in a cost-effective manner. To achieve this, a novel APP model is proposed for ship production to minimise the variation of aggregate man-hour over the planning horizon and simultaneously minimise the logistic demands of the interim products. In view of the combinatorial nature and computational complexity, a directed genetic algorithm based solver has been developed to solve the two-conflicting-objective optimisation problem. The proposed approach has been applied to a case study and preliminary results have shown certain effectiveness in handling various situations with different planning strategies.     

A trade-off between productivity and cost for the integrated part quality inspection and preventive maintenance planning under uncertainty

This paper proposes a robust possibilistic and multi-objective mixed-integer linear programming mathematical model to concurrently plan part quality inspection and Preventive Maintenance (PM) activities for a serial multi-stage production system. This system contains the deteriorating stages and faces the uncertainty about estimated cost components and demand amount. The integrated model reaches two significant decisions which are the right time and place for performing the part quality inspection and PM. These decisions are made while the model is to simultaneously optimise the implied system productivity and total cost. To measure the implied system productivity, a new piecewise utility function for the ratio of produced conforming products to input workpieces is developed. A real case study and a numerical example are explored to validate and verify the developed model. The results prove the significance and effectiveness of considering the uncertainty and conflicting practical objectives for the problem.     

Ant colony optimisation with random selection for block transportation scheduling with heterogeneous transporters in a shipyard

This paper considers a scheduling problem of heterogeneous transporters for pickup and delivery blocks in a shipyard assuming a static environment where all transportation requirements for blocks are predetermined. In the block transportation scheduling problem, the important issue is to determine which transporter delivers the block from one plant to the other plant and when, in order to minimise total logistic times. Therefore, the objective of the problem is to simultaneously determine the allocation policy of blocks and the sequence policy of transporters to minimise the weighted sum of empty transporter travel times, delay times, and tardy times. A mathematical model for the optimal solution is derived and an ant colony optimisation algorithm with random selection (ACO_RS) is proposed. To demonstrate the performance of ACO_RS, computational experiments are implemented in comparing the solution with the optimal solutions obtained by CPLEX in small-sized problems and the solutions obtained by conventional ACO in large-sized problems.     

Efficient management of air quality considering fuzzy confidences with varied reliabilities

Regional air quality management systems are complicated by uncertainties due to their interactive, dynamic, and multi-objective features. In this study, an inexact double-sided fuzzy chance-constrained programming (IDFCCP) model was developed and applied to a hypothetical case of regional air quality management. The results indicated that the proposed IDFCCP improved upon the existing ILP and DFCCP approaches; the fuzzy confidences at different levels could be analysed with varied reliability scenarios, making it possible to handle fuzzy uncertainties originating from both sides of the model constraints; other uncertain parameters could be expressed in terms of discrete intervals. The trade-off between system economy and reliability could be analysed by decision makers according to their preferences. The study results demonstrated that the proposed method could help decision makers identify desired policies under various environmental, economic, system-feasibility and system-reliability constraints.