E-Commerce Evaluation – Multi-Item Internet Shopping. Optimization and Heuristic Algorithms

Błażewicz, Jacek; Musiał, Jeędrzej

doi:10.1007/978-3-642-20009-0_24

Cited by 16 publications

(9 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For example, jobs may represent customer orders in internet shops (cf. Wojciechowski and Musial 2010;Blazewicz and Musial 2011;Blazewicz et al 2014) or tasks in production systems (cf. Sterna 2007b), which have to be executed on identical machines working in parallel, e.g., by workers having the same qualifications or on identical stages in a flexible manufacturing system, within given time, e.g., before a shipping term or within a planning horizon.…”

Section: Problem Definition and Related Workmentioning

confidence: 99%

Scheduling on parallel identical machines with late work criterion: Offline and online cases

Chen

Sterna

Han

et al. 2015

J Sched

View full text Add to dashboard Cite

In the paper, we consider the problem of scheduling jobs on parallel identical machines with the late work criterion and a common due date, both offline and online cases. Since the late work criterion has not been studied in the online mode so far, the analysis of the online problem is preceded by the analysis of the offline problem, whose complexity status has not been formally stated in the literature yet. Namely, for the offline mode, we prove that the twomachine problem is binary NP-hard, and the general case is unary NP-hard. In the online mode we assume that jobs arrive in the system one by one, i.e., we consider the online over list model. We give an algorithm with a competitive ratio being a function of the number of machines, and we prove the optimality of this approach for two identical machines.

show abstract

Section: Problem Definition and Related Workmentioning

confidence: 99%

Scheduling on parallel identical machines with late work criterion: Offline and online cases

Chen

Sterna

Han

et al. 2015

J Sched

View full text Add to dashboard Cite

show abstract

“…In the paper it was proven that the problem belonged to the NP-Hard set by constructing a polynomial transformation from the Exact Cover by 3-Sets Problem (X3C) [15], where they also proposed polynomial time heuristics for the problem, one that focuses on enumerating all the possible selections of the shops that contain all the products in the shopping list, choosing the best selection [33] and the second enumerates for each product all the stores where it is available and selects the best shop sequence that minimizes the total cost [8].…”

Section: Literature Reviewmentioning

confidence: 99%

Trustworthy Online Shopping with Price Impact

Musiał

López-Locés

2017

Foundations of Computing and Decision Sciences

View full text Add to dashboard Cite

Abstract. Internet shopping is one of the main pillars of electronic commerce. According to the literature, the Internet Shopping Optimization Problem (ISOP) has been defined in order to optimize the global cost of online purchase, taking into account both the cost of products and shipping. In this study, it was decided to propose and analyze a very interesting, and really substantial, extension of the ISOP. Namely, trust factors were subjected to careful analysis from the customer point of view. The analysis is based on a specially prepared questionnaire, supplemented by the information from the literature and our own observations. Thus, it was possible to propose a definition of a new mathematical model of the problem, and to prove its affiliation to the class of strongly NP-hard problems. In addition, the heuristic algorithm is proposed, which can be used to solve the problem.

show abstract

“…The local step choice analysis is more complicated than in the basic Greedy. The forecasting method is looking for a step ahead [4]. Therefore, technically this algorithm is not a strict greedy algorithm.…”

Section: Algorithm With Forecasting -Forecastingmentioning

confidence: 99%

“…Authors focused on the problem definition and its complexity analysis (with some sub-cases of the main problem). The first algorithms and computational results were introduced in [4]. Much more complicated version of ISOP that takes into account price discounts was introduced in [5,6].…”

Section: Introductionmentioning

confidence: 99%

Algorithms solving the Internet shopping optimization problem with price discounts

Musiał¹,

Pecero²,

López-Locés³

et al. 2016

Bulletin of the Polish Academy of Sciences Technical Sciences

View full text Add to dashboard Cite

Abstract. The Internet shopping optimization problem arises when a customer aims to purchase a list of goods from a set of web-stores with a minimum total cost. This problem is NP-hard in the strong sense. We are interested in solving the Internet shopping optimization problem with additional delivery costs associated to the web-stores where the goods are bought. It is of interest to extend the model including price discounts of goods. The aim of this paper is to present a set of optimization algorithms to solve the problem. Our purpose is to find a compromise solution between computational time and results close to the optimum value. The performance of the set of algorithms is evaluated through simulations using real world data collected from 32 web-stores. The quality of the results provided by the set of algorithms is compared to the optimal solutions for small-size instances of the problem. The optimization algorithms are also evaluated regarding scalability when the size of the instances increases. The set of results revealed that the algorithms are able to compute good quality solutions close to the optimum in a reasonable time with very good scalability demonstrating their practicability.

show abstract

E-Commerce Evaluation – Multi-Item Internet Shopping. Optimization and Heuristic Algorithms

Cited by 16 publications

References 8 publications

Scheduling on parallel identical machines with late work criterion: Offline and online cases

Scheduling on parallel identical machines with late work criterion: Offline and online cases

Trustworthy Online Shopping with Price Impact

Algorithms solving the Internet shopping optimization problem with price discounts

Contact Info

Product

Resources

About