Optimizing dead mileage in urban bus routes through a nondominated solution approach

The problem of determining nondominated schedules to take buses from depots to the starting points of their routes, spare capacity and the number of buses to be parked overnight at each depot is considered with two objectives without assigning priorities to them. The two objectives are to minimize the cumulative distance covered by all the buses and the maximum distance among the distances covered by individual buses from the depots to the starting points of their respective routes. An algorithm is developed to obtain the set of nondominated solutions of this two-objective problem.