Transportmetrica A-Transport Science最新文献

英文中文

Accounting for passenger loss in bus bunching reduction: a robust real-time speed control method 在减少公交车拥挤时考虑乘客损失：一种稳健的实时速度控制方法

IF 3.1 2区工程技术 Q2 TRANSPORTATION

Transportmetrica A-Transport Science

Pub Date : 2026-01-02 DOI: 10.1080/23249935.2024.2342034

Kunpeng Ning , Hai Jiang

Bus bunching is a common phenomenon resulting from the inherent instability influenced by factors such as traffic and passenger behaviour. However, the issue of passenger loss caused by extended waiting time, is often overlooked despite being a significant concern for passengers. This paper addresses this problem by modelling passenger arrival and loss as a Markov birth–death process. We present a transit route model that incorporates passenger loss while considering additional factors, such as stochasticity, overtaking, passenger alighting, and bus capacity constraints. The primary objective of our model is to minimise passenger loss. To achieve this, we conduct an analysis about the characteristics of passenger loss. Under mild assumptions, we prove that passenger loss increases as the headways between buses exhibit greater variance. We also develop a robust optimisation (RO) method and corresponding algorithms to minimise passenger loss. To validate the effectiveness of our control method, we conduct numerical experiments using both computer-generated and real-world data. The results demonstrate that our method effectively reduces bus bunching, passenger loss, and waiting time compared to the existing literature.

由于受交通和乘客行为等因素的影响，公交车本身存在不稳定性，因此公交车串车是一种常见现象。然而，由于长时间等候而造成的乘客损失问题却一直没有得到解决。

{"title":"Accounting for passenger loss in bus bunching reduction: a robust real-time speed control method","authors":"Kunpeng Ning , Hai Jiang","doi":"10.1080/23249935.2024.2342034","DOIUrl":"10.1080/23249935.2024.2342034","url":null,"abstract":"<div><div>Bus bunching is a common phenomenon resulting from the inherent instability influenced by factors such as traffic and passenger behaviour. However, the issue of passenger loss caused by extended waiting time, is often overlooked despite being a significant concern for passengers. This paper addresses this problem by modelling passenger arrival and loss as a Markov birth–death process. We present a transit route model that incorporates passenger loss while considering additional factors, such as stochasticity, overtaking, passenger alighting, and bus capacity constraints. The primary objective of our model is to minimise passenger loss. To achieve this, we conduct an analysis about the characteristics of passenger loss. Under mild assumptions, we prove that passenger loss increases as the headways between buses exhibit greater variance. We also develop a robust optimisation (RO) method and corresponding algorithms to minimise passenger loss. To validate the effectiveness of our control method, we conduct numerical experiments using both computer-generated and real-world data. The results demonstrate that our method effectively reduces bus bunching, passenger loss, and waiting time compared to the existing literature.</div></div>","PeriodicalId":48871,"journal":{"name":"Transportmetrica A-Transport Science","volume":"22 1","pages":""},"PeriodicalIF":3.1,"publicationDate":"2026-01-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140634734","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Characterising the low-cost carrier network in Southeast Asia: a complex network analysis 东南亚低成本航空公司网络的特点：复杂网络分析

IF 3.1 2区工程技术 Q2 TRANSPORTATION

Transportmetrica A-Transport Science

Pub Date : 2026-01-02 DOI: 10.1080/23249935.2024.2385355

Maneerat Kanrak , Yui-yip Lau , Xiaowen Fu , Xavier Ling , Qiong Chen , Saksuriya Traiyarach

This study analyses the low-cost carrier network (LCCN) in Southeast Asia using complex network analysis. An analysis is conducted using the data from 2010 to 2018 covering 442 airports connected by 2,296 air routes. The LCCN is a scale-free network with a degree distribution following a power law in which fewer airports have high connectivity. It is a sparse network with a low network density. The network is efficient with a small average shortest path length, but low intra-connectivity amongst airports in the same cluster. This suggests that with good affordability and low costs, low-cost carriers play an important role in providing essential air connectivity to small and distanced destinations. Although low-cost carriers tend to use a point-to-point network instead of a hub-and-spoke network, major airports still play essential roles in shaping network connectivity and performance. Therefore, airports must have ample capacity and good infrastructure to ensure the network’s performance.

本研究采用复杂网络分析法对东南亚的低成本航空公司网络（LCCN）进行了分析。分析使用了2010年至2018年的数据，涵盖了442个机场，这些机场通过...

引用次数: 0

Roles of physical collision forces and walking characteristics on pedestrian traffic flow status 物理碰撞力和步行特征对行人交通流状态的影响

IF 3.1 2区工程技术 Q2 TRANSPORTATION

Transportmetrica A-Transport Science

Pub Date : 2026-01-02 DOI: 10.1080/23249935.2024.2350645

Zhenya Zhang , Jibiao Zhou , Pengfei Zhao , Sheng Dong , Hongliang Ding

The physical collision force between pedestrians affects the walking states of pedestrians. However, the relationship between physical collision force and pedestrian walking states remains unclear. To bridge this gap, a series of pedestrian-controlled experiments were designed. During the experiments, the physical collision forces were obtained using pressure sensors worn by the pedestrian. Walking characteristics, including speed and density, were obtained through video processing technologies from aerial videos taken by drones. Furthermore, the relationships between the physical collision forces and the walking characteristics were analyzed. The results show that, when the collision forces between pedestrians exceed 715 N, it will lead to the instability in the pedestrian traffic flow; when the collision forces are less than 400 N, the pedestrian walking state will remain stable; and when the collision forces are between 400 and 715 N, the pedestrian walking status may be described as in either an unstable or stable state.

行人之间的物理碰撞力会影响行人的行走状态。然而，物理碰撞力与行人行走状态之间的关系仍不明确....。

引用次数: 0

A theoretic analysis of expressed toll lane pricing policy targeting for a guaranteed level of service 对以保证服务水平为目标的明示收费车道定价政策的理论分析

IF 3.1 2区工程技术 Q2 TRANSPORTATION

Transportmetrica A-Transport Science

Pub Date : 2026-01-02 DOI: 10.1080/23249935.2024.2368003

Atabak Mardan , Ziyue Qi , Zheng Zhu , Shanjiang Zhu

This study compares the first-best toll algorithm that is theoretically appealing with the density-based toll algorithm that is more popular in practice. The comparison shows that both toll schemes can serve as a travel demand management strategy. Although the first-best scheme always leads to minimal total travel time, it is not necessarily attractive from toll operators' perspective. The density-based scheme is (1) more reliable for ensuring the federally mandated minimal level of services when the demand is high, (2) simpler for data collection and implementation, and (3) can generate higher revenues. From the users' perspective, the first-best scheme leads to less total costs in many cases, but the density-based scheme could also lead to less total costs under certain conditions. Traffic patterns could converge in both cases under a day-to-day framework. The speed of convergence for traffic dynamics is faster under the density-based scheme in most cases.

本研究比较了理论上具有吸引力的第一最优收费算法和在实践中更受欢迎的基于密度的收费算法。比较结果表明，两种收费方案...

引用次数: 0

Dependent Hidden Markov Model for pedestrian intention prediction: considering Multivariate Interaction Force 行人意向预测的依赖隐马尔可夫模型：考虑多变量相互作用力

IF 3.1 2区工程技术 Q2 TRANSPORTATION

Transportmetrica A-Transport Science

Pub Date : 2026-01-02 DOI: 10.1080/23249935.2024.2373921

Zhuping Zhou , Zixu Wang , Yang Liu , Zheng Chen , Yongneng Xu

Accurately recognizing and predicting pedestrian intentions is crucial for autonomous vehicle safety. However, existing prediction models often fail to comprehensively consider interactions between various traffic elements, resulting in suboptimal accuracy and robustness, especially in complex environments. To address this, we propose a pedestrian intention prediction model combining the Multivariate Interaction Force (MIF) model and a Dependent Hidden Markov Model (DE-HMM) for unsignalized midblock crossings. The MIF model captures dynamic interactions among pedestrians, vehicles, and the environment, while DE-HMM uses MIF data and pedestrian head orientation for predictions. Our model achieves 91.5% accuracy in recognizing crossing intentions, and 88.7% and 85.1% accuracy for predictions 0.5s and 1s ahead, respectively, outperforming current mainstream models and demonstrating strong robustness in special scenarios.

准确识别和预测行人的意图对自动驾驶汽车的安全至关重要。然而，现有的预测模型往往未能全面考虑行人与车辆之间的相互作用。

引用次数: 0

Uncovering pedestrian midblock crash severity patterns using association rules mining 利用关联规则挖掘行人在街区中段碰撞的严重程度模式

IF 3.1 2区工程技术 Q2 TRANSPORTATION

Transportmetrica A-Transport Science

Pub Date : 2026-01-02 DOI: 10.1080/23249935.2024.2379948

Rohit Chakraborty , Subasish Das , Md Nasim Khan

The current study investigated the contributing factors and temporal variation in pedestrian crashes at midblock, with a particular focus on the severity levels: fatal/severe, moderate injury, and minor/no injury. It used association rules mining to uncover patterns between crash-contributing factors. By generating, evaluating, and visualising association rules for each severity level within each cluster, significant findings were discovered. Significant associations are observed between fatal crashes on weekdays and factors such as alcohol or drug impairment and nighttime. Similarly, factors including one-way roadway type, summer, and 25 MPH posted speed limit have a strong association with moderate injury crashes during weekdays. On weekends, nighttime crashes with non-motorised vehicles have the strongest association with fatal/severe injury crashes. Moreover, the generated rules for nighttime pedestrian fatal/severe injury crashes highlighted physical or drug-impaired pedestrians as the predominant attribute. The findings can enhance pedestrian safety at midblocks through targeted interventions.

本研究调查了街区中段行人碰撞事故的诱发因素和时间变化，尤其侧重于严重程度：致命/严重、中度伤害和...

{"title":"Uncovering pedestrian midblock crash severity patterns using association rules mining","authors":"Rohit Chakraborty , Subasish Das , Md Nasim Khan","doi":"10.1080/23249935.2024.2379948","DOIUrl":"10.1080/23249935.2024.2379948","url":null,"abstract":"<div><div>The current study investigated the contributing factors and temporal variation in pedestrian crashes at midblock, with a particular focus on the severity levels: fatal/severe, moderate injury, and minor/no injury. It used association rules mining to uncover patterns between crash-contributing factors. By generating, evaluating, and visualising association rules for each severity level within each cluster, significant findings were discovered. Significant associations are observed between fatal crashes on weekdays and factors such as alcohol or drug impairment and nighttime. Similarly, factors including one-way roadway type, summer, and 25 MPH posted speed limit have a strong association with moderate injury crashes during weekdays. On weekends, nighttime crashes with non-motorised vehicles have the strongest association with fatal/severe injury crashes. Moreover, the generated rules for nighttime pedestrian fatal/severe injury crashes highlighted physical or drug-impaired pedestrians as the predominant attribute. The findings can enhance pedestrian safety at midblocks through targeted interventions.</div></div>","PeriodicalId":48871,"journal":{"name":"Transportmetrica A-Transport Science","volume":"22 1","pages":""},"PeriodicalIF":3.1,"publicationDate":"2026-01-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141930409","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A synchronization-constraints-based dual bands method of traffic signal optimization 基于同步约束的双波段交通信号优化方法

IF 3.1 2区工程技术 Q2 TRANSPORTATION

Transportmetrica A-Transport Science

Pub Date : 2026-01-02 DOI: 10.1080/23249935.2024.2332965

Kai Lu , Guanghui Xu , Xiaofeng Xie , Jianmin Xu , Yinhai Wang

This paper presents a synchronization-constraints-based dual bands method of traffic signal optimization for multiple traffic flows. The synchronization coefficient, traffic volume ratio, synchronization benefit, and their thresholds of traffic flow pair are proposed to select synchronized traffic flow pairs for progression. Then, progression bands of multiple traffic flows can be achieved by merging time windows, combining equivalent phase, and optimizing benefits evaluation index of the synchronized traffic flow pair. The proposed method adopts step-by-step optimization processing, and the combinatorial optimization of signal cycle, phase sequence, and offset is decomposed by performing synchronization and progression. A real-world case is presented to illustrate the application of the proposed method with VISSIM simulations. The results show that compared with the MULTIBAND model and TRANSYT, this method significantly decreased the average delay and average stops along the arterial of the entire traffic system composed of buses and cars.

本文提出了一种基于同步约束的多交通流双波段交通信号优化方法。同步系数、交通流量比、同步时间、同步频率、同步...

引用次数: 0

An improved alternating direction method of multipliers for solving deterministic user equilibrium 求解确定性用户均衡的改进交替方向乘法

IF 3.1 2区工程技术 Q2 TRANSPORTATION

Transportmetrica A-Transport Science

Pub Date : 2026-01-02 DOI: 10.1080/23249935.2024.2328209

Honggang Zhang , Zhiyuan Liu , Xiangyang Xu , Xinyuan Chen , Yunchi Wu , Pan Liu

An improved alternating direction method of multipliers (iADMM) algorithm is proposed for solving the deterministic user equilibrium (DUE) problem. The iADMM algorithm introduces a key improvement wherein the primal variables can be updated sequentially, possibly multiple times, before updating the dual variables. Subsequently, a sensitivity analysis method is applied to optimise the update frequency of primal variable, and two indices are introduced to evaluate the performance of various policies. Additionally, eliminating equality constraints through the augmented Lagrangian function makes it challenging to completely satisfy flow conservation conditions, resulting in the presence of primal residual. To address this issue, two schemes are proposed to handle the primal residual, involving modifications to the primal variables based on iterative messages. Numerical experiments highlight that the convergence of ADMM algorithm is significantly influenced by the update frequency of primal variable, and addressing the primal residual after each cycle enhances the convergence of ADMM algorithm.

本文提出了一种改进的交替乘法（iADMM）算法，用于解决确定性用户均衡（DUE）问题。iADMM 算法引入了一个关键改进 ...

{"title":"An improved alternating direction method of multipliers for solving deterministic user equilibrium","authors":"Honggang Zhang , Zhiyuan Liu , Xiangyang Xu , Xinyuan Chen , Yunchi Wu , Pan Liu","doi":"10.1080/23249935.2024.2328209","DOIUrl":"10.1080/23249935.2024.2328209","url":null,"abstract":"<div><div>An improved alternating direction method of multipliers (iADMM) algorithm is proposed for solving the deterministic user equilibrium (DUE) problem. The iADMM algorithm introduces a key improvement wherein the primal variables can be updated sequentially, possibly multiple times, before updating the dual variables. Subsequently, a sensitivity analysis method is applied to optimise the update frequency of primal variable, and two indices are introduced to evaluate the performance of various policies. Additionally, eliminating equality constraints through the augmented Lagrangian function makes it challenging to completely satisfy flow conservation conditions, resulting in the presence of primal residual. To address this issue, two schemes are proposed to handle the primal residual, involving modifications to the primal variables based on iterative messages. Numerical experiments highlight that the convergence of ADMM algorithm is significantly influenced by the update frequency of primal variable, and addressing the primal residual after each cycle enhances the convergence of ADMM algorithm.</div></div>","PeriodicalId":48871,"journal":{"name":"Transportmetrica A-Transport Science","volume":"22 1","pages":""},"PeriodicalIF":3.1,"publicationDate":"2026-01-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140154347","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

An efficient hyperpath-based algorithm for the capacitated transit equilibrium assignment problem 基于超路径的高效算法，用于解决有容量的过境均衡分配问题

IF 3.1 2区工程技术 Q2 TRANSPORTATION

Transportmetrica A-Transport Science

Pub Date : 2026-01-02 DOI: 10.1080/23249935.2024.2326819

Wenxin Liang , Zhandong Xu , Jun Xie , Xiaobo Liu , Yuting Feng

This paper studied the capacitated transit equilibrium assignment problem (CTEAP), which particularly accounts for the capacity effect that impacts passengers' route choices in a transit network. Specifically, we impose strict capacity constraints on line segments to ensure that the passenger flow does not exceed the line capacity. By introducing associated Lagrange multipliers, we derived the generalised hyperpath cost function and established an equivalent variational inequality formulation. A solution framework is developed to solve CTEAP based on the Method of Multipliers. To handle destroyed Cartesian product structures, we transformed the master problem into a sequence of uncapacitated subproblems, which can be tackled by two modified Newton-type hyperpath-based algorithms. Numerical analyses were performed for a small Gentile network and a large Shenzhen transit network to evaluate the impacts of the capacity constraint on passenger flows and computation costs. Our results demonstrate the superiority of the proposed CTEAP model to prevent over-loaded flows, and show the promise of applying the hyperpath-based algorithm in the implementation of real-world networks.

本文研究了有容量的公交均衡分配问题（CTEAP），该问题特别考虑了影响乘客在公交网络中路线选择的容量效应。S...

{"title":"An efficient hyperpath-based algorithm for the capacitated transit equilibrium assignment problem","authors":"Wenxin Liang , Zhandong Xu , Jun Xie , Xiaobo Liu , Yuting Feng","doi":"10.1080/23249935.2024.2326819","DOIUrl":"10.1080/23249935.2024.2326819","url":null,"abstract":"<div><div>This paper studied the capacitated transit equilibrium assignment problem (CTEAP), which particularly accounts for the capacity effect that impacts passengers' route choices in a transit network. Specifically, we impose strict capacity constraints on line segments to ensure that the passenger flow does not exceed the line capacity. By introducing associated Lagrange multipliers, we derived the generalised hyperpath cost function and established an equivalent variational inequality formulation. A solution framework is developed to solve CTEAP based on the Method of Multipliers. To handle destroyed Cartesian product structures, we transformed the master problem into a sequence of uncapacitated subproblems, which can be tackled by two modified Newton-type hyperpath-based algorithms. Numerical analyses were performed for a small Gentile network and a large Shenzhen transit network to evaluate the impacts of the capacity constraint on passenger flows and computation costs. Our results demonstrate the superiority of the proposed CTEAP model to prevent over-loaded flows, and show the promise of applying the hyperpath-based algorithm in the implementation of real-world networks.</div></div>","PeriodicalId":48871,"journal":{"name":"Transportmetrica A-Transport Science","volume":"22 1","pages":""},"PeriodicalIF":3.1,"publicationDate":"2026-01-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140100314","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Column generation for the collaborative multi-stop truckload shipping problem in daily regional distribution 日常区域配送中多站协作卡车装运问题的列生成

IF 3.1 2区工程技术 Q2 TRANSPORTATION

Transportmetrica A-Transport Science

Pub Date : 2026-01-02 DOI: 10.1080/23249935.2024.2378361

Minghui Lai , Qian Hu , Weili Xue , Huajing Liu

Multi-stop truckload shipping offers less-than-truckload shippers a promising way to reduce their freight costs by consolidating freights en route, which is similar to ridesharing in the mobility industry. One significant challenge in practical implementation is designing attractive multi-stop routes that to shippers while conforming to carriers' requirements. It is crucial to develop an efficient optimisation algorithm to automate bundling decisions. However, this routeing problem is complicated by a nonlinear inseparable cost structure and new routeing decisions in the first pickup and last delivery points. We introduce a new variant of pickup and delivery model and propose a column generation algorithm to efficiently solve real-world multi-stop routeing problems. The algorithm utilises a new specialised labelling procedure that exclusively generates labels for pickup sequences and establishes new dominance rules. Theoretical results on the label dominance, algorithm complexity, and optimality gap are also established. We conduct a real-world case study, comparing our methodology against the enumeration method and a heuristic method documented in the literature. The computational results demonstrate the high efficiency of our method and reveal important insights for practitioners.

多站式卡车货运为零担货物托运人提供了一种很有前景的方式，通过在途中合并货物来降低货运成本。

{"title":"Column generation for the collaborative multi-stop truckload shipping problem in daily regional distribution","authors":"Minghui Lai , Qian Hu , Weili Xue , Huajing Liu","doi":"10.1080/23249935.2024.2378361","DOIUrl":"10.1080/23249935.2024.2378361","url":null,"abstract":"<div><div>Multi-stop truckload shipping offers less-than-truckload shippers a promising way to reduce their freight costs by consolidating freights en route, which is similar to ridesharing in the mobility industry. One significant challenge in practical implementation is designing attractive multi-stop routes that to shippers while conforming to carriers' requirements. It is crucial to develop an efficient optimisation algorithm to automate bundling decisions. However, this routeing problem is complicated by a nonlinear inseparable cost structure and new routeing decisions in the first pickup and last delivery points. We introduce a new variant of pickup and delivery model and propose a column generation algorithm to efficiently solve real-world multi-stop routeing problems. The algorithm utilises a new specialised labelling procedure that exclusively generates labels for pickup sequences and establishes new dominance rules. Theoretical results on the label dominance, algorithm complexity, and optimality gap are also established. We conduct a real-world case study, comparing our methodology against the enumeration method and a heuristic method documented in the literature. The computational results demonstrate the high efficiency of our method and reveal important insights for practitioners.</div></div>","PeriodicalId":48871,"journal":{"name":"Transportmetrica A-Transport Science","volume":"22 1","pages":""},"PeriodicalIF":3.1,"publicationDate":"2026-01-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141775219","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

首页上一页

下一页尾页

类型

全部化学•材料生命科学医学物理工程技术环境•农林材料科学地球科学法学管理学化学环境科学与生态学计算机科学教育学经济学农林科学人文科学生物学数学物理与天体物理心理学综合性期刊其他工业工程理学历史学农学文学信息工程

数据库

全部 ACS Publications Elsevier ieeexplore Springer The Royal Society of Chemistry Wiley

期刊

Transportmetrica A-Transport Science

全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.

﹀