Abstract
Job Shop Scheduling is an important combinatorial optimisation problem in practice. It usually contains many (four or more) potentially conflicting objectives such as makespan and mean weighted tardiness. On the other hand, evolving dispatching rules using genetic programming has demonstrated to be a promising approach to solving job shop scheduling due to its flexibility and scalability. In this paper, we aim to solve many-objective job shop scheduling with genetic programming and NSGA-III. However, NSGA-III is originally designed to work with uniformly distributed reference points which do not match well with the discrete and non-uniform Pareto front in job shop scheduling problems, resulting in many useless points during evolution. These useless points can significantly affect the performance of NSGA-III and genetic programming. To address this issue and inspired by particle swarm optimisation, a new reference point adaptation mechanism has been proposed in this paper. Experiment results on many-objective benchmark job shop scheduling instances clearly show that prominent improvement in performance can be achieved upon using our reference point adaptation mechanism in NSGA-III and genetic programming.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Błażewicz, J., Domschke, W., Pesch, E.: The job shop scheduling problem: conventional and new solution techniques. Eur. J. Oper. Res. 93(1), 1–33 (1996)
Branke, J., Nguyen, S., Pickardt, C., Zhang, M.: Automated design of production scheduling heuristics: a review. IEEE Trans. Evol. Comput. 20(1), 110–124 (2016)
Burke, E.K., Hyde, M.R., Kendall, G., Ochoa, G., Ozcan, E., Woodward, J.R.: Exploring hyper-heuristic methodologies with genetic programming. In: Mumford, C.L., Jain, L.C. (eds.) Computational Intelligence: Collaboration, Fusion and Emergence. ISRL, vol. 1, pp. 177–201. Springer, Heidelberg (2009). doi:10.1007/978-3-642-01799-5_6
Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6, 182–197 (2002)
Deb, K., Jain, H.: An evolutionary many-objective optimization algorithm using reference-point-based nondominated sorting approach, part I: solving problems with box constraints. IEEE Trans. Evol. Comput. 18(4), 577–601 (2014)
Eberhart, R., Kennedy, J.: A new optimizer using particle swarm theory. In: Proceedings of 6th International Symposium on Micro Machine and Human Science, MHS 1995, pp. 39–43. IEEE (1995)
Jain, H., Deb, K.: An evolutionary many-objective optimization algorithm using reference-point based nondominated sorting approach, part II: handling constraints and extending to an adaptive approach. IEEE Trans. Evol. Comput. 18(4), 602–622 (2014)
Masood, A., Mei, Y., Chen, G., Zhang, M.: Many-objective genetic programming for job-shop scheduling. In: IEEE WCCI 2016 Conference Proceedings. IEEE (2016)
Nguyen, S., Zhang, M., Johnston, M., Tan, K.C.: Dynamic multi-objective job shop scheduling: a genetic programming approach. In: Uyar, A.S., Ozcan, E., Urquhart, N. (eds.) Automated Scheduling and Planning. SCI, vol. 505, pp. 251–282. Springer, Heidelberg (2013). doi:10.1007/978-3-642-39304-4_10
Owen, A., Harvey, I.: Adapting particle swarm optimisation for fitness landscapes with neutrality. In: IEEE Swarm Intelligence Symposium. IEEE (2007)
Park, J., Nguyen, S., Zhang, M., Johnston, M.: Evolving ensembles of dispatching rules using genetic programming for job shop scheduling. In: Machado, P., Heywood, M.I., McDermott, J., Castelli, M., García-Sánchez, P., Burelli, P., Risi, S., Sim, K. (eds.) EuroGP 2015. LNCS, vol. 9025, pp. 92–104. Springer, Heidelberg (2015). doi:10.1007/978-3-319-16501-1_8
Pinedo, M.L.: Scheduling: Theory, Algorithms, and Systems. Springer Science & Business Media, New York (2012)
Taillard, E.: Benchmarks for basic scheduling problems. Eur. J. Oper. Res. 64(2), 278–285 (1993)
Zhang, Q., Zhou, A., Zhao, S., Suganthan, P.N., Liu, W., Tiwari, S.: Multiobjective optimization test instances for the CEC 2009 special session and competition. University of Essex, Colchester, UK and Nanyang Technological University, Singapore, special session on performance assessment of multi-objective optimization algorithms, Technical report pp. 1–30 (2008)
Zitzler, E., Laumanns, M., Thiele, L.: SPEA2: Improving the strength Pareto evolutionary algorithm. In: EUROGEN 2001. Evolutionary Methods for Design, Optimization and Control with Applications to Industrial Problems, pp. 95–100 (2002)
Zitzler, E., Thiele, L., Laumanns, M., Fonseca, C.M., Da Fonseca, V.G.: Performance assessment of multiobjective optimizers: an analysis and review. IEEE Trans. Evol. Comput. 7(2), 117–132 (2003)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Masood, A., Mei, Y., Chen, G., Zhang, M. (2017). A PSO-Based Reference Point Adaption Method for Genetic Programming Hyper-Heuristic in Many-Objective Job Shop Scheduling. In: Wagner, M., Li, X., Hendtlass, T. (eds) Artificial Life and Computational Intelligence. ACALCI 2017. Lecture Notes in Computer Science(), vol 10142. Springer, Cham. https://doi.org/10.1007/978-3-319-51691-2_28
Download citation
DOI: https://doi.org/10.1007/978-3-319-51691-2_28
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-51690-5
Online ISBN: 978-3-319-51691-2
eBook Packages: Computer ScienceComputer Science (R0)