Combinatorial Optimization Method Considering Distance in Scheduling Problem

  • Yuta ObinataEmail author
  • Kenichi Tamura
  • Junichi Tsuchiya
  • Keiichiro Yasuda
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 942)


In this paper, we focus on the idea of integral designing of problems/methods/distances in metaheuristics for combinatorial optimization. The above idea is important in combinatorial optimization, where it is necessary to consider the distance according to each problem. Furthermore, the idea is particularly important for methods that use distance for the movement strategy, which was proposed the authors. Therefore, as a practical example of the above idea, and we proposed a method which is introduced a search strategy with more consideration of distance. We report that, when considering the distance, the proposed method has better search performance than the previous method in the flow shop scheduling problem.


Combinatorial optimization Metaheuristics Distance Scheduling problem 


  1. 1.
    Kennedy, J., Eberhart, R.C.: Swarm Intelligence. Morgan Kaufmann, San Francisco (2001)Google Scholar
  2. 2.
    Yang, X.-S.: Firefly algorithms for multimodal optimization. In: Watanabe, O., Zeugmann, T. (eds.) Stochastic Algorithms: Foundations and Applications. SAGA 2009. Lecture Notes in Computer Science, vol. 5792, pp. 169–178. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  3. 3.
    Ochiai, H., Tamura, K., Yasuda, K.: Combinatorial optimization method based on hierarchical structure in solution space. In: 2013 IEEE International Conference on Systems. Man, and Cybernetics, pp. 3543–3548. IEEE Press, New York (2013)Google Scholar
  4. 4.
    Yaguchi, K., Tamura, K., Yasuda, K., Ishigame, A.: Basic study of proximate optimality principle based combinatorial optimization method. In: 2011 IEEE International Conference on Systems. Man, and Cybernetics, pp. 1753–1758. IEEE Press, New York (2011)Google Scholar
  5. 5.
    Glover, F., Laguna, M.: Tabu Search. Kluwer Academic, Massachusetts (2002)zbMATHGoogle Scholar
  6. 6.
    Reeves, C.R.: Fitness landscapes. In: Burke, E.K., Kendall, G. (eds.) Search Methodologies. Springer, Massachusetts (2005)Google Scholar
  7. 7.
    Bożejko, W., Smutnicki, C., Uchronski, M., Wodecki, M.: Big valley in scheduling problems landscape –Metaheuristics with reduced searching area. In: 2017 22nd International Conference on Methods and Models in Automation and Robotics (MMAR), pp. 458–462. IEEE Press, New York (2017)Google Scholar
  8. 8.
    Yasuda, K., Jinnai, H., Ishigame, A.: Multi-point combinatorial optimization method with distance based interaction. IEEJ Trans. EIS 130, 6–13 (2010). (in Japanese)CrossRefGoogle Scholar
  9. 9.
    Morita, M., Tamura, K., Yasuda, K.: Multi-point search combinatorial optimization method based on neighborhood search using evaluation of big valley structure. In: 2015 IEEE International Conference on Systems, Man, and Cybernetics, pp. 2835–2840. IEEE Press, New York (2015)Google Scholar
  10. 10.
    Diaconis, P.: Group Representations in Probability and Statistics. Lecture Notes-Monograph Series, vol. 11, pp. I–192 (1988)Google Scholar
  11. 11.

Copyright information

© Springer Nature Switzerland AG 2020

Authors and Affiliations

  • Yuta Obinata
    • 1
    Email author
  • Kenichi Tamura
    • 1
  • Junichi Tsuchiya
    • 1
  • Keiichiro Yasuda
    • 1
  1. 1.Department of Electrical and Electronic EngineeringTokyo Metropolitan UniversityHachioji-shiJapan

Personalised recommendations