Towards Distributed Real-Time Coordination of Shoppers’ Routes in Smart Hypermarkets

  • Marin LujakEmail author
  • Arnaud Doniec
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11327)


In this paper, we consider the problem of route guidance for shoppers in crowded hypermarkets equipped with smart space technologies. This is an actual and a highly computationally complex problem in peak hours due to dynamically changing congestion conditions, the size and complexity of hypermarkets, and the presence of a multitude of shoppers with different shopping constraints and preferences. High computational complexity of this problem requires a computationally efficient solution approach. We propose a shopper route guidance architecture in which a hypermarket is modelled as a network of communicating smart building agents, each one monitoring its exclusive physical area. Moreover, each shopper is represented by an agent installed on a shopper’s app that, by interacting with other shoppers and smart building agents, dynamically updates its shopping route. Each shopper agent resolves the pick sequencing problem with congestion, i.e., given a shopper’s list, the shopper’s items’ locations are sequenced in the route proposed to a shopper so that the overall traveling time is minimized considering congestion in real-time. We propose a (low computational complexity) greedy tour algorithm and a distributed TSP mathematical model solved in Cplex for this problem and compare their performance. The results show that the proposed architecture and methods scale well and provide efficient shoppers’ routes.


Route guidance Pick sequencing Multi-agent system Hypermarket 


  1. 1.
    Akcelik, R.: Travel time functions for transport planning purposes: Davidson’s function, its time dependent form and alternative travel time function. Aust. Road Res. 21(3) (1991)Google Scholar
  2. 2.
    Applegate, D.L., Bixby, R.E., Chvatal, V., Cook, W.J.: The Traveling Salesman Problem: A Computational Study. Princeton University Press, Princeton (2011)zbMATHGoogle Scholar
  3. 3.
    Bajo, J., Corchado, J.M., De Paz, Y., et al.: SHOMAS: intelligent guidance and suggestions in shopping centres. Appl. Soft Comput. 9(2), 851–862 (2009)CrossRefGoogle Scholar
  4. 4.
    Bohnenberger, T., Jameson, A., Krüger, A., Butz, A.: Location-aware shopping assistance: evaluation of a decision-theoretic approach. In: Paternò, F. (ed.) Mobile HCI 2002. LNCS, vol. 2411, pp. 155–169. Springer, Heidelberg (2002). Scholar
  5. 5.
    Cho, H., Ji, J., Chen, Z., Park, H., Lee, W.: Measuring a distance between things with improved accuracy. Proc. Comput. Sci. 52, 1083–1088 (2015)CrossRefGoogle Scholar
  6. 6.
    Dantzig, G., Fulkerson, R., Johnson, S.: Solution of a large-scale traveling-salesman problem. J. Oper. Res. Soc. Am. 2(4), 393–410 (1954)MathSciNetGoogle Scholar
  7. 7.
    Deo, N., Pang, C.Y.: Shortest-path algorithms: taxonomy and annotation. Networks 14(2), 275–323 (1984)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Dunkel, J., Fernández, A., Ortiz, R., Ossowski, S.: Event-driven architecture for decision support in traffic management systems. Expert. Syst. Appl. 38(6), 6530–6539 (2011)CrossRefGoogle Scholar
  9. 9.
    Helsgaun, K.: An effective implementation of the Lin-Kernighan traveling salesman heuristic. Eur. J. Oper. Res. 126(1), 106–130 (2000)MathSciNetCrossRefGoogle Scholar
  10. 10.
    Hoffman, K.L., Padberg, M., Rinaldi, G.: Traveling salesman problem. In: Gass, S.I., Fu, M.C. (eds.) Encyclopedia of Operations Research and Management Science, pp. 1573–1578. Springer, Boston (2013). Scholar
  11. 11.
    Ijaz, F., Yang, H.K., Ahmad, A.W., Lee, C.: Indoor positioning: a review of indoor ultrasonic positioning systems. In: 2013 15th International Conference on Advanced Communication Technology (ICACT), pp. 1146–1150. IEEE (2013)Google Scholar
  12. 12.
    Ilie, S., Bădică, C.: Distributed multi-agent system for solving traveling salesman problem using ant colony optimization. In: Essaaidi, M., Malgeri, M., Badica, C. (eds.) Intelligent Distributed Computing IV, vol. 315, pp. 119–129. Springer, Heidelberg (2010). Scholar
  13. 13.
    Kabadi, S.N.: Polynomially Solvable Cases of the TSP, pp. 489–583. Springer, Boston (2007). Scholar
  14. 14.
    Letchford, A.N., Nasiri, S.D., Theis, D.O.: Compact formulations of the Steiner traveling salesman problem and related problems. Eur. J. Oper. Res. 228(1), 83–92 (2013)MathSciNetCrossRefGoogle Scholar
  15. 15.
    Li, Y.M., Lin, L.F., Ho, C.C.: A social route recommender mechanism for store shopping support. Decis. Support. Syst. 94, 97–108 (2017)CrossRefGoogle Scholar
  16. 16.
    Lujak, M., Giordani, S., Ossowski, S.: Fair route guidance: bridging system and user optimization. In: 17th International IEEE Conference on Intelligent Transportation Systems (ITSC), pp. 1415–1422, October 2014Google Scholar
  17. 17.
    Lujak, M., Billhardt, H., Dunkel, J., Fernández, A., Hermoso, R., Ossowski, S.: A distributed architecture for real-time evacuation guidance in large smart buildings. Comput. Sci. Inf. Syst. 14(1), 257–282 (2017)CrossRefGoogle Scholar
  18. 18.
    Lujak, M., Giordani, S., Ossowski, S.: Route guidance: bridging system and user optimization in traffic assignment. Neurocomputing 151, 449–460 (2015)CrossRefGoogle Scholar
  19. 19.
    Lymberopoulos, D., Liu, J., Yang, X., Choudhury, R.R., Handziski, V., Sen, S.: A realistic evaluation and comparison of indoor location technologies: experiences and lessons learned. In: Proceedings of the 14th International Conference on Information Processing in Sensor Networks, pp. 178–189. ACM (2015)Google Scholar
  20. 20.
    Ng, T.M.: From “where I am” to “here I am”: accuracy study on location-based services with IBeacon technology. HKIE Trans. 22(1), 23–31 (2015)CrossRefGoogle Scholar
  21. 21.
    Pan, J.C.H., Shih, P.H.: Evaluation of the throughput of a multiple-picker order picking system with congestion consideration. Comput. Ind. Eng. 55(2), 379–389 (2008)CrossRefGoogle Scholar
  22. 22.
    Pan, J.C.H., Wu, M.H.: Throughput analysis for order picking system with multiple pickers and aisle congestion considerations. Comput. Oper. Res. 39(7), 1661–1672 (2012)CrossRefGoogle Scholar
  23. 23.
    Theys, C., Bräysy, O., Dullaert, W., Raa, B.: Using a \(tsp\) heuristic for routing order pickers in warehouses. Eur. J. Oper. Res. 200(3), 755–763 (2010). Scholar
  24. 24.
    Timmermans, H.: Pedestrian Behavior: Models, Data Collection and Applications. Emerald Group Publishing Limited, London (2009)CrossRefGoogle Scholar
  25. 25.
    Tinós, R.: Analysis of the dynamic traveling salesman problem with weight changes. In: 2015 Latin America Congress on Computational Intelligence (LA-CCI), pp. 1–6. IEEE (2015)Google Scholar
  26. 26.
    Toriello, A., Haskell, W.B., Poremba, M.: A dynamic traveling salesman problem with stochastic arc costs. Oper. Res. 62(5), 1107–1125 (2014)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.IMT Lille DouaiDouaiFrance

Personalised recommendations