introducing a novel mathematical model for school vehicle routing problem and proposing a new algorithm to solve it

this research presents and solves a new mathematical model for school bus routing problem (sbrp). sbrp is a specific case of vehicle routing problem (vrp). despite prevalent models, this model includes location and routing simultaneously. besides, the vehicles are non-homogenous. in addition, instead of locating schools which are the depots, we consider locating bus stops that are mentioned 'customers' in the simple location routing problem (lrp). this problem itself has led to a change in sub-tour elimination constraint. in contrast to the other articles we solve location and routing simultaneously. in one of these models, students related to different schools can receive service by same station and in other models each school have specific stations. to solve this model, we proposed a meta-heuristic scatter search (ss) algorithm. afterward, we coded the model by gams software. finally the results derived from ss algorithm are compared with results derived from gams. consequently we figured out that ss algorithm produces results in more reasonable time with acceptable errors.