Authors:
Jedrzej Musial
1
;
Johnatan E. Pecero
2
;
Mario C. Lopez
3
;
Hector J. Fraire
3
;
Pascal Bouvry
2
and
Jacek Blazewicz
1
Affiliations:
1
Poznan University of Technology, Poland
;
2
University of Luxembourg, Luxembourg
;
3
Instituto Tecnológico de Ciudad Madero, Mexico
Keyword(s):
Optimization, e-Commerce, Internet Shopping, Applications, Algorithms, Computational Complexity.
Related
Ontology
Subjects/Areas/Topics:
Applications
;
Cloud Computing
;
Collaboration and e-Services
;
Data Engineering
;
e-Business
;
Enterprise Information Systems
;
Entertainment
;
Mobile Software and Services
;
Ontologies and the Semantic Web
;
Services Science
;
Software Agents and Internet Computing
;
Software Engineering
;
Software Engineering Methods and Techniques
;
Telecommunications
;
Web Services
;
Wireless Information Networks and Systems
Abstract:
In this paper we deal with the Internet Shopping Optimization Problem. An extended model that includes price sensitive discounts is considered. A set of algorithms to solve the Internet Shopping Optimization Problem with Price Sensitivity Discounts (ISOPwD) is introduced. The algorithms are designed to consider a different solution quality regarding computational time and results close to the optimum solution. Simulations based on real world data assess the new set of heuristics. The results of the proposed algorithms were compared with the optimal solutions, computed by a branch and bound algorithm. The scalability is evaluated by increasing the problem sizes. Computational experiments are performed and their results are carefully analyzed and discussed. The paper should be perceived as a work in progress - position paper.