Optimal design of community shuttles with an adaptive-operator-selection-based genetic algorithm

摘要

This paper investigates the optimal design problem of a shuttle system provided by a large-scale community with the last-mile service feeding to metro stations. A mixed integer optimization problem is formulated to jointly optimize the route network and the service frequency for each shuttle. This problem aims to minimize the total transit system cost, including user and supplier costs, subject to the constraints on route length, coverage area, vehicle capacity and total fleet size. A solution approach that consists of the following three components is then proposed. The first component is a network analysis procedure that assigns the demand of each network zone to a set of paths and determines the service frequency of each route with a fleet size adjusting heuristic. The second component is an initial route network generation procedure, ensuring all the divided zones within the coverage of at least one shuttle route with appropriate length. The third component is a genetic algorithm procedure that contains multiple crossover and mutation operators to guide the evolving process of generating feasible solutions. Synthetic and real-world case studies are conducted to test the proposed model and the solution, and sensitivity analysis on key parameters and variables are also investigated.