Skip to main content

Advertisement

Springer Nature Link
Log in

A hybrid PSO/SA algorithm for bi-criteria stochastic line balancing with flexible task times and zoning constraints

  • Published:
Journal of Intelligent Manufacturing Aims and scope Submit manuscript

Abstract

This paper addresses a stochastic assembly line balancing problem with flexible task times and zoning constraints. In this problem, task times are regarded as interval variables with given lower and upper bounds. Machines can compress processing times of tasks to improve the line efficiency, but it may increase the equipment cost, which is defined via a negative linear function of task times. Thus, it is necessary to make a compromise between the line efficiency and the equipment cost. To solve this problem, a bi-objective chance-constrained mixed 0–1 programming model is developed to simultaneously minimize the cycle time and the equipment cost. Then, a hybrid Particle swarm optimization algorithm is proposed to search a set of Pareto-optimal solutions, which employs the simulated annealing as a local search strategy. The Taguchi method is used to investigate the influence of parameters, and accordingly a suitable parameter setting is suggested. Finally, the comparative results show that the proposed algorithm outperforms the existing algorithms by obtaining better solutions within the same running time.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5

Similar content being viewed by others

References

  • Bandyopadhyay, S., & Bhattacharya, R. (2013). Applying modified NSGA-II for bi-objective supply chain problem. Journal of Intelligent Manufacturing, 24(4), 707–716.

    Article  Google Scholar 

  • Battaïa, O., & Dolgui, A. (2013). A taxonomy of line balancing problems and their solution approaches. International Journal of Production Economics, 142(2), 259–277.

    Article  Google Scholar 

  • Becker, C., & Scholl, A. (2006). A survey on problems and methods in generalized assembly line balancing. European Journal of Operational Research, 168(3), 694–715.

    Article  Google Scholar 

  • Boysen, N., Fliedner, M., & Scholl, A. (2007a). A classification of assembly line balancing problems. European Journal of Operational Research, 183(2), 674–693.

    Article  Google Scholar 

  • Cheshmehgaz, H. R., Islam, M. N., & Desa, M. I. (2014). A polar-based guided multi-objective evolutionary algorithm to search for optimal solutions interested by decision-makers in a logistics network design problem. Journal of Intelligent Manufacturing, 25(4), 699–726.

    Article  Google Scholar 

  • Chutima, P., & Chimklai, P. (2012). Multi-objective two-sided mixed-model assembly line balancing using particle swarm optimisation with negative knowledge. Computers Industrial Engineering, 62(1), 39–55.

    Article  Google Scholar 

  • Chutima, P., & Kid-Arn, S. (2013). PSONK: Particle swarm optimization with negative knowledge for multi-objective u-shaped assembly lines balancing with parallel workstations. Journal of Advanced Manufacturing Systems, 12(01), 15–41.

    Article  Google Scholar 

  • Deb, K., Pratap, A., Agarwal, S., & Meyarivan, T. (2002). A fast and elitist multiobjective genetic algorithm: Nsga-II. IEEE Transactions on Evolutionary Computation, 6(2), 182–197.

    Article  Google Scholar 

  • Dong, J., Zhang, L., Xiao, T., & Mao, H. (2014). Balancing and sequencing of stochastic mixed-model assembly u-lines to minimise the expectation of work overload time. International Journal of Production Research, 52(24), 7529–7548.

    Article  Google Scholar 

  • Dou, J., Li, J., & Su, C. (2013). A novel feasible task sequence-oriented discrete particle swarm algorithm for simple assembly line balancing problem of type 1. The International Journal of Advanced Manufacturing Technology, 69(9–12), 2445–2457.

    Article  Google Scholar 

  • Erel, E., Sabuncuoglu, I., & Sekerci, H. (2005). Stochastic assembly line balancing using beam search. International Journal of Production Research, 43(7), 1411–1426.

    Article  Google Scholar 

  • Fattahi, P., Roshani, A., & Roshani, A. (2011). A mathematical model and ant colony algorithm for multi-manned assembly line balancing problem. The International Journal of Advanced Manufacturing Technology, 53(1–4), 363–378.

    Article  Google Scholar 

  • Gamberini, R., Gebennini, E., Grassi, A., & Regattieri, A. (2009). A multiple single-pass heuristic algorithm solving the stochastic assembly line rebalancing problem. International Journal of Production Research, 47(8), 2141–2164.

    Article  Google Scholar 

  • Hamta, N., Ghomi, S. F., Jolai, F., & Bahalke, U. (2011). Bi-criteria assembly line balancing by considering flexible operation times. Applied Mathematical Modelling, 35(12), 5592–5608.

    Article  Google Scholar 

  • Hamta, N., Ghomi, S. F., Jolai, F., & Shirazi, M. A. (2013). A hybrid pso algorithm for a multi-objective assembly line balancing problem with flexible operation times, sequence-dependent setup times and learning effect. International Journal of Production Economics, 141(1), 99–111.

    Article  Google Scholar 

  • Hazır, O., Delorme, X., & Dolgui, A. (2014). A survey on cost and profit oriented assembly line balancing. In The 19th world congress of The international federation of automatic control, (pp. 24–29).

  • Hiremath, N. C., Sahu, S., & Tiwari, M. K. (2013). Multi objective outbound logistics network design for a manufacturing supply chain. Journal of Intelligent Manufacturing, 24(6), 1071–1084.

    Article  Google Scholar 

  • Hwang, R. K., Katayama, H., & Gen, M. (2008). U-shaped assembly line balancing problem with genetic algorithm. International Journal of Production Research, 46(16), 4637–4649.

    Article  Google Scholar 

  • Kenndy, J., & Eberhart, R. (1995). Particle swarm optimization. In Proceedings of IEEE International Conference on Neural Networks, vol. 4, (pp. 1942–1948).

  • Liang, C. J., Chen, M., Gen, M., & Jo, J. (2014). A multi-objective genetic algorithm for yard crane scheduling problem with multiple work lines. Journal of Intelligent Manufacturing, 25(5), 1013–1024.

    Article  Google Scholar 

  • Ma, W., Wang, M., & Zhu, X. (2015). Hybrid particle swarm optimization and differential evolution algorithm for bi-level programming problem and its application to pricing and lot-sizing decisions. Journal of Intelligent Manufacturing, 26(3), 471–483.

    Article  Google Scholar 

  • Mazdeh, M. M., Zaerpour, F., Zareei, A., & Hajinezhad, A. (2010). Parallel machines scheduling to minimize job tardiness and machine deteriorating cost with deteriorating jobs. Applied Mathematical Modelling, 34(6), 1498–1510.

    Article  Google Scholar 

  • Montgomery, D. C. (2008). Design and analysis of experiments. Hoboken, NJ: John Wiley & Sons.

  • Nearchou, A. C. (2008). Multi-objective balancing of assembly lines by population heuristics. International Journal of Production Research, 46(8), 2275–2297.

    Article  Google Scholar 

  • Nearchou, A. C. (2011). Maximizing production rate and workload smoothing in assembly lines using particle swarm optimization. International Journal of Production Economics, 129(2), 242–250.

    Article  Google Scholar 

  • Okabe, T., Jin, Y., & Sendhoff, B. (2003). A critical survey of performance indices for multi-objective optimisation. In Proceedings of the Congress on Evolutionary Computation, IEEE, vol. 2, (pp. 878–885).

  • Özcan, U., & Toklu, B. (2010). Balancing two-sided assembly lines with sequence-dependent setup times. International Journal of Production Research, 48(18), 5363–5383.

    Article  Google Scholar 

  • Özcan, U., Kellegöz, T., & Toklu, B. (2011). A genetic algorithm for the stochastic mixed-model u-line balancing and sequencing problem. International Journal of Production Research, 49(6), 1605–1626.

    Article  Google Scholar 

  • Purnomo, H. D., Wee, H. M., & Rau, H. (2013). Two-sided assembly lines balancing with assignment restrictions. Mathematical and Computer Modelling, 57(1), 189–199.

    Article  Google Scholar 

  • Rada-Vilela, J., Chica, M., Cordón, Ó., & Damas, S. (2013). A comparative study of multi-objective ant colony optimization algorithms for the time and space assembly line balancing problem. Applied Soft Computing, 13(11), 4370–4382.

    Article  Google Scholar 

  • Rashid, M. F. F., Hutabarat, W., & Tiwari, A. (2012). A review on assembly sequence planning and assembly line balancing optimisation using soft computing approaches. The International Journal of Advanced Manufacturing Technology, 59(1–4), 335–349.

    Article  Google Scholar 

  • Salveson, M. E. (1955). The assembly line balancing problem. Journal of Industrial Engineering, 6(3), 18–25.

    Google Scholar 

  • Scholl, A., & Becker, C. (2006). State-of-the-art exact and heuristic solution procedures for simple assembly line balancing. European Journal of Operational Research, 168(3), 666–693.

    Article  Google Scholar 

  • Scholl, A., Fliedner, M., & Boysen, N. (2010). Absalom: Balancing assembly lines with assignment restrictions. European Journal of Operational Research, 200(3), 688–701.

    Article  Google Scholar 

  • Sivasankaran, P., & Shahabudeen, P. (2014). Literature review of assembly line balancing problems. The International Journal of Advanced Manufacturing Technology, 73(9–12), 1665–1694.

    Article  Google Scholar 

  • Tasan, S. O., & Tunali, S. (2008). A review of the current applications of genetic algorithms in assembly line balancing. Journal of Intelligent Manufacturing, 19(1), 49–69.

    Article  Google Scholar 

  • Tseng, H. E., Chen, M. H., Chang, C. C., & Wang, W. P. (2008). Hybrid evolutionary multi-objective algorithms for integrating assembly sequence planning and assembly line balancing. International Journal of Production Research, 46(21), 5951–5977.

  • Wang, C. H., & Tsai, S. W. (2014). Optimizing bi-objective imperfect preventive maintenance model for series-parallel system using established hybrid genetic algorithm. Journal of Intelligent Manufacturing, 25(3), 603–616.

    Article  Google Scholar 

  • Yuan, B., Zhang, C., & Shao, X. (2015). A late acceptance hill-climbing algorithm for balancing two-sided assembly lines with multiple constraints. Journal of Intelligent Manufacturing, 26(1), 159–168.

    Article  Google Scholar 

Download references

Acknowledgments

This research was supported in part by National Science and Technology Support Program under Grant 2012BAF15G01.

Author information

Authors and Affiliations

  1. State CIMS Engineering Research Center, Department of Automation, Tsinghua University, Beijing, 100084, People’s Republic of China

    Jietao Dong, Linxuan Zhang & Tianyuan Xiao

Authors
  1. Jietao Dong
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Linxuan Zhang
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Tianyuan Xiao
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Jietao Dong.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Dong, J., Zhang, L. & Xiao, T. A hybrid PSO/SA algorithm for bi-criteria stochastic line balancing with flexible task times and zoning constraints. J Intell Manuf 29, 737–751 (2018). https://doi.org/10.1007/s10845-015-1126-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10845-015-1126-5

Keywords