Sensitivity analysis of activity scheduling parameters with a parameter optimization framework
Year: 2024
Type: article
Abstract: • The parameters of the problem of daily activity chain optimization are presented. • The relevant parameters are identified, and an evaluation framework is developed. • Sensitivity analysis is conducted to reveal how the attributes modify the output. • A peculiar behavior of the parameters and the activity chains is revealed. Transportation-related activity scheduling is becoming more complex due to the growing number of potential locations and extensive opportunities to visit various places. Throughout the years, in the field of transportation several attempts were made to optimize travelers’ activity chains with different parameters to set, but there is a lack of comprehensive solutions. In this research, the activity chain optimization algorithm is applied, which requires high computational efforts. To provide an adequate calibration of the parameters, a sensitivity analysis is conducted. The aim of the analysis is to reveal how changes in the attribute values modify the final outcomes. The relevant parameters, activity chains, transport modes, optimization algorithms, and fitness functions, are identified and considered. For each parameter, an investigation is conducted to reveal its behavior throughout the runs. For example, changes in the population size and crossover function lead to more reliable results, while alteration in the number of generations and the mutation function have no effects on the outcomes. The analysis presents a peculiar behavior of the parameters related to the activity chains. The results can be useful for transportation planners and service providers in the adaptation of the existing network and transportation services to the travelers’ mobility patterns.
Institution: Budapest University of Technology and Economics
Language: English
Subfield: Transportation
Field: Social Sciences
Domain: Social Sciences
Open Access status: gold
Estimated APC paid: $1,640
Funder: Magyar Tudományos Akadémia
Award: G6411896855
OpenAlex ID: W4402546686
