Pedro Yuri A. L. Alves, K. V. Delgado, A. Freire, V. F. Silva
{"title":"具有随机需求和时间窗的库存调度问题的系统求解","authors":"Pedro Yuri A. L. Alves, K. V. Delgado, A. Freire, V. F. Silva","doi":"10.1145/3229345.3229377","DOIUrl":null,"url":null,"abstract":"The inventory routing problem with stochastic demand includes the inventory control, product transportation and scheduling decisions, considering an estimation of customer demands. This problem appears in several real situations, playing a fundamental role in reducing costs and improving the efficiency and reliability of the service. In practice, there are often restrictions on the \"time window\", which corresponds to a certain period of the day on which deliveries can be made. Despite the great relevance of this type of constraint, there are no results in the literature that combine stochastic demand and time window constraints. In this work, we propose a system, using advanced techniques of operational research, to solve the inventory routing problem with stochastic demand, considering time window constraints, as well as additional constraints of maximum inventory capacities in both the client and the depot and individual confidence level of the customer service.","PeriodicalId":284178,"journal":{"name":"Proceedings of the XIV Brazilian Symposium on Information Systems","volume":"257 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"System to Solve the Inventory Routing Problem with Stochastic Demand and Time Window\",\"authors\":\"Pedro Yuri A. L. Alves, K. V. Delgado, A. Freire, V. F. Silva\",\"doi\":\"10.1145/3229345.3229377\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The inventory routing problem with stochastic demand includes the inventory control, product transportation and scheduling decisions, considering an estimation of customer demands. This problem appears in several real situations, playing a fundamental role in reducing costs and improving the efficiency and reliability of the service. In practice, there are often restrictions on the \\\"time window\\\", which corresponds to a certain period of the day on which deliveries can be made. Despite the great relevance of this type of constraint, there are no results in the literature that combine stochastic demand and time window constraints. In this work, we propose a system, using advanced techniques of operational research, to solve the inventory routing problem with stochastic demand, considering time window constraints, as well as additional constraints of maximum inventory capacities in both the client and the depot and individual confidence level of the customer service.\",\"PeriodicalId\":284178,\"journal\":{\"name\":\"Proceedings of the XIV Brazilian Symposium on Information Systems\",\"volume\":\"257 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-06-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the XIV Brazilian Symposium on Information Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3229345.3229377\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the XIV Brazilian Symposium on Information Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3229345.3229377","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
System to Solve the Inventory Routing Problem with Stochastic Demand and Time Window
The inventory routing problem with stochastic demand includes the inventory control, product transportation and scheduling decisions, considering an estimation of customer demands. This problem appears in several real situations, playing a fundamental role in reducing costs and improving the efficiency and reliability of the service. In practice, there are often restrictions on the "time window", which corresponds to a certain period of the day on which deliveries can be made. Despite the great relevance of this type of constraint, there are no results in the literature that combine stochastic demand and time window constraints. In this work, we propose a system, using advanced techniques of operational research, to solve the inventory routing problem with stochastic demand, considering time window constraints, as well as additional constraints of maximum inventory capacities in both the client and the depot and individual confidence level of the customer service.