Novel dual discounting functions for the Internet shopping optimization problem: new algorithms

Novel dual discounting functions for the Internet shopping optimization problem: new algorithms

0.00 Avg rating0 Votes
Article ID: iaor20162389
Volume: 19
Issue: 3
Start Page Number: 245
End Page Number: 255
Publication Date: Jun 2016
Journal: Journal of Scheduling
Authors: , , , ,
Keywords: internet, marketing, combinatorial optimization, location, scheduling, supply & supply chains
Abstract:

One of the very important topics in discrete optimization, motivated by practical applications, is Internet shopping, which is becoming increasingly popular each year. More classical versions of the Internet shopping optimization problem (ISOP) are closely related to the facility location problem and some scheduling problems and have been intensively studied in the literature. In this paper, extensions of the problem are defined and studied. The issue is to buy all the necessary products for a minimum total possible price. This includes all prices of products as well as shipping costs. Studies in this paper include the ISOP with price sensitive discounts and a newly defined optimization problem: the ISOP including two different discounting functions, namely a shipping cost function as well as a price discounting function. First, these are formulated as mathematical programming problems. Then, some algorithms are constructed and extensively tested in a computational experiment.

Reviews

Required fields are marked *. Your email address will not be published.