Abstract
In this paper, we propose the customers’ path control method with the dominating cycle algorithms. It is one of the important issues to control the customers’ path among the retail businesses. Even for the customer, it is natural to minimize route in the store to find and purchase the objectives. On the other hand, the store operator would like to maximize the route on the contrary. According to the conventional store management theory, the items with the volume purchased set in the isle with the lots of traffic. Whereas concerning to the research for the traffic controlling with the geometrical theory in the store is less. Therefore, in this paper, we regard customers’ paths as the structure of graph and make use of the characteristics for the vertex dominating cycle. As the result, we find out the route of the saddle point for both customer and the store.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bondy, J.A.: Longest paths and cycles in graphs with high degree, Research Report CORR, Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario, Canada (1980)
Bondy, J.A., Fan, G.: A sufficient condition for dominating cycles. Discrete Math. 67, 205–208 (1987)
Matsumura, H., Ozeki, K., Sugiyama, T.: A Note on a Longest Cycle which is Vertex Dominating. AKCE International Journal of Graphs and Combinatorics 4, 233–243 (2007)
Yada, K.: Path Analysis in a Supermarket and String Analysis Technique. Proc. Of the Institute of Statistical Mathematics 56(2), 199–213 (2008)
Yamada, K., Abe, T., Kimura, H.: Simulation of Planned/Unplanned Purchaser Flow using an Agent Model. In: The 19th Annual Conference of the Japanese Society for Artificial Intelligence, 3E3-02 (2005)
Larson, J.S., Bradlow, E.T., Fader, P.S.: An Exploratory Look at Supermarket Shopping Paths. International Journal of Research in Marketing 22, 395–414 (2005)
Diestel, R.: Graph Theory, 3rd edn. Springer, Heidelberg (2006)
Dirac, G.A.: Some theorems on abstract graphs. Proc. London Math. Soc. 2, 69–81 (1952)
Ore, O.: Hamilton connected graphs. J. Math. Pures Appl. 42, 21–27 (1963)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sugiyama, T. (2010). Customer Path Controlling in the Retail Store with the Vertex Dominating Cycle Algorithms. In: Setchi, R., Jordanov, I., Howlett, R.J., Jain, L.C. (eds) Knowledge-Based and Intelligent Information and Engineering Systems. KES 2010. Lecture Notes in Computer Science(), vol 6278. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15393-8_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-15393-8_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15392-1
Online ISBN: 978-3-642-15393-8
eBook Packages: Computer ScienceComputer Science (R0)