Skip to main content

Research on Task Allocation Model of Takeaway Platform Based on RWS-ACO Optimization Algorithm

  • Conference paper
  • First Online:
Business Intelligence and Information Technology (BIIT 2021)

Part of the book series: Lecture Notes on Data Engineering and Communications Technologies ((LNDECT,volume 107))

  • 1100 Accesses

Abstract

This paper research the task distribution of the takeaway platform, builds a task distribution model for the takeaway platform, and proposes the roulette ant colony algorithm (RWS-ACO) that combines the roulette algorithm with the ant colony algorithm, then conducts simulation experiments to solve the simulation data. The distribution plan is obtained, which verifies the effectiveness of the model and algorithm and achieves a win-win situation for multiple parties in the distribution.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.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

Similar content being viewed by others

References

  1. Fu, D., Liu, Y.: Trust-aware task allocation in collaborative crowdsourcing model. Comput. J. 64(6), 929–940 (2021)

    Article  Google Scholar 

  2. Zhang, X., Su, J.: An approach to task recommendation in crowdsourcing based on 2-tuple fuzzy linguistic method. Kybernetes 47(8), 1623–1641 (2018)

    Article  Google Scholar 

  3. Li, B., Yang, X., Xuan, H.: A hybrid simulated annealing heuristic for multistage heterogeneours fleet scheduling with fleet sizing decisions. J. Adv. Transp. 2019, 1–19 (2019)

    Google Scholar 

  4. Alvarez, A., Munari, P.: An exact hybrid method for the vehicle routing problem with time windows and multiple deliverymen. Comput. Oper. Res. 83, 1–12 (2017)

    Article  MathSciNet  Google Scholar 

  5. Wang, J., Wang, J., Han, Q.: Multivehicle task assignment based on collaborative neurodynamic optimization with discrete hopfield networks. IEEE Trans. Neural Networks Learn. Syst. 1–13 (2021)

    Google Scholar 

  6. Pan, Q., Pan, T., Dong, H., Gao, Z.: Research on task assignment to minimize travel cost for spatio-temporal crowdsourcing. Wireless Com Network 2021, 59 (2021)

    Article  Google Scholar 

  7. Chen, X., Zhang, P., Du, G., Li, F.: A distributed method for dynamic multi-robot task allocation problems with critical time constraints. Robot. Auton. Syst. 118, 31–46 (2019)

    Article  Google Scholar 

  8. Fu, D., Liu, Y., Yan, Z.: Fairness of task allocation in crowdsourcing workflows. Math. Probl. Eng. 2021, 1–11 (2021)

    Google Scholar 

  9. Liang, D., Cao, W., Xu, Z., Wang, M.: A novel approach of two-stage three-way co-opetition decision for crowdsourcing task allocation scheme. Inf. Sci. 559, 191–211 (2021)

    Article  MathSciNet  Google Scholar 

  10. Miao, C., Chen, G., Yan, C., Wu, Y.: Path planning optimization of indoor mobile robot based on adaptive ant colony algorithm. Comput. Ind. Eng. 156, 107230 (2021)

    Article  Google Scholar 

  11. Xia, Y., Fu, Z.: Improved tabu search algorithm for the open vehicle routing problem with soft time windows and satisfaction rate. Cluster Comput. 22(1), 1–9 (2018)

    MathSciNet  Google Scholar 

  12. Liu, J., Xu, K.: Budget-aware online task assignment in spatial crowdsourcing. World Wide Web 23(1), 289–311 (2020)

    Article  Google Scholar 

  13. Song, T., Xu, K., Li, J., Li, Y., Tong, Y.: Multi-skill aware task assignment in real-time spatial crowdsourcing. GeoInformatica 24(1), 153–173 (2020)

    Article  Google Scholar 

  14. Li, Y., Fang, J., Zeng, Y., Maag, B., Tong, Y., Zhang, L.: Two-sided online bipartite matching in spatial data: experiments and analysis. GeoInformatica 24(1), 175–198 (2020)

    Article  Google Scholar 

Download references

Acknowledgment

This work is partly supported by the project supported by the National Social Science Foundation(16BJY125), Heilongjiang philosophy and social sciences research planning project(19JYB026), Key topics in 2020 of the 13th five year plan of Educa-tional Science in Heilongjiang Province(GJB1320276), Project supported by under-graduate teaching leading talent training program of Harbin University of Commerce (201907), Key project of teaching reform and teaching research of Harbin University of Commerce in 2020(HSDJY202005(Z)), Innovation and entrepreneurship project for college students of Harbin University of Commerce (202010240059), School level scientific research project of Heilongjiang Oriental University (HDFKY200202), Key entrusted projects of higher education teaching reform in 2020(SJGZ20200138).

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

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

Jianjun, L., Xiaodi, X., Yu, Y., Fang, Y. (2022). Research on Task Allocation Model of Takeaway Platform Based on RWS-ACO Optimization Algorithm. In: Hassanien, A.E., Xu, Y., Zhao, Z., Mohammed, S., Fan, Z. (eds) Business Intelligence and Information Technology. BIIT 2021. Lecture Notes on Data Engineering and Communications Technologies, vol 107. Springer, Cham. https://doi.org/10.1007/978-3-030-92632-8_74

Download citation

Publish with us

Policies and ethics