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

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.
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01101708
Contributor : Grégory Mounié <>
Submitted on : Friday, January 9, 2015 - 2:16:32 PM
Last modification on : Thursday, April 4, 2019 - 10:18:05 AM

Links full text

Identifiers

Collections

INRIA | UGA | LIG

Citation

Jacek Blazewicz, Nathanael Cheriere, Pierre-Francois Dutot, Jedrzej Musial, Denis Trystram. Novel dual discounting functions for the Internet shopping optimization problem: new algorithms. Journal of Scheduling, Springer Verlag, 2014, 19 (3), pp.245-255. ⟨10.1007/s10951-014-0390-0⟩. ⟨hal-01101708⟩

Share

Metrics

Record views

417