Optimization Model And Algorithm Of Inventoryrouting Problem In Integrated E-commerce Services

The inventory-routing problem is concerned with the optimal ordering and routing strategy to minimize the cost of inventory and transportation,while considering the interaction between inventory and transportation process.As inventory-routing problem considers order quantity to suppliers,delivery quantity to customers and vehicle transportation routes at the same time,it plays a significant role in the supply chain management of integrated e-commerce services.Aiming at the logistics and transportation system of the Internet home decoration industry,this paper studies its optimal inventory,delivery and replenishment strategy so that the total supply chain cost including ordering cost,inventory cost and transportation cost is minimized.We take the minimum order quantity restriction,safety inventory restriction,vehicle capacity restriction,shortage forbidden restriction and customer maximum capacity into consideration,and come up with a three-stage multiple goods M-1-M supply chain model with deterministic demand.To solve this inventory-routing problem,we establish a mixed integer linear programming model.Since the inventory-routing problem is NP hard,there is no polynomial time algorithm can obtain the optimal solution of this optimization problem.We propose three approximation algorithms to solve the inventory-routing problem including two-stage method with greedy algorithm,tabu search algorithm and tabu search algorithm based on greedy algorithm.We also test these three approximation algorithms in numerical experiments,studies its optimization performance under small,normal and large-scale inventory and transportation processes,ensuring all algorithms have good performance and applicability.