YJYuling Jiao

Yuling Jiao

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Yuling Jiao has a total of 25 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • A discrete hybrid artificial fish swarm algorithm for mixed-model parallel two-sided assembly line balancing problems

    by Yuling Jiao, Xinyue Su, Lijuan Yu, Xue Deng, Yang Wang

    With the diversification of market demand, various mixed-model production methods have been widely adopted. Aiming to address the joint optimisation of mixed-model and parallel two-sided assembly line balance, a joint optimisation model of mixed-model and parallel two-sided assembly line balance is established. A discrete hybrid artificial fish swarm algorithm based on the genetic algorithm with crossover and mutation rules is proposed to solve this model. By computing 25 groups of classical examples, the results are compared with those of other heuristic algorithms and the mixed-model two-sided assembly line balancing problem; Comparison results show that the discrete hybrid artificial fish swarm algorithm is competitive in solving this problem, verifying the effectiveness of the model and algorithm; The balancing results of the parallel two-sided assembly line are superior to those of the two-sided assembly line, which verifies the effectiveness of the multi-line synergy effect in the parallel two-sided assembly line.

  • Modeling and balancing of parallel U-shaped assembly line based on improved genetic algorithms

    by Yu-Ling Jiao, Lujiao Huang, Binjie Xu, Yang Wang, Xinyue Su

    Aiming at the improvement of the efficiency of the assembly line in the intelligent manufacturing field, a parallel U-shaped assembly line balancing problem (PUALBP) appears. In this paper, a mathematical model of the PUALBP-I is established, and an improved genetic algorithm (IGA) is innovatively designed based on the allocation strategy. Combined with 56 classic examples, the IGA is used to solve the mathematical models of SUAL and PUAL respectively, and the balance results and the balance effect evaluation indicators are obtained. The comparison with Parallel U-line Heuristic (PUH) shows that the results of PUAL are better than SUAL, and verifies that the IGA is effective. The results demonstrate that the IGA in calculating large-scale problems is superior to the small-scale problems, which provides a useful reference for solving PUALBP.


  • Open Access

    Uncertain Multi-Objective Hazardous Materials Transport Route Planning Considering Resilience and Low–Carbon

    by Zhanzhong Wang, Yan Wang, Yuling Jiao

    Hazardous material transport accidents are events with low probability and high consequence risk. With the increase in the proportion of hazardous materials transported on domestic roads, increasing number of scholars have begun to study this field. In this study, a multi-objective hazardous materials transport route planning model considering road traffic resilience and low carbon, which considers the uncertainty of demand and time and is under the limit of the time window. It transports many types of hazardous materials from multiple suppliers to multiple retails with the three goals (transportation cost, risk and carbon emission). This model fills the gap in the research on hazardous materials transportation in the field of low carbon, and this is the first time that road traffic resilience is considered in the transport of hazardous materials as one of the weight factors of risk calculation. We designed a improved ant colony optimization algorithm (ACO) to obtain the pareto optimal solution set. We compare the improved ACO with genetic algorithm and simulated annealing algorithm. The results show that the improved ACO has better solution quality and solution space, which verifies the validity and reliability of the improved ACO.


  • Open Access

    Balancing a U-Shaped Assembly Line with a Heuristic Algorithm Based on a Comprehensive Rank Value

    by Yuling Jiao, Nan Cao, Jin Li, Lin Li, Xue Deng

    An aim of sustainable development of the manufacturing industry is to reduce the idle time in the product-assembly process and improve the balance efficiency of the assembly line. A priority relationship diagram is obtained on an existing assembly line in the laboratory by measuring the task time of the chassis model, analyzing the product structure, and designing the assembly process. The type-E balance model of the U-shaped assembly line is established and solved by a heuristic algorithm based on the comprehensive rank value. The type-E balance problem of the U-shaped assembly-line plan of the chassis model is obtained, and the production line layout is planned. Combining instances to compare the results of the heuristic algorithm, genetic algorithm, and simulated annealing, comparison of the results shows that the degree of load balancing is slightly higher than genetic algorithm and simulated annealing. The balance efficiencies obtained by the heuristic algorithm are smaller than the genetic algorithm and simulated annealing. The calculation time is significantly less than the genetic algorithm and simulated annealing, and the scale of instances has little effect on the calculation time. The results verify that the model and the algorithm are effective. This study provides a reference for the entire process of the U-shaped assembly-line, type-E balance and the assembly products in laboratories.


  • Balancing of parallel U-shaped assembly lines with a heuristic algorithm based on bidirectional priority values

    by Yuling Jiao, Xue Deng, Mingjuan Li, Xiaocui Xing, Binjie Xu

    Aiming at improving assembly line efficiency and flexibility, a balancing method of parallel U-shaped assembly line system is proposed. Based on the improved product priority diagram, the bidirectional priority value formula is obtained. Then, assembly lines are partitioned into z-q partitions and workstations are defined. After that, the mathematical model of the parallel U-shaped assembly line balancing problem is established. A heuristic algorithm based on bidirectional priority values is used to solve explanatory examples and test examples. It can be seen from the results and the effect indicators of the assembly line balancing problem that the heuristic algorithm is suitable for large balancing problems. The proposed method has higher calculation accuracy and shorter calculation time. The balancing effect of the parallel U-shaped assembly line is better than that of single U-shaped assembly line, which verifies the superiority of the parallel U-type assembly line and effectiveness of the proposed method. It provides a theoretical and practical reference for parallel U-type assembly line balancing problem.


  • Open Access

    Tandem Design of Bus Priority Based on a Pre-Signal System

    by Yutong Sun, Jin Li, Xiaozhong Wei, Yuling Jiao

    Giving buses priority is an important measure to improve the attractiveness of public transport and to reduce urban traffic congestion. Reducing bus service delays as much as possible will have a positive impact on urban traffic. Based on the pre-signal system, a bus at an intersection with a left-turn special phase is optimized by “tandem design”. The design model is applied to the entrance of an intersection to study the process of vehicle arrival and departure at the main signal and pre-signal, and to calculate and analyze the delay changes of buses, straight social vehicles (meaning vehicles other than those required to be open to traffic) and left-turn vehicles before and after the adoption of “tandem design”. The results show that when the vehicle capacity at the intersection is saturated, the delays to buses and the delays of left-turn vehicles will be significantly reduced once the “tandem design” is adopted at the entrance of a cross intersection with a special left-turn phase. However, it has little effect on the delay of straight-on vehicles; with this system, the total delay experienced by straight vehicles will be reduced to one cycle.


  • Assembly line balance research methods, literature and development review

    by Yu-Ling Jiao, Han-Qi Jin, Xiao-Cui Xing, Ming-Juan Li, Xin-Ran Liu

    With the continuous upgrading of the manufacturing system, the assembly line balancing problem (ALBP) is gradually complicated, and the researches are constantly deepened in the application theory and solution methods. In order to clarify the research direction and development status of assembly line balancing, 89 articles are read and studied. We classify ALBPs to construct the network structure of research from horizontal classification and vertical thinking. The ALBP framework is horizontally given according to the number of models (i.e. the number of products), the layout shape of the assembly line, and the data of task time. The “seven steps for scientific paper” is vertically proposed according to the research steps to comb the research path of scientific and technological literature. The horizontal and vertical extension crosses and constructs the network structure of the ALBP. Any horizontal problem intersects with any step of the vertical “seven steps for scientific paper” to form a research point. We analyze 89 articles according to the development path from the straight line to U-shaped line and then to two-sided U-shaped/parallel U-shaped assembly line, summarize the research algorithm of assembly line balance and count the number of articles, and point out the latest research direction and algorithm development trend of assembly line balance.


  • Multi-objective storage location allocation optimization and simulation analysis of automated warehouse based on multi-population genetic algorithm

    by Yu-Ling Jiao, Xiao-Cui Xing, Peng Zhang, Liang-Cheng Xu, Xin-Ran Liu

    Aiming at the requirement of working efficiency and security of automated warehouse and taking the operation time of outbound–inbound, the equivalent center of gravity of overall shelf and the degree of relative accumulation of related products as the multi-objective functions, the mathematical model is constructed for multi-objective storage location allocation optimization. According to the simple weighted genetic algorithm, it is easily prone to the problem of immature convergence when solving multi-objective programming problems. So, the multi-population genetic algorithm is proposed to solve the mathematical model of storage location allocation optimization. Combining with the experiment data of toy car assembly and automated warehouse, the results of the automated warehouse storage location allocation are obtained. FlexSim dynamic simulation model is established based on the storage location allocation solution, the physical parameters of automated warehouse and the experimental requirements plan of vehicle model assembly. The operation effect of the model and the utilization rate of the equipment are analyzed. The result of multi-population genetic algorithm is more reasonable and effective. It is proved that the result of multi-population genetic algorithm is superior to the result of simple weighted genetic algorithm, which provides an effective method for storage location allocation optimization and outbound–inbound dynamic simulation.