Abstract
In electronic marketplaces, there are several buyer coalition schemes with the aim of obtaining the best discount and the total group’s utility for buying a large volume of products. However, there are a few schemes focusing on a group buying with bundles of items. This paper presents an approach called GroupBuyACO for forming buyer coalition with bundle of items via the ant colony optimization (ACO). The concentration of the proposed algorithm is to find the best formation of the heterogeneous preference of buyers for earning the best discount from venders. The buyer coalition is formed concerning the bundles of items, item price, and the buyer reservations. The simulation of the proposed algorithm is evaluated and compared with the GAGroupBuyer scheme by Sukstrienwong (Buyer formation with bundle of items in e-marketplaces by genetic algorithm. Lecture note in engineering and computer science: proceedings of the international multiconference of engineers and computer scientists 2010, IMECS 2010, 17–19 March 2010, Hong Kong, pp 158–162). Experimental Results indicate that the algorithm can improve the total discount of any coalitions.
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
Notes
- 1.
Bundle of items in the work of Gurler et al. [6] refers to the practice of selling two or more goods together in a package at a price which is below the sum of the independent prices.
References
Alipour H, Khosrowshahi Asl E, Esmaeili M, Nourhosseini M (2008) ACO-FCR: Applying ACO-based algorithms to induct FCR, Lecture note in engineering and computer science: proceedings of the world congress on engineering 2008, 2–4 July, London, UK, pp 12–17
Dana J (2004) Buyer groups as strategic commitments mimeo. Northwestern University, USA
Dorigo M, Gambardella LM (1997) Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans Evolut Comput 1(1):53–66
Dorigo M, Di Caro G (1999) The ant colony optimization metaheuristic. In: Corne D et al (eds) New ideas in optimization. McGraw Hill, London, pp 11–32
Goss S, Beckers R, Deneubourg JL, Aron S, Pasteels JM (1990) How trail laying and trail following can solve foraging problems for ant colonies. In: Hughes RN (ed) Behavioural mechanisms of food selection NATO-ASI Series, G 20. Springer, Berlin
Gurler U, Oztop S, Sen A (2009) Optimal bundle formation and pricing of two products with limited stock. J Int J Prod Econ,
Holldobler B, Wilson EO (1990) The Ants. Springer, Berlin, p 732
Hyodo M, Matsuo T, Ito T (2003)An optimal coalition formation among buyer agents based on a genetic algorithm. In: 16th international conference on industrial and engineering applications of artificial intelligence and expert systems (IEA/AIE’03), Laughborough, UK, pp 759–767
Ismail M, Nur Hazima FI, Mohd. Rozely K, Muhammad Khayat I, Titik Khawa AR, Mohd Rafi A (2008) Ant colony optimization (ACO) technique in economic power dispatch problems. Lecture note in engineering and computer science: proceedings of the international multiconference of engineers and computer scientists, 19–21 March 2008, Hong Kong, pp 1387–1392
Ito T, Hiroyuki O, Toramatsu S (2002) A group buy protocal based on coalition formation for agent-mediated e-commerce. IJCIS 3(1):11–20
Laor B, Leung HF, Boonjing V, Dickson KW (2009) Forming buyer coalitions with bundles of items. In: Nguyen NT, Hakansson A, Hartung R, Howlett R, Jain LC (eds.) KES-AMSTA 2009. LNAI 5559-0717 Springer, Heidelberg, pp 121–138
Lawler EL, Lenstra JK, Rinnooy-Kan AHG, Shmoys DB (eds) (1985) The traveling salesman problem. Wiley, New York
Li C, Sycara K (2007) Algorithm for combinatorial coalition formation and payoff diversion in an electronic marketplace. In: Proceedings of the first international joint conference on autonomous agents and multiagent systems, pp 120–127
Mahdi S (2007) Negotiating agents in e-commerce based on a combined strategy using genetic algorithms as well as fuzzy fairness function. In: Proceedings of the world congress on engineering, WCE 2007, vol I. 2–4 July 2007, London, UK
Maniezzo V, Colorni A, Dorigo M (1994) The ant system applied to the quadratic assignment problem. Université Libre de Bruxelles, Belgium, Tech. Rep. IRIDIA/94-28
Sukstrienwong A (2010), Buyer formation with bundle of items in e-marketplaces by genetic algorithm. Lecture note in engineering and computer science: proceedings of the international multiconference of engineers and computer scientists 2010, IMECS 2010, 17–19 March 2010, Hong Kong, pp 158–162
Sukstrienwong A (2010) Ant colony optimization for buyer coalition with bundle of items. Lecture notes in engineering and computer science: proceedings of the world congress on engineering 2010, WCE 2010, 30 June–2 July, London, UK, pp 38–43
Tsvetovat M, Sycara KP, Chen Y, Ying J (2001)Customer coalitions in electronic markets. Lecture notes in computer science, vol 2003. Springer, Heidelberg, pp 121–138
Yamada T, Reeves CR (1998) Solving the Csum permutation flowshop scheduling problem by genetic local search. In: Proceedings of 1998 ieee international conference on evolutionary computation, pp 230–234
Yamamoto J, Sycara K (2001) A stable and efficient buyer coalition formation scheme for e-marketplaces. In: Proceedings of the 5th international conference on autonomous agents, Monttreal, Quebec, Canada, pp 576–583
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer Science+Business Media B.V.
About this chapter
Cite this chapter
Sukstrienwong, A. (2011). Buyer Coalition Formation with Bundle of Items by Ant Colony Optimization. In: Ao, SI., Gelman, L. (eds) Electrical Engineering and Applied Computing. Lecture Notes in Electrical Engineering, vol 90. Springer, Dordrecht. https://doi.org/10.1007/978-94-007-1192-1_25
Download citation
DOI: https://doi.org/10.1007/978-94-007-1192-1_25
Published:
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-007-1191-4
Online ISBN: 978-94-007-1192-1
eBook Packages: EngineeringEngineering (R0)