4.5 Article

Computation and application of the paired combinatorial logit stochastic user equilibrium problem

Journal

COMPUTERS & OPERATIONS RESEARCH
Volume 43, Issue -, Pages 68-77

Publisher

PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cor.2013.08.022

Keywords

Logit; Paired combinatorial logit; Stochastic user equilibrium; Traffic assignment; Partial linearization; Line search

Funding

  1. National Science Foundation (NSF) CAREER
  2. United States, the Oriental Scholar Professorship Program
  3. Shanghai Ministry of Education in China
  4. National Research Foundation of Korea
  5. Korea Government (MEST) [NRF-2010-0029443]

Ask authors/readers for more resources

The paired combinatorial logit (PCL) model is one of the recent extended logit models adapted to resolve the overlapping problem in the route choice problem, while keeping the analytical tractability of the logit choice probability function. However, the development of efficient algorithms for solving the PCL model under congested and realistic networks is quite challenging, since it has large-dimensional solution variables as well as a complex objective function. In this paper, we examine the computation and application of the PCL stochastic user equilibrium (SUE) problem under congested and realistic networks. Specifically, we develop an improved path-based partial linearization algorithm for solving the PCL SUE problem by incorporating recent advances in line search strategies to enhance the computational efficiency required to determine a suitable stepsize that guarantees convergence. A real network in the city of Winnipeg is applied to examine the computational efficiency of the proposed algorithm and the robustness of various line search strategies. In addition, in order to acquire the practical implications of the PCL SUE model, we investigate the effectiveness of how the PCL model handles the effects of congestion, stochasticity, and similarity in comparison with the multinomial logit stochastic traffic equilibrium problem and the deterministic traffic equilibrium problem. Published by Elsevier Ltd.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.5
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

Article Transportation

Impacts of the least perceived travel cost on the Weibit network equilibrium

Guangchao Wang, Kebo Tong, Anthony Chen, Hang Qi, Xiangdong Xu, Shoufeng Ma

Summary: This study investigates the impacts of the least perceived travel cost on the stochastic user equilibrium problem. The Weibit SUE models with a positive location parameter reduce perception variances route-specifically and resolve the scale insensitivity issue. Numerical results confirm the analytical results and demonstrate the efficiency and robustness of the proposed solution algorithm.

TRANSPORTMETRICA A-TRANSPORT SCIENCE (2023)

Article Computer Science, Interdisciplinary Applications

Accelerating the gradient projection algorithm for solving the non-additive traffic equilibrium problem with the Barzilai-Borwein step size

Heqing Tan, Muqing Du, Anthony Chen

Summary: This paper proposes an accelerated algorithm for solving the non-additive traffic equilibrium problem by relaxing the additivity assumption in traditional models, achieving higher efficiency and robustness.

COMPUTERS & OPERATIONS RESEARCH (2022)

Article Management

Strategy-based transit stochastic user equilibrium model with capacity and number-of-transfers constraints

Guoyuan Li, Anthony Chen

Summary: This paper proposes a strategy-based transit stochastic user equilibrium (SUE) model that considers capacity and number-of-transfers constraints in an urban congested transit network. The model uses a route-section-based method for network representation and assumes passengers' route choice behavior obeys the logit model. The transit line capacity and maximum number-of-transfers constraints are considered, and the problem is formulated as a variational inequality (VI) problem. A transit path-set generation procedure is proposed, and the asymmetric cost function is solved using the diagonalization method.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2023)

Article Economics

Sensitivity analysis for transit equilibrium assignment and applications to uncertainty analysis

Muqing Du, Anthony Chen

Summary: Systematic uncertainty analysis is crucial for evaluating the variation in model outputs and identifying critical sources of uncertainty to enhance the reliability and stability of a system. This study presents a sensitivity-based uncertainty analysis approach in equilibrium transit systems, considering uncertainties caused by probabilistic travel demand, congestion, and vehicle frequencies. The proposed method incorporates the congestion effect in passengers' route-choice models and utilizes the hyperpath concept to handle the common-line problem at transit stops. The developed approach enables the simultaneous propagation of uncertainties from different input sources to the model outputs, contributing to the practical applications of sensitivity and uncertainty analyses.

TRANSPORTATION RESEARCH PART B-METHODOLOGICAL (2022)

Article Engineering, Civil

Multimodal Urban Transportation Network Capacity Model Considering Intermodal Transportation

Jiankun Zhou, Muqing Du, Anthony Chen

Summary: This paper proposes an improved network capacity model that takes into account the intermodal transportation in urban multimodal transportation systems. The model considers both mode split and traffic assignment, and uses mathematical methods to efficiently solve the complex problem. Numerical results demonstrate the advantages and features of the proposed model.

TRANSPORTATION RESEARCH RECORD (2022)

Article Transportation

How to disseminate reliable waiting time in app-based transportation services considering attractiveness and credibility

Ruiya Chen, Xiangdong Xu, Anthony Chen, Xiaoning Zhang

Summary: This paper presents a conservative expected travel time approach, called MCET, for reporting reliable waiting time information in app-based transportation services, addressing the issues of existing information provision forms.

TRANSPORTMETRICA A-TRANSPORT SCIENCE (2023)

Article Transportation

A conservative expected travel time approach for traffic information dissemination under uncertainty

Ruiya Chen, Xiangdong Xu, Anthony Chen, Chao Yang

Summary: Travel time variability poses challenges to reporting travel time information. This paper proposes a conservative expected travel time approach to enhance information reliability and simplicity.

TRANSPORTMETRICA B-TRANSPORT DYNAMICS (2023)

Article Environmental Studies

Walk this way: Visualizing accessibility and mobility in metro station areas on a 3D pedestrian network

Yingying Xu, Ho-Yin Chan, Anthony Chen, Xintao Liu

Summary: This article evaluates and visualizes the accessibility and mobility of pedestrian networks around metro station areas in Hong Kong, highlighting significant differences and potential underlying causes.

ENVIRONMENT AND PLANNING B-URBAN ANALYTICS AND CITY SCIENCE (2022)

Article Economics

Measurement and ranking of important link combinations in the analysis of transportation network vulnerability envelope buffers under multiple-link disruptions

Yu Gu, Anthony Chen, Xiangdong Xu

Summary: This study proposes an optimization-based approach to rank the importance of link combinations and analyze network vulnerability in extreme and near-extreme cases of disruption. A vulnerability envelope concept is used, which considers the worst and best network performance under multiple-link disruptions. The results demonstrate that the consideration of near-extreme cases yields additional valuable information that is not generated by the traditional vulnerability analysis.

TRANSPORTATION RESEARCH PART B-METHODOLOGICAL (2023)

Article Transportation Science & Technology

Modeling mode choice of customized bus services with loyalty subscription schemes in multi-modal transportation networks

Yu Gu, Anthony Chen

Summary: This study proposes an advanced equilibrium mode choice model to analyze the mode choice behavior of emerging customized bus (CB) services. The model considers the unique characteristics of CB services, including seat reservation and loyalty scheme. The results demonstrate the importance of considering passenger loyalty and managing mode similarity and heterogeneity when modeling emerging CB services.

TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES (2023)

Article Environmental Studies

Time for hydrogen buses? Dynamic analysis of the Hong Kong bus market

Zhuowei Wang, Jiangbo Yu, Guoyuan Li, Chengxiang Zhuge, Anthony Chen

Summary: This study investigates the feasibility and policy implications of achieving carbon neutrality in Hong Kong's public transportation through a competitive bus-market mechanism. A dynamic bus-market evolution model is established using the system dynamics method, which incorporates a generalized Lotka-Volterra model and discrete choice model. The results suggest that relying on business-as-usual policies and market evolution may not be sufficient to achieve the desired level of zero-emission buses, and long-term subsidies for hydrogen buses and support for hydrogen stations are effective measures to promote the hydrogen bus market.

TRANSPORTATION RESEARCH PART D-TRANSPORT AND ENVIRONMENT (2023)

Article Geography

Drawing metro maps in concentric circles: A designer-in-the-loop approach with visual examples

Ho-Yin Chan, Yingying Xu, Anthony Chen, Xintao Liu, Kason Ka Ching Cheung

Summary: This article introduces a proof-of-concept designer-in-the-loop schematic map drawing tool, which combines manual and automated approaches to provide technical interactivity between the user and the computer. Compared to existing methods, the proposed approach is more compatible with the framework of effective map design from psychological and aesthetic perspectives, and offers a range of options based on user preferences.

TRANSACTIONS IN GIS (2023)

Article Environmental Studies

Electrification of a citywide bus network: A data-driven micro-simulation approach

Shiqi Wang, Yuze Li, Anthony Chen, Chengxiang Zhuge

Summary: This paper develops a data-driven micro-simulation optimization model for deploying charging infrastructure for a large-scale electric bus network. The model considers both traditional charging posts and wireless charging lanes. The results show that deploying both charging posts and WCLs leads to higher levels of service, energy savings, and reduced emissions compared to deploying only charging posts, although the total costs are slightly higher. Sensitivity analysis confirms that parameters associated with electric buses and charging facilities significantly influence the model outputs.

TRANSPORTATION RESEARCH PART D-TRANSPORT AND ENVIRONMENT (2023)

Article Economics

Time and toll trade-off with heterogeneous users: A continuous time surplus maximization bi-objective user equilibrium model

Zhandong Xu, Anthony Chen, Xiaobo Liu

Summary: This paper presents a continuous time surplus maximization bi-objective user equilibrium (C-TSmaxBUE) model, in which the users' variability toward the time and toll trade-off in a tolled road network is explicitly considered. The model assigns different users with different ratios of the time saved per unit of money (RTSMs), and infinite indifference curves are generated by considering continuously distributed RTSMs in the population. A path-based single-boundary adjustment (SBA) algorithm is developed to solve the problem, which adjusts RTSM boundaries and path flows simultaneously. Numerical results demonstrate the equilibrium flow pattern and the efficiency of the SBA algorithm in obtaining high-quality equilibrium solutions.

TRANSPORTATION RESEARCH PART B-METHODOLOGICAL (2023)

Article Economics

Investigating the risk factors of motorcycle crash injury severity in Pakistan: Insights and policy recommendations

Umer Mansoor, Arshad Jamal, Junbiao Su, N. N. Sze, Anthony Chen

Summary: Motorcycle crashes cause a significant number of fatalities and severe injuries worldwide, especially in developing countries. Machine learning methods have been found to provide better prediction performance, but with weaker interpretability. This study aims to compare the consistency of risk factors identified by statistical models and machine learning methods in analyzing motorcycle crash severity.

TRANSPORT POLICY (2023)

Article Computer Science, Interdisciplinary Applications

A unified exact approach for a broad class of vehicle routing problems with simultaneous pickup and delivery

Rafael Praxedes, Teobaldo Bulhoes, Anand Subramanian, Eduardo Uchoa

Summary: The Vehicle Routing Problem with Simultaneous Pickup and Delivery is a classical optimization problem that aims to determine the least-cost routes while meeting pickup and delivery demands and vehicle capacity constraints. In this study, a unified algorithm is proposed to solve multiple variants of the problem, and extensive computational experiments are conducted to evaluate the algorithm's performance.

COMPUTERS & OPERATIONS RESEARCH (2024)

Article Computer Science, Interdisciplinary Applications

An asynchronous parallel benders decomposition method for stochastic network design problems

Ragheb Rahmaniani, Teodor Gabriel Crainic, Michel Gendreau, Walter Rei

Summary: Benders decomposition (BD) is a popular solution algorithm for stochastic integer programs. However, existing parallelization methods often suffer from inefficiencies. This paper proposes an asynchronous parallel BD method and demonstrates its effectiveness through numerical studies and performance enhancement strategies.

COMPUTERS & OPERATIONS RESEARCH (2024)

Article Computer Science, Interdisciplinary Applications

Exact algorithms for a parallel machine scheduling problem with workforce and contiguity constraints

Giulia Caselli, Maxence Delorme, Manuel Iori, Carlo Alberto Magni

Summary: This study addresses a real-world scheduling problem and proposes four exact methods to solve it. The methods are evaluated through computational experiments on different types of instances and show competitive advantages on specific subsets. The study also demonstrates the generalizability of the algorithms to related scheduling problems with contiguity constraints.

COMPUTERS & OPERATIONS RESEARCH (2024)

Article Computer Science, Interdisciplinary Applications

An iteratively doubling binary search for the two-dimensional irregular multiple-size bin packing problem raised in the steel industry

Shaowen Yao, Chao Tang, Hao Zhang, Songhuan Wu, Lijun Wei, Qiang Liu

Summary: This paper examines the problem of two-dimensional irregular multiple-size bin packing and proposes a solution that utilizes an iteratively doubling binary search algorithm to find the optimal bin combination, and further optimizes the result through an overlap minimization approach.

COMPUTERS & OPERATIONS RESEARCH (2024)

Article Computer Science, Interdisciplinary Applications

Drop-and-pull container drayage with flexible assignment of work break for vehicle drivers

Decheng Wang, Ruiyou Zhang, Bin Qiu, Wenpeng Chen, Xiaolan Xie

Summary: Consideration of driver-related constraints, such as mandatory work break, in vehicle scheduling and routing is crucial for safety driving and protecting the interests of drivers. This paper addresses the drop-and-pull container drayage problem with flexible assignment of work break, proposing a mixed-integer programming model and an algorithm for solving realistic-sized instances. Experimental results show the effectiveness of the proposed algorithm in handling vehicle scheduling and routing with work break assignment.

COMPUTERS & OPERATIONS RESEARCH (2024)

Article Computer Science, Interdisciplinary Applications

Manipulating hidden-Markov-model inferences by corrupting batch data

William N. Caballero, Jose Manuel Camacho, Tahir Ekin, Roi Naveiro

Summary: This research provides a novel probabilistic perspective on the manipulation of hidden Markov model inferences through corrupted data, highlighting the weaknesses of such models under adversarial activity and emphasizing the need for robustification techniques to ensure their security.

COMPUTERS & OPERATIONS RESEARCH (2024)

Article Computer Science, Interdisciplinary Applications

Evolutionary multi-objective design of autoencoders for compact representation of histopathology whole slide images

Davood Zaman Farsa, Shahryar Rahnamayan, Azam Asilian Bidgoli, H. R. Tizhoosh

Summary: This paper proposes a multi-objective evolutionary framework for compressing feature vectors using deep autoencoders. The framework achieves high classification accuracy and efficient image representation through a bi-level optimization scheme. Experimental results demonstrate the effectiveness and efficiency of the proposed framework in image processing tasks.

COMPUTERS & OPERATIONS RESEARCH (2024)

Article Computer Science, Interdisciplinary Applications

Verifying new instances of the multidemand multidimensional knapsack problem with instance space analysis

Matthew E. Scherer, Raymond R. Hill, Brian J. Lunday, Bruce A. Cox, Edward D. White

Summary: This paper discusses instance generation methods for the multidemand multidimensional knapsack problem and introduces a primal problem instance generator (PPIG) to address feasibility issues in current instance generation methods.

COMPUTERS & OPERATIONS RESEARCH (2024)

Article Computer Science, Interdisciplinary Applications

Efficient iterative optimization to real-time train regulation in urban rail transit networks combined with Benders decomposition method

Yin Yuan, Shukai Li, Lixing Yang, Ziyou Gao

Summary: This paper investigates the design of real-time train regulation strategies for urban rail networks to reduce train deviations and passenger waiting times. A mixed-integer nonlinear programming (MINLP) model is used and an efficient iterative optimization (IO) approach is proposed to address the complexity. The generalized Benders decomposition (GBD) technique is also incorporated. Numerical experiments show the effectiveness and computational efficiency of the proposed method.

COMPUTERS & OPERATIONS RESEARCH (2024)

Article Computer Science, Interdisciplinary Applications

Unmanned surface vehicles (USVs) scheduling method by a bi-level mission planning and path control

Xinghai Guo, Netirith Narthsirinth, Weidan Zhang, Yuzhen Hu

Summary: This study proposes a bi-level scheduling method that utilizes unmanned surface vehicles for container transportation. By formulating mission decision and path control models, efficient container transshipment and path planning are achieved. Experimental results demonstrate the effectiveness of the proposed approach in guiding unmanned surface vehicles to complete container transshipment tasks.

COMPUTERS & OPERATIONS RESEARCH (2024)

Review Computer Science, Interdisciplinary Applications

Metaheuristics for bilevel optimization: A comprehensive review

Jose-Fernando Camacho-Vallejo, Carlos Corpus, Juan G. Villegas

Summary: This study aims to review the published papers on implementing metaheuristics for solving bilevel problems and performs a bibliometric analysis to track the evolution of this topic. The study provides a detailed description of the components of the proposed metaheuristics and analyzes the common combinations of these components. Additionally, the study provides a detailed classification of how crucial bilevel aspects of the problem are handled in the metaheuristics, along with a discussion of interesting findings.

COMPUTERS & OPERATIONS RESEARCH (2024)

Article Computer Science, Interdisciplinary Applications

Electric vehicle-based express service network design with recharging management: A branch-and-price approach

Xudong Diao, Meng Qiu, Gangyan Xu

Summary: In this study, an optimization model for the design of an electric vehicle-based express service network is proposed, considering limited recharging resources and power management. The proposed method is validated through computational experiments on realistic instances.

COMPUTERS & OPERATIONS RESEARCH (2024)

Article Computer Science, Interdisciplinary Applications

Bilevel optimization for the deployment of refuelling stations for electric vehicles on road networks

Ramon Piedra-de-la-Cuadra, Francisco A. Ortega

Summary: This study proposes a procedure to select candidate sites optimally for ensuring energy autonomy and reinforced service coverage for electric vehicles, while considering demand and budget restrictions.

COMPUTERS & OPERATIONS RESEARCH (2024)

Article Computer Science, Interdisciplinary Applications

Cutting Plane Approaches for the Robust Kidney Exchange Problem

Danny Blom, Christopher Hojny, Bart Smeulders

Summary: This paper focuses on a robust variant of the kidney exchange program problem with recourse, and proposes a cutting plane method for solving the attacker-defender subproblem. The results show a significant improvement in running time compared to the state-of-the-art, and the method can solve previously unsolved instances. Additionally, a new practical policy for recourse is proposed and its tractability for small to mid-size kidney exchange programs is demonstrated.

COMPUTERS & OPERATIONS RESEARCH (2024)

Article Computer Science, Interdisciplinary Applications

Generating linear programming instances with controllable rank and condition number

Anqi Li, Congying Han, Tiande Guo, Bonan Li

Summary: This study proposes a general framework for designing linear programming instances based on the preset optimal solution, and validates the effectiveness of the framework through experiments.

COMPUTERS & OPERATIONS RESEARCH (2024)