Skip to main content
SpringerLink
Log in

Simulated Annealing Algorithms for the Heterogeneous Robots Task Scheduling Problem in Heterogeneous Robotic Order Fulfillment Systems

  • Conference paper
  • First Online:
Intelligent Autonomous Systems 16 (IAS 2021)

Part of the book series: Lecture Notes in Networks and Systems ((LNNS,volume 412))

Included in the following conference series:

Abstract

In the Heterogeneous Robots Task Scheduling (HTS) problem, multiple transport robots and multiple pick robots collaborate to achieve complex-schedule order-fulfillment tasks, and we want to obtain the collective time-extended task schedule with the minimization of makespan. As a typical strongly NP-hard integrated routing and scheduling problem, metaheuristics are almost the only way to obtain near-optimal solutions within reasonable computation time. We design simulated annealing algorithms to improve initial solutions, and test three neighborhood operators. Extensive computational results demonstrate that simulated annealing could improve the solution quality for most problem instances, and the adjacent pairwise interchange (API) neighborhood operator is highly recommended.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 189.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 249.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Abreu, L.R., Cunha, J.O., Prata, B.A., Framinan, J.M.: A genetic algorithm for scheduling open shops with sequence-dependent setup times. Comput. Oper. Res. 113, 104793 (2020)

    Article  MathSciNet  Google Scholar 

  2. Andresen, M., Bräsel, H., Mörig, M., Tusch, J., Werner, F., Willenius, P.: Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop. Math. Comput. Model. 48(7–8), 1279–1293 (2008)

    Article  MathSciNet  Google Scholar 

  3. Andresen, M., Brsel, H., Plauschin, M., Werner, F.: Using Simulated Annealing for Open Shop Scheduling with Sum Criteria. Simulated Annealing (2008)

    Google Scholar 

  4. Bräsel, H.: Matrices in shop scheduling problems. In: Perspectives on Operations Research, pp. 17–41. DUV (2007)

    Google Scholar 

  5. Bräsel, H., Herms, A., Mörig, M., Tautenhahn, T., Tusch, J., Werner, F.: Heuristic constructive algorithms for open shop scheduling to minimize mean flow time. Eur. J. Oper. Res. 189(3), 856–870 (2008)

    Article  MathSciNet  Google Scholar 

  6. Chernykh, I., Kononov, A., Sevastyanov, S.: Efficient approximation algorithms for the routing open shop problem. Comput. Oper. Res. 40(3), 841–847 (2013)

    Article  MathSciNet  Google Scholar 

  7. Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671–680 (1983)

    Article  MathSciNet  Google Scholar 

  8. Korsah, G.A., Stentz, A., Dias, M.B.: A comprehensive taxonomy for multi-robot task allocation. Int. J. Robot. Res. 32(12), 1495–1512 (2013)

    Article  Google Scholar 

  9. Mejía, G., Yuraszeck, F.: A self-tuning variable neighborhood search algorithm and an effective decoding scheme for open shop scheduling problems with travel/setup times. Eur. J. Oper. Res. 285(2), 484–496 (2020)

    Article  MathSciNet  Google Scholar 

  10. Naderi, B., Fatemi Ghomi, S.M., Aminnayeri, M., Zandieh, M.: A contribution and new heuristics for open shop scheduling. Comput. Oper. Res. 37(1), 213–221 (2010)

    Article  MathSciNet  Google Scholar 

  11. Nunes, E., Manner, M., Mitiche, H., Gini, M.: A taxonomy for task allocation problems with temporal and ordering constraints. Robot. Auton. Syst. 90, 55–70 (2017)

    Article  Google Scholar 

  12. Pinedo, M.L.: Scheduling. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-26580-3

    Book  MATH  Google Scholar 

  13. Scholz, A., Schubert, D., Wäscher, G.: Order picking with multiple pickers and due dates - simultaneous solution of order batching, batch assignment and sequencing, and picker routing problems. Eur. J. Oper. Res. 263(2), 461–478 (2017)

    Article  MathSciNet  Google Scholar 

  14. Uchoa, E., Pecin, D., Pessoa, A., Poggi, M., Vidal, T., Subramanian, A.: New benchmark instances for the capacitated vehicle routing problem. Eur. J. Oper. Res. 257(3), 845–858 (2017)

    Article  MathSciNet  Google Scholar 

  15. Wang, H., Chen, W., Wang, J.: Heterogeneous multi-agent routing strategy for robot-and-picker-to-good order fulfillment system. In: Strand, M., Dillmann, R., Menegatti, E., Ghidoni, S. (eds.) IAS 2018. AISC, vol. 867, pp. 237–249. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-01370-7_19

    Chapter  Google Scholar 

  16. Wang, H., Chen, W., Wang, J.: Coupled task scheduling for heterogeneous multi-robot system of two robot types performing complex-schedule order fulfillment tasks. Robot. Auton. Syst. 131(2), 103560 (2020). http://repositorio.unan.edu.ni/2986/1/5624.pdf

Download references

Acknowledgment

This work is supported by the National Natural Science Foundation of China (Grant U1813206) and the National Key R&D Program of China (Grant 2017YFB1303600).

Author information

Authors and Affiliations

  1. Institute of Medical Robotics and Department of Automation, Shanghai Jiao Tong University, and Key Laboratory of System Control and Information Processing, Ministry of Education, Shanghai, 200240, China

    Hanfu Wang & Weidong Chen

Authors
  1. Hanfu Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Weidong Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Weidong Chen .

Editor information

Editors and Affiliations

  1. Department of Mechanical Engineering, National University of Singapore, Singapore, Singapore

    Marcelo H. Ang Jr

  2. Department of Precision Engineering, University of Tokyo, Tokyo, Japan

    Hajime Asama

  3. Singapore Institute of Manufacturing Technology, Singapore, Singapore

    Wei Lin

  4. Engineering Product Development, Singapore University of Technology and Design, Singapore, Singapore

    Shaohui Foong

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Wang, H., Chen, W. (2022). Simulated Annealing Algorithms for the Heterogeneous Robots Task Scheduling Problem in Heterogeneous Robotic Order Fulfillment Systems. In: Ang Jr, M.H., Asama, H., Lin, W., Foong, S. (eds) Intelligent Autonomous Systems 16. IAS 2021. Lecture Notes in Networks and Systems, vol 412. Springer, Cham. https://doi.org/10.1007/978-3-030-95892-3_21

Download citation

Publish with us

Policies and ethics

Search

Navigation