Trustworthy Online Shopping with Price Impact

Musiał, Jędrzej; López-Locés, Mario C.

doi:10.1515/fcds-2017-0005

Cited by 5 publications

(3 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Musial and Lopez-Loces modeled consumer confidence over a particular seller in online stores [7]. They accomplish this by adding two factors to classical ISHOP.…”

Section: Trusted Internet Shopping Optimization Problemmentioning

confidence: 99%

“…The pioneering work of Blazewicz et al [2] proves that the problem of finding the minimum price for a given set of products in a given set of stores is NP-hard [3], and it is called the Internet Shopping Problem (ISHOP). Since [2] different variants of the ISHOP appear in the state-of-the-art, such as price discounts [4], budget limits [5], delivery constraints [6], trusted shopping [7], and considering individual shipping costs per product [8]. After analyzing the present variants in the state-of-the-art, we found an opportunity to improve those models by considering multiple unit purchases.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

The Internet Shopping Optimization Problem with Multiple Item Units (ISHOP-U): Formulation, Instances, NP-Completeness, and Evolutionary Optimization

et al. 2022

View full text Add to dashboard Cite

In this work, we investigate the variant of the Internet Shopping Optimization Problem (ISHOP) that considers different item units. This variant is more challenging than the original problem. The original ISHOP is already known as a combinatorial NP-hard problem. In this work, we present a formal proof that the ISHOP variant considering different item units belongs to the NP-Hard complexity class. The abovementioned variant is familiar to companies and consumers who need to purchase more than one unit of a specific product to satisfy their requirements. For example, companies buy different quantities of construction materials, medical equipment, office supplies, or chemical components. We propose two new evolutionary operators (crossover and mutation) and an unfeasible solution repair method for the studied ISHOP variant. Furthermore, we produce a new benchmark of 15 synthetic instances where item prices follow a random uniform distribution. Finally, to assess our evolutionary operators, we implemented two Evolutionary Algorithms, a Genetic Algorithm (GA) and a Cellular Genetic Algorithm (CGA), and an experimental evaluation against a Water Cycle Algorithm (WCA) from the state-of-the-art. Experimental results show that our proposed GA performs well with statistical significance.

show abstract

“…Musial and Lopez-Loces modeled consumer confidence over a particular seller in online stores [7]. They accomplish this by adding two factors to classical ISHOP.…”

Section: Trusted Internet Shopping Optimization Problemmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

The Internet Shopping Optimization Problem with Multiple Item Units (ISHOP-U): Formulation, Instances, NP-Completeness, and Evolutionary Optimization

et al. 2022

View full text Add to dashboard Cite

show abstract

“…In the past years the number of cloud services and cloud service providers has thus skyrocketed but with a certain lack of transparency. The plethora of available services provide companies the opportunity to establish robust IT solutions relying on security, reliability, redundancy and trust [28] while minimizing their overall cost. However, selecting the appropriate services at the best price is increasingly difficult for end-users.…”

Section: Introductionmentioning

confidence: 99%

Cloud Brokering with Bundles: Multi-objective Optimization of Services Selection

Musiał

Kieffer

Guzek

et al. 2019

Foundations of Computing and Decision Sciences

Self Cite

View full text Add to dashboard Cite

Cloud computing has become one of the major computing paradigms. Not only the number of offered cloud services has grown exponentially but also many different providers compete and propose very similar services. This situation should eventually be beneficial for the customers, but considering that these services slightly differ functionally and non-functionally -wise (e.g., performance, reliability, security), consumers may be confused and unable to make an optimal choice. The emergence of cloud service brokers addresses these issues. A broker gathers information about services from providers and about the needs and requirements of the customers, with the final goal of finding the best match. In this paper, we formalize and study a novel problem that arises in the area of cloud brokering. In its simplest form, brokering is a trivial assignment problem, but in more complex and realistic cases this does not longer hold. The novelty of the presented problem lies in considering services which can be sold in bundles. Bundling is a common business practice, in which a set of services is sold together for the lower price than the sum of services’ prices that are included in it. This work introduces a multi-criteria optimization problem which could help customers to determine the best IT solutions according to several criteria. The Cloud Brokering with Bundles (CBB) models the different IT packages (or bundles) found on the market while minimizing (maximizing) different criteria. A proof of complexity is given for the single-objective case and experiments have been conducted with a special case of two criteria: the first one being the cost and the second is artificially generated. We also designed and developed a benchmark generator, which is based on real data gathered from 19 cloud providers. The problem is solved using an exact optimizer relying on a dichotomic search method. The results show that the dichotomic search can be successfully applied for small instances corresponding to typical cloud-brokering use cases and returns results in terms of seconds. For larger problem instances, solving times are not prohibitive, and solutions could be obtained for large, corporate clients in terms of minutes.

show abstract

A Survey of Models and Solution Methods for the Internet Shopping Optimization Problem

Morales

Huacuja

Frausto–Solís

et al. 2023

Studies in Computational Intelligence

View full text Add to dashboard Cite

Trustworthy Online Shopping with Price Impact

Cited by 5 publications

References 26 publications

The Internet Shopping Optimization Problem with Multiple Item Units (ISHOP-U): Formulation, Instances, NP-Completeness, and Evolutionary Optimization

The Internet Shopping Optimization Problem with Multiple Item Units (ISHOP-U): Formulation, Instances, NP-Completeness, and Evolutionary Optimization

Cloud Brokering with Bundles: Multi-objective Optimization of Services Selection

A Survey of Models and Solution Methods for the Internet Shopping Optimization Problem

Contact Info

Product

Resources

About