Multi-objective optimization of customized bus routes based on full operation process

In order to rationally formulate a customized bus route plan to improve the operation efficiency of customized buses, in view of the problem of ignoring the distance between the boarding area and the alighting area, and setting it as a fixed value when performing custom bus route optimization modeling, as well as solving the problem of multiple custom bus parking lots. This paper proposes a method based on the NSGA-II algorithm using a three-stage hybrid coding method to solve. First, according to real life, the entire operation process of customized buses is divided into four phases. Second, based on the four stages, a multi-objective optimization model of customized bus routes that satisfies multiple parking lots, multiple cars, and multiple boarding and alighting stations is constructed to pursue the minimum total travel time of passengers and minimizes the operating costs of customized bus companies. Third, the NSGA-II algorithm is employed to solve the model, including three-stage hybrid coding, segmented crossover, and segmented mutation operators. Finally, the local road network in Lanzhou City is adopted for simulation research. The results show that it is feasible to use NSGA-II algorithm to solve the problem of customizing bus routes for multiple parking lots, multiple vehicles, and multiple boarding and alighting stations. The research results are of great value for exploring the optimization methods of customized bus routes and improving the operating efficiency of custom buses.

Selection Method of Dendritic River Networks Based on Hybrid Coding for Topographic Map Generalization

As the coding of a dendritic river system can be used to represent the stream order and spatial-structure of a river network, it is always used in river selection, which is a key step in topographic map generalization. There are two categories of conventional hydrological coding systems, one is the top-down approach, and the other is the bottom-up approach. However, the former does not accurately reflect the hierarchies of a dendritic river network, which is produced by catchment relationships, and it is not appropriate for the stream selection of river networks with uniform distributions of tributaries. The latter cannot directly indicate the subtree depth of a stream, and it is not favorable to stream selection of river systems that have topologically deep structures. Therefore, a selection method for dendritic river networks based on hybrid coding is proposed in this paper. First, the dendritic river network is coded through classical top-down Horton coding. Second, directed topology trees are constructed to organize the river network data, and stroke connections are calculated to code the river network in the bottom-up approach. Third, the river network is marked through hybrid usage of the top-down approach and bottom-up approach, and based on the spatial characteristics of the river network, the river network is classified into three kinds of subtrees: deep branch, shallow branch and modest branch. Then, appropriate coding is assigned automatically to different subtrees to achieve river selection. Finally, actual topographic map data of a river system in a region of Hubei Province are used to comparatively validate the hybrid coding system against two existing isolated coding systems. The experimental results demonstrate that the hybrid coding method is very effective for river network selection, not only in highlighting hierarchies formed by catchment relationships but also in the uniform distribution of tributaries.