A dual approximation-based quantum-inspired genetic algorithm for the dynamic network design problem

Abstract

In this paper, we formulate a dynamic transportation network design model in which traffic dynamics are modeled by the cell transmission model. In the formulation, transportation planners decide on the optimal capacity expansion policies of existing transportation network infrastructure with limited resources, while road users react to the capacity changes by selfishly choosing routes to maximize their own profit. Owing to the problem complexity, a majority of the research efforts have focused on tackling this problem using meta-heuristics. In this study, we incorporate a series of dual-variable approximation techniques into the paradigm of a quantum-inspired genetic algorithm (QIGA) and devise an efficient evaluation function based on these techniques. The proposed QIGA contains a series of enhancements compared to conventional genetic algorithms (GAs) and can be considered as a better alternative when solving problems with a complex solution space. The QIGA is applied to a synthetic network, a subnetwork of a real-world road network, and a realistic network to justify its theoretical and practical value. From the numerical results, it is found that in the same computational time, the QIGA outperforms the conventional GA by 3.86-5.63% in terms of the objective value, which can be significant, especially when network expansion of a large urban area is considered. Technical, computational, and practical issues involved in developing the QIGA are investigated and discussed. KEYWORDSModeling and simulation; quantum-inspired genetic algorithm; dual variable approximation; equilibrium dynamic network design problem; bi-level programming

A Simulated Annealing for Optimizing Assignment of E-Scooters to Freelance Chargers

“…Metaheuristic techniques tend to overcome this problem by providing heuristics to guide the search process, thereby improving its efficiency in reaching near-optimal solutions within a reasonable time. Metaheuristic approaches have proven their value in solving many complex problems, such as scheduling [21][22][23]. According to [24], four aspects should be considered when comparing metaheuristic techniques:…”

Transient fault extraction for wind turbine generator bearing based on Bayesian biorthogonal sparse representation using adaptive redundant lifting wavelet dictionary

“…With regard to dictionary atomic search algorithms, the traditional dictionary atomic search genetic algorithm (GA) 21 requires a large amount of calculations and suffers from slow running speeds, early maturity, slow convergence speeds, and poor stability. The quantum GA (QGA) 22 fully borrows the framework of the qubit calculation and quantum-state superposition of the GA but offers better search performance than the traditional GA. However, for continuous function optimization problems, especially multi-peak continuous function optimization problems, the conventional QGA limits the ability of the population to evolve and the algorithm is unable to jump out of local optima.…”