Food truck scheduling model
by Hironori Harada; Masaki Kohana; Shusuke Okamoto
International Journal of Space-Based and Situated Computing (IJSSC), Vol. 6, No. 2, 2016

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.

Online publication date: Thu, 28-Jul-2016

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Space-Based and Situated Computing (IJSSC):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com