29 September 2020 in IEEE Transactions on Intelligent Transportation Systems
Reasonable bus timetable can reduce the operating costs of bus company and improve the quality of bus services. A data-driven method is proposed to optimize bus timetable in this study. Firstly, a bi-objective optimization model is constructed considering minimize the total waiting time of passengers and the departure times of bus company. Then, Global Positioning System (GPS) trajectories of buses and passenger information collected from Smart Card are fused and applied to calculate the key parameters or variables in optimization model, including time-dependent travel time, bus dwell time and passenger volume. Finally, by adopting a specific coding scheme, an improved Non-dominated Sorting Genetic Algorithm-II (NSGA-II) is designed to quickly search Pareto optimal solutions. Furthermore, an experiment is conducted in Beijing city from one bus line to validate the effectiveness of the proposed method. Comparing with empirical scheduling method and traditional single-objective optimization base on GA, the results show that the proposed model could quickly provide high-quality and reasonable timetable schemes for the administrator in urban transit system.
1 December 2018 in Physica A: Statistical Mechanics and its Applications
24 April 2024 in IEEE Transactions on Evolutionary Computation
Dynamic workflow scheduling (DWS) is a challenging and important optimization problem in cloud computing, aiming to execute multiple heterogeneous workflows on dynamically leased virtual machine resources to satisfy user-defined Quality of Service requirements. For the popular deadline-constrained DWS in cloud problem, a virtual machine selection rule (VMSR) and a task selection rule (TSR) need to be designed simultaneously to minimize the rental fee and deadline violation penalty. For this purpose, Dual-Tree Genetic Programming (DTGP) has been previously developed to automatically evolve effective VMSRs and TSRs. However, existing DTGP approaches assume that VMSR and TSR, as well as terminals used by VMSRs and TSRs are equally important and evolve both VMSRs and TSRs in a black box manner, i.e., without using any knowledge about different impacts of trees and terminals. Several recent studies clearly indicate that different trees or terminals have varied performance impacts, making it critical to develop adaptive mutation mechanisms for effective DTGP. Driven by this motivation, this paper proposes two new levels of adaptive mutation mechanisms, contributing to the development of a new DTGP algorithm, which features the use of three new probability vectors for adaptive tree selection of VMSR and TSR at the first level and adaptive terminal selection at the second level while mutating any existing dual-tree individuals. Extensive experimental results demonstrate that the proposed two adaptive mechanisms can improve the effectiveness of DTGP compared to four baseline algorithms.
12 June 2024 in Information Sciences