Scheduling multiple servers to facilitate just-in-time part-supply in automobile assembly lines

2018 ◽  
Vol 38 (3) ◽  
pp. 347-360 ◽  
Author(s):  
Tao Peng ◽  
Binghai Zhou
Keyword(s):  
Local Search ◽  
Ant Colony Optimization ◽  
Ant Colony ◽  
Mixed Integer ◽  
Inventory Level ◽  
Just In Time ◽  
Tree Search ◽  
Assembly Lines ◽  
Content Type ◽  
Automobile Assembly

Purpose With regard to product variety and cost competition, just-in-time (JIT) part-supply has become a critical issue in automobile assembly lines (AALs). This paper aims to investigate a multiple server scheduling problem (MSSP) encountered in the JIT part-supply process of AALs. Parts are stored in boxes and allotted from the JIT-supermarket to consumptive stations with a multiple server system. The schedule is to dispatch and sequence material boxes on each server for minimizing line-side inventory levels. Design/methodology/approach A mixed integer linear programming (MILP) model is established to formulate the proposed MSSP to pave the way for CPLEX procedure. Considering the high complexity of MSSP, a hybrid ant colony optimization (HACO) approach is developed by integrating basic ant colony optimization (ACO) with local optimizers that comprise of a fast local search and a tailored breadth-first tree search method. Findings Both CPLEX and HACO approach are capable of solving small-scale instances to optimality within reasonable computation time. The proposed HACO has been well enhanced with the embedded fast local search and tailored breadth-first tree search, and it performs robustly in a statistically significant manner when applied to real-world scale instances. Originality/value No stock-outs constraints and weighted line-side inventory level are considered in this paper, and the MSSP is solved satisfactorily to facilitate an efficient JIT part-supply of the AAL. In terms of the algorithm design, a tree search-based local optimizer is embedded into ACO to combine the mechanisms of ACO and problem-specific optimization.

scholarly journals Scheduling Just-in-Time Transport Vehicles to Feed Parts for Mixed Model Assembly Lines

2020 ◽  
Vol 2020 ◽  
pp. 1-13 ◽  
Author(s):  
Yunfang Peng ◽  
Tian Zeng ◽  
Yajuan Han ◽  
Beixin Xia
Keyword(s):  
Large Scale ◽  
Assembly Line ◽  
Mixed Model ◽  
Programming Model ◽  
Primary Objective ◽  
Mixed Integer ◽  
Inventory Level ◽  
Just In Time ◽  
Time Model ◽  
Delivery Strategy

In order to solve the problem of vehicle scheduling to feed parts at automobile assembly line, this study proposes a just-in-time delivery method combined with the mode of material supermarket. A mixed integer linear programming model with the primary objective of using the least number of tow trains is constructed by considering capacity of vehicle and inventory levels of line. On the basis of the minimum number of tow trains, the schedule of each tour is reasonably planned to minimize inventory of assembly line, which is the secondary objective of the part supply problem. Additionally, a heuristic algorithm which can obtain a satisfactory solution in a short time is designed to solve large-scale problems after considering continuity and complexity of modern automobile production. Furthermore, some cases are analyzed and compared with the widely used periodic delivery strategy, and the feasibility of just-in-time model and algorithm is verified. The results reveal that just-in-time delivery strategy has more advantages in reducing inventory level than periodic delivery strategy.

A flexibility method for structural damage identification using continuous ant colony optimization

2015 ◽  
Vol 11 (2) ◽  
pp. 186-201 ◽  
Author(s):  
Maryam Daei ◽  
S. Hamid Mirmohammadi
Keyword(s):  
Experimental Data ◽  
Damage Detection ◽  
Ant Colony Optimization ◽  
Structural Damage ◽  
Optimization Problem ◽  
Ant Colony Algorithm ◽  
Ant Colony ◽  
Computational Time ◽  
Content Type ◽  
Flexibility Matrix

Purpose – The interest in the ability to detect damage at the earliest possible stage is pervasive throughout the civil engineering over the last two decades. In general, the experimental techniques for damage detection are expensive and require that the vicinity of the damage is known and readily accessible; therefore several methods intend to detect damage based on numerical model and by means of minimum experimental data about dynamic properties or response of damaged structures. The paper aims to discuss these issues. Design/methodology/approach – In this paper, the damage detection problem is formulated as an optimization problem such as to obtain the minimum difference between the numerical and experimental variables, and then a modified ant colony optimization (ACO) algorithm is proposed for solving this optimization problem. In the proposed algorithm, the structural damage is detected by using dynamically measured flexibility matrix, since the flexibility matrix of the structure can be estimated from only the first few modes. The continuous version of ACO is employed as a probabilistic technique for solving this computational problem. Findings – Compared to classical methods, one of the main strengths of this meta-heuristic method is the generally better robustness in achieving global optimum. The efficiency of the proposed algorithm is illustrated by numerical examples. The proposed method enables the deduction of the extent and location of structural damage, while using short computational time and resulting good accuracy. Originality/value – Finding accurate results by means of minimum experimental data, while using short computational time is the final goal of all researches in the structural damage detection methods. In this paper, it gains by applying flexibility matrix in the definition of objective function, and also via using continuous ant colony algorithm as a powerful meta-heuristic techniques in the constrained nonlinear optimization problem.

Optimal path search and control of mobile robot using hybridized sine-cosine algorithm and ant colony optimization technique

2020 ◽  
Vol 47 (4) ◽  
pp. 535-545
Author(s):  
Saroj Kumar ◽  
Dayal R. Parhi ◽  
Manoj Kumar Muni ◽  
Krishna Kant Pandey
Keyword(s):  
Mobile Robots ◽  
Ant Colony Optimization ◽  
Optimization Technique ◽  
Optimal Path ◽  
Ant Colony ◽  
Target Point ◽  
Multiple Mobile Robots ◽  
Content Type ◽  
Path Search ◽  
Sine Cosine Algorithm

Purpose This paper aims to incorporate a hybridized advanced sine-cosine algorithm (ASCA) and advanced ant colony optimization (AACO) technique for optimal path search with control over multiple mobile robots in static and dynamic unknown environments. Design/methodology/approach The controller for ASCA and AACO is designed and implemented through MATLAB simulation coupled with real-time experiments in various environments. Whenever the sensors detect obstacles, ASCA is applied to find their global best positions within the sensing range, following which AACO is activated to choose the next stand-point. This is how the robot travels to the specified target point. Findings Navigational analysis is carried out by implementing the technique developed here using single and multiple mobile robots. Its efficiency is authenticated through the comparison between simulation and experimental results. Further, the proposed technique is found to be more efficient when compared with existing methodologies. Significant improvements of about 10.21 per cent in path length are achieved along with better control over these. Originality/value Systematic presentation of the proposed technique attracts a wide readership among researchers where AI technique is the application criteria.

Sign in / Sign up

Export Citation Format

Share Document