{"title":"B2C电子商务下的随机库存路径问题","authors":"B. Xie, An Shi, Jian Wang","doi":"10.1109/ICEBE.2005.112","DOIUrl":null,"url":null,"abstract":"In traditional B2C, customers' stocks are usually controlled by themselves, while the supplier needs only to meet requests of customers by sending right commodity on time. The operation mode results in disadvantages of hindering saving of cost and improvement of efficiency. Being one of the key contents in vendor managed inventory, inventory routing problem will help supplier to lower operation cost, improve efficiency and increase satisfaction of customers. In the paper, a heuristic algorithm is designed to solve stochastic inventory routing problem. In the algorithm, followed by converting stochastic demands of customers to regular demands, distribution period of every customer is calculated by the modified EOQ. Finally, approximate solution of stochastic inventory routing problem can be obtained by solving periodic vehicle routing problem","PeriodicalId":118472,"journal":{"name":"IEEE International Conference on e-Business Engineering (ICEBE'05)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-10-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Stochastic inventory routing problem under B2C e-commerce\",\"authors\":\"B. Xie, An Shi, Jian Wang\",\"doi\":\"10.1109/ICEBE.2005.112\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In traditional B2C, customers' stocks are usually controlled by themselves, while the supplier needs only to meet requests of customers by sending right commodity on time. The operation mode results in disadvantages of hindering saving of cost and improvement of efficiency. Being one of the key contents in vendor managed inventory, inventory routing problem will help supplier to lower operation cost, improve efficiency and increase satisfaction of customers. In the paper, a heuristic algorithm is designed to solve stochastic inventory routing problem. In the algorithm, followed by converting stochastic demands of customers to regular demands, distribution period of every customer is calculated by the modified EOQ. Finally, approximate solution of stochastic inventory routing problem can be obtained by solving periodic vehicle routing problem\",\"PeriodicalId\":118472,\"journal\":{\"name\":\"IEEE International Conference on e-Business Engineering (ICEBE'05)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-10-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE International Conference on e-Business Engineering (ICEBE'05)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICEBE.2005.112\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE International Conference on e-Business Engineering (ICEBE'05)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICEBE.2005.112","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Stochastic inventory routing problem under B2C e-commerce
In traditional B2C, customers' stocks are usually controlled by themselves, while the supplier needs only to meet requests of customers by sending right commodity on time. The operation mode results in disadvantages of hindering saving of cost and improvement of efficiency. Being one of the key contents in vendor managed inventory, inventory routing problem will help supplier to lower operation cost, improve efficiency and increase satisfaction of customers. In the paper, a heuristic algorithm is designed to solve stochastic inventory routing problem. In the algorithm, followed by converting stochastic demands of customers to regular demands, distribution period of every customer is calculated by the modified EOQ. Finally, approximate solution of stochastic inventory routing problem can be obtained by solving periodic vehicle routing problem