{"title":"一个由混合M.I.P.算法解决的物流积累问题","authors":"Pastijn Hugo J.A.M.","doi":"10.1016/0377-841X(79)90043-3","DOIUrl":null,"url":null,"abstract":"<div><p>A certain case of a logistical build-up of stocks of critical articles for an army operation is discussed. A general model is presented and the particular structure studied. the model describes a general mixed integer linear programming problem. Constraints are mainly due to time limitations, limited capacities of transportation capabilities, the required amount articles and human implications such as training, specialization and psychological factors. Costs are optimized. A simplified subproblem is treated numerically to illustrate the application of the algorithm. The solution is given by means of hybrid cutting-plane — branch and bound algorithm.</p></div>","PeriodicalId":100475,"journal":{"name":"Engineering and Process Economics","volume":"4 2","pages":"Pages 313-323"},"PeriodicalIF":0.0000,"publicationDate":"1979-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0377-841X(79)90043-3","citationCount":"0","resultStr":"{\"title\":\"A logistical build-up problem solved by a hybrid M.I.P. — Algorithm\",\"authors\":\"Pastijn Hugo J.A.M.\",\"doi\":\"10.1016/0377-841X(79)90043-3\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>A certain case of a logistical build-up of stocks of critical articles for an army operation is discussed. A general model is presented and the particular structure studied. the model describes a general mixed integer linear programming problem. Constraints are mainly due to time limitations, limited capacities of transportation capabilities, the required amount articles and human implications such as training, specialization and psychological factors. Costs are optimized. A simplified subproblem is treated numerically to illustrate the application of the algorithm. The solution is given by means of hybrid cutting-plane — branch and bound algorithm.</p></div>\",\"PeriodicalId\":100475,\"journal\":{\"name\":\"Engineering and Process Economics\",\"volume\":\"4 2\",\"pages\":\"Pages 313-323\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1979-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/0377-841X(79)90043-3\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Engineering and Process Economics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/0377841X79900433\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Engineering and Process Economics","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/0377841X79900433","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A logistical build-up problem solved by a hybrid M.I.P. — Algorithm
A certain case of a logistical build-up of stocks of critical articles for an army operation is discussed. A general model is presented and the particular structure studied. the model describes a general mixed integer linear programming problem. Constraints are mainly due to time limitations, limited capacities of transportation capabilities, the required amount articles and human implications such as training, specialization and psychological factors. Costs are optimized. A simplified subproblem is treated numerically to illustrate the application of the algorithm. The solution is given by means of hybrid cutting-plane — branch and bound algorithm.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
