Dynamic Optimization of Bus Line Schedule in Commuter Corridor Based on Bus IC Card Data

The aim of this study was to explore the bus operating state of the city bus passenger corridor, taking the minimum bus operating cost and passenger travel cost as the objective function, taking passenger flow demand and operating income as the constraint, and considering the average speed change of the bus line in the bus corridor at different times. This paper proposes a dynamic optimization model of bus route schedule based on bus Integrated Circuit Card (IC Card) data. The optimization variable is the departure frequency of the candidate lines. To solve the model, a dynamic departure interval optimization method based on improved Genetic Algorithm (GA) was designed under different decision preferences. The method includes the calibration of generalized cost functions for passengers and bus companies and grasps the characteristics of bus operating speed changes and the design of departure strategies under different decision preferences. The validity and applicability of the proposed method are verified by a numerical example. We mainly carried out the following work: (1) Dynamic analysis of the time dimension of the bus departure interval takes into account the changes in passenger time characteristics during peak periods. (2) Seven schemes of weight ratio of passenger waiting time cost and bus operation cost were designed, and the departure intervals with different benefit orientations of passengers and operators were discussed, respectively, so as to select the corresponding departure schemes for decision makers under different decision preferences. The results show that (1) the total cost of the 7 different weighting schemes is lower than the actual value by 6.90% to 18.20%; (2) when decision makers need to bias the weight to the bus company, the weight ratio α : β between passengers and bus company is 0.25 : 0.75 which works best. The frequency of departures has been reduced by 6, and at the same time, the total optimized cost is reduced by 18.2%; (3) when decision makers need to bias the weight to the passengers, the weight ratio α : β between the passengers and bus company is 0.75 : 0.25 which works best. The frequency of departures has been increased by 19, and at the same time, the total optimized cost is reduced by 17.7%; and (4) when decision makers consider passengers and bus companies equally, the weight ratio α : β between passengers and bus companies is 0.5 : 0.5, the optimization cost is the closest to the actual cost, the optimization cost is reduced by 6.9%, and the frequency of departures has been increased by 5. The results show that the model in this paper provides a new idea for the information mining of bus routes in the research based on the bus IC Card data and provides an effective tool for the management of different operation decision preferences.

Enhanced Beetle Antennae Algorithm for Chemical Dynamic Optimization Problems’ Non-Fixed Points Discrete Solution

Dynamic optimization is an important research topic in chemical process control. A dynamic optimization method with good performance can reduce energy consumption and prompt production efficiency. However, the method of solving the problem is complicated in the establishment of the model, and the process of solving the optimal value has a certain degree of difficulty. Based on this, we proposed a non-fixed points discrete method of an enhanced beetle antennae optimization algorithm (EBSO) to solve this kind of problem. Firstly, we converted individual beetles into groups of beetles to search for the best and increase the diversity of the population. Secondly, we introduced a balanced direction strategy, which explored extreme values in new directions before the beetles updated their positions. Finally, a spiral flight mechanism was introduced to change the situation of the beetles flying straight toward the tentacles to prevent the traditional algorithm from easily falling into a certain local range and not being able to jump out. We applied the enhanced algorithm to four classic chemical problems. Meanwhile, we changed the equal time division method or unequal time division method commonly used to solve chemical dynamic optimization problems, and proposed a new interval distribution method—the non-fixed points discrete method, which can more accurately represent the optimal control trajectory. The comparison and analysis of the simulation test results with other algorithms for solving chemical dynamic optimization problems show that the EBSO algorithm has good performance to a certain extent, which further proves the effectiveness of the EBSO algorithm and has a better optimization ability.

Hyper-Heuristic Based on ACO and Local Search for Dynamic Optimization Problems

Hyper-heuristics comprise a set of approaches that are motivated (at least in part) by the objective of intelligently combining heuristic methods to solve hard optimization problems. Ant colony optimization (ACO) algorithms have been proven to deal with Dynamic Optimization Problems (DOPs) properly. Despite the good results obtained by the integration of local search operators with ACO, little has been done to tackle DOPs. In this research, one of the most reliable ACO schemes, the MAX-MIN Ant System (MMAS), has been integrated with advanced and effective local search operators, resulting in an innovative hyper-heuristic. The local search operators are the Lin–Kernighan (LK) and the Unstringing and Stringing (US) heuristics, and they were intelligently chosen to improve the solution obtained by ACO. The proposed method aims to combine the adaptation capabilities of ACO for DOPs and the good performance of the local search operators chosen in an adaptive way and based on their performance, creating in this way a hyper-heuristic. The travelling salesman problem (TSP) was the base problem to generate both symmetric and asymmetric dynamic test cases. Experiments have shown that the MMAS provides good initial solutions to the local search operators and the hyper-heuristic creates a robust and effective method for the vast majority of test cases.

AUTOMATED COMPLEX OF ECONOMIC EFFICIENCY OF PROJECTS

This is how the software package for system-dynamic optimization of the economic efficiency of projects is described: software for calculating the intensity and determining the composition of traffic from a video image; a financial and economic model for a comprehensive analysis of roadside service facilities, which, based on the input of initial data, predicts the results of the financial and economic activity of the object and allows evaluating the feasibility of investments in construction/reconstruction/modernization, and also allows evaluating the maximum possible amount of investment; a technical solution for collecting video analytics.

The Optimum Allocation of Consumption of the Fisherian Shipwrecked Sailors

The theory of interest of Irving Fisher was designed to explain positive, zero, and negative interest rate. One of the intertemporal equilibria with the zero interest is an economy with a given supply of hardtacks for shipwrecked sailors. Hardtacks can be fully saved for the future, but their stock cannot be enlarged by production. Fisher presented several streams of consumption of hardtacks over time. This paper shows that the Fisherian paths are not consistent with the dynamic optimization model. Different trajectories of the optimum consumption are calculated and sketched. Their shape depends on the value of the subjective discount rate, the intertemporal elasticity of substitution in consumption, and the lifetime horizon of the shipwrecked sailors. None of them resemble the original Fisher examples.

Dynamic optimization reveals alveolar epithelial cells as key mediators of host defense in invasive aspergillosis

Aspergillus fumigatus is an important human fungal pathogen and its conidia are constantly inhaled by humans. In immunocompromised individuals, conidia can grow out as hyphae that damage lung epithelium. The resulting invasive aspergillosis is associated with devastating mortality rates. Since infection is a race between the innate immune system and the outgrowth of A. fumigatus conidia, we use dynamic optimization to obtain insight into the recruitment and depletion of alveolar macrophages and neutrophils. Using this model, we obtain key insights into major determinants of infection outcome on host and pathogen side. On the pathogen side, we predict in silico and confirm in vitro that germination speed is an important virulence trait of fungal pathogens due to the vulnerability of conidia against host defense. On the host side, we found that epithelial cells, which have been underappreciated, play a role in fungal clearance and are potent mediators of cytokine release. Both predictions were confirmed by in vitro experiments on established cell lines as well as primary lung cells. Further, our model affirms the importance of neutrophils in invasive aspergillosis and underlines that the role of macrophages remains elusive. We expect that our model will contribute to improvement of treatment protocols by focusing on the critical components of immune response to fungi but also fungal virulence traits.