{"title":"餐车调度模型","authors":"Hironori Harada, Masaki Kohana, S. Okamoto","doi":"10.1504/IJSSC.2016.077973","DOIUrl":null,"url":null,"abstract":"In this paper, a scheduling model for a food truck, which moves around the city and provides a food service in some locations, is presented. For this type of service, several options exist for selling, routing, and service times for given locations. The optimal combination of these selections produces good sales performance. The background of this study is herein provided, as well as a scheduling example, problem formulation, and an experiment with realistic data.","PeriodicalId":43931,"journal":{"name":"International Journal of Space-Based and Situated Computing","volume":"31 1","pages":"113-120"},"PeriodicalIF":0.0000,"publicationDate":"2016-08-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Food truck scheduling model\",\"authors\":\"Hironori Harada, Masaki Kohana, S. Okamoto\",\"doi\":\"10.1504/IJSSC.2016.077973\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, a scheduling model for a food truck, which moves around the city and provides a food service in some locations, is presented. For this type of service, several options exist for selling, routing, and service times for given locations. The optimal combination of these selections produces good sales performance. The background of this study is herein provided, as well as a scheduling example, problem formulation, and an experiment with realistic data.\",\"PeriodicalId\":43931,\"journal\":{\"name\":\"International Journal of Space-Based and Situated Computing\",\"volume\":\"31 1\",\"pages\":\"113-120\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-08-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Space-Based and Situated Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1504/IJSSC.2016.077973\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Space-Based and Situated Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1504/IJSSC.2016.077973","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
In this paper, a scheduling model for a food truck, which moves around the city and provides a food service in some locations, is presented. For this type of service, several options exist for selling, routing, and service times for given locations. The optimal combination of these selections produces good sales performance. The background of this study is herein provided, as well as a scheduling example, problem formulation, and an experiment with realistic data.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
