|
|||||||||
|
|
|||||||||
| Project Description: | |||||||||
Shopping Cart Algorithm for finding the BEST COST: A shopping cart has n items and the n items are supplied by up to m suppliers each with their own delivery charge. Therefore one supplier could supply all items or n (i.e. one supplier for each item). The delivery charge is just once for a supplier per order, so we have up to n delivery charges or the same number of suppliers who win the cart. |
|||||||||
| Features : | |||||||||
| A simple example:
A cart has 4 items - I (1 to 4) and there are three suppliers as follows: S1 can supply I1, I2; S2 can supply I2, I3, I4; S3 can supply I1, I2. There are charges D1, D2, D3 for delivery. So suppliers will compete for the business and in this case several suppliers offer the same item. If a customer wants to purchase some products from shop, those products are available from different suppliers and each supplier’s price is different from others. And also the delivery charge of that product differs from each suppliers. So the customer will buy a product with Best delivery charge and with Best-Cost product by our algorithm. |
|||||||||
| The Part Supplier Table | |||||||||
 |
|||||||||
| The Supplier Table | |||||||||
 |
|||||||||
| Our algorithm found the Best Cost for the Online-Shopping Cart | |||||||||
 |
|||||||||
|
