Exact and Metaheuristic Approaches for a Bi-Objective School Bus Scheduling Problem.

ABSTRACT: As a class of hard combinatorial optimization problems, the school bus routing problem has received considerable attention in the last decades. For a multi-school system, given the bus trips for each school, the school bus scheduling problem aims at optimizing bus schedules to serve all the trips within the school time windows. In this paper, we propose two approaches for solving the bi-objective school bus scheduling problem: an exact method of mixed integer programming (MIP) and a metaheuristic method which combines simulated annealing with local search. We develop MIP formulations for homogenous and heterogeneous fleet problems respectively and solve the models by MIP solver CPLEX. The bus type-based formulation for heterogeneous fleet problem reduces the model complexity in terms of th

SUBMITTER: Chen X 

PROVIDER: S-EPMC4503688 | biostudies-literature | 2015

REPOSITORIES: biostudies-literature