Pub Date : 2025-03-06DOI: 10.1016/j.trb.2025.103190
Ming Liu , Zhongzheng Liu , Feng Chu , Feifeng Zheng , Alexandre Dolgui
Supply chain (SC) has been increasingly challenged by disruption events (DEs), where super DEs (SDEs) comprising a sequence of DEs, e.g., COVID-19, pose significant threats with long-term impacts. To hedge against SDEs, SC viability has been introduced, whose distinctive feature is the ability to adapt the SC structure. Building SC viability via dynamic SC structural adaptation under SDEs, however, has not been quantitatively addressed in the literature. This study investigates a novel viable SC building problem under SDEs. It consists of timely assessing the disruption risk and dynamically adapting the SC structure, to satisfy uncertain demands. The aim is to find the best balance between the disruption risk and the SC operational cost. To portray the structural and temporal risk propagations along the dynamic SC structure, a new structure-variable dynamic Bayesian network (SVDBN) is proposed. Then, a bi-objective mixed-integer non-linear programming (MI-NLP) model is established. Based on analyses of problem features, a decomposition-and-clustering (DC) heuristic algorithm is designed to solve the problem. Numerical experiments are conducted to evaluate the performance of the approach, and managerial insights are provided as well.
{"title":"Dynamic structural adaptation for building viable supply chains under super disruption events","authors":"Ming Liu , Zhongzheng Liu , Feng Chu , Feifeng Zheng , Alexandre Dolgui","doi":"10.1016/j.trb.2025.103190","DOIUrl":"10.1016/j.trb.2025.103190","url":null,"abstract":"<div><div>Supply chain (SC) has been increasingly challenged by disruption events (DEs), where super DEs (SDEs) comprising a sequence of DEs, e.g., COVID-19, pose significant threats with long-term impacts. To hedge against SDEs, SC viability has been introduced, whose distinctive feature is the ability to adapt the SC structure. Building SC viability via dynamic SC structural adaptation under SDEs, however, has not been quantitatively addressed in the literature. This study investigates a novel viable SC building problem under SDEs. It consists of timely assessing the disruption risk and dynamically adapting the SC structure, to satisfy uncertain demands. The aim is to find the best balance between the disruption risk and the SC operational cost. To portray the structural and temporal risk propagations along the dynamic SC structure, a new structure-variable dynamic Bayesian network (SVDBN) is proposed. Then, a bi-objective mixed-integer non-linear programming (MI-NLP) model is established. Based on analyses of problem features, a decomposition-and-clustering (DC) heuristic algorithm is designed to solve the problem. Numerical experiments are conducted to evaluate the performance of the approach, and managerial insights are provided as well.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"195 ","pages":"Article 103190"},"PeriodicalIF":5.8,"publicationDate":"2025-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143548370","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-02-27DOI: 10.1016/j.trb.2025.103187
Chuanyao Li , Mengting Wang , Hai-Jun Huang
The basic corridor problem is significant for the study of traffic congestion and travel behavior, paving way to insights into the spatial dynamics of rush-hour traffic flow pattern. In light of the fact that previous studies have yielded only preliminary results, this paper considers both early and late commuters to provide more comprehensive results. By introducing the continuous schedule preference (CSP), we determine the form and characteristics of the equilibrium solution, deduce the complete governing equations consistent with the departure timing decision, and obtain the explicit expression of the solution through an ingenious numerical analysis technique. We find and confirm that the set of equilibrium departure time-space points (departure set) with early and late commuters is horn-shaped, and the tip of the horn is situated in the central business district (CBD). This is significantly distinct from the departure set when discontinuous schedule preference is assumed. Moreover, the commuting density distribution increases first and then decreases from residential boundary to CBD, which is consistent with the data we have observed in the real world. This study provides avenues for gaining insights into the propagation characteristics of traffic flow, constituting a substantial advance in the corridor problem.
{"title":"The corridor problem: More comprehensive results on the no-toll equilibrium","authors":"Chuanyao Li , Mengting Wang , Hai-Jun Huang","doi":"10.1016/j.trb.2025.103187","DOIUrl":"10.1016/j.trb.2025.103187","url":null,"abstract":"<div><div>The basic corridor problem is significant for the study of traffic congestion and travel behavior, paving way to insights into the spatial dynamics of rush-hour traffic flow pattern. In light of the fact that previous studies have yielded only preliminary results, this paper considers both early and late commuters to provide more comprehensive results. By introducing the continuous schedule preference (CSP), we determine the form and characteristics of the equilibrium solution, deduce the complete governing equations consistent with the departure timing decision, and obtain the explicit expression of the solution through an ingenious numerical analysis technique. We find and confirm that the set of equilibrium departure time-space points (departure set) with early and late commuters is horn-shaped, and the tip of the horn is situated in the central business district (CBD). This is significantly distinct from the departure set when discontinuous schedule preference is assumed. Moreover, the commuting density distribution increases first and then decreases from residential boundary to CBD, which is consistent with the data we have observed in the real world. This study provides avenues for gaining insights into the propagation characteristics of traffic flow, constituting a substantial advance in the corridor problem.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"194 ","pages":"Article 103187"},"PeriodicalIF":5.8,"publicationDate":"2025-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143508349","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-02-26DOI: 10.1016/j.trb.2025.103173
Chen Mu , Lili Du , Yisheng An , Xiangmo Zhao
This paper addresses traffic merging at highway intersections (labeled as OMM intersections) where mainline traffic with multiple lanes and on-ramp traffic converges, which often represent traffic bottlenecks causing severe traffic congestion and safety issues. To do that, we developed a Compliance-constrained Resilient System Optimal Trajectory Planning (CR-SOTP), which is devised as an event-triggered rolling-horizon system-optimal trajectory planning and replanning coupled scheme combined with a compliance incentive instrument. Specifically, we developed a bi-level optimization model (C-SOTP-BL) with the upper level (SOTP-MINLP) formulated as a mixed integer nonlinear program to generate a system optimal trajectory plan for all CAVs within a trajectory planning area around an OMM intersection, subject to the compliance constraints from the lower level (C-MINLP) optimal incentive model built upon game theory. To adapt to real-time implementation, we developed a parallel computing-aided relax-enforcement-refinement (P-RER) solution method to efficiently solve the C-SOTP-BL. Thanks to the advanced computing performance of the P-RER, the CR-SOTP approach gains resilience through the coupled rolling horizon framework, which recursively plans and replans CAVs’ trajectory by solving the C-SOTP-BL with a descending scale to respond to random disturbances. Numerical experiments employing NGSIM data confirmed the effectiveness of the solution algorithm P-RER in real-time implementation, outperforming existing commercial solvers. The CR-SOTP can generate efficient and resilient trajectory plans to ensure stream-wide safe and smooth traffic merging at an OMM intersection subject to random disturbances. The experiments noticed notable enhancements in social welfare, demonstrating benefits outweigh the associated incentive cost for ensuring CAV compliance. Overall, we claim that the CR-SOTP strategy significantly improves stream-wide traffic safety, efficiency, and sustainability at multi-lane on-ramp intersections.
{"title":"Compliance-constrained resilient system optimal trajectory planning for CAVs at on-ramp intersection with multiple lanes","authors":"Chen Mu , Lili Du , Yisheng An , Xiangmo Zhao","doi":"10.1016/j.trb.2025.103173","DOIUrl":"10.1016/j.trb.2025.103173","url":null,"abstract":"<div><div>This paper addresses traffic merging at highway intersections (labeled as OMM intersections) where mainline traffic with multiple lanes and on-ramp traffic converges, which often represent traffic bottlenecks causing severe traffic congestion and safety issues. To do that, we developed a Compliance-constrained Resilient System Optimal Trajectory Planning (CR-SOTP), which is devised as an event-triggered rolling-horizon system-optimal trajectory planning and replanning coupled scheme combined with a compliance incentive instrument. Specifically, we developed a bi-level optimization model (C-SOTP-BL) with the upper level (SOTP-MINLP) formulated as a mixed integer nonlinear program to generate a system optimal trajectory plan for all CAVs within a trajectory planning area around an OMM intersection, subject to the compliance constraints from the lower level (C-MINLP) optimal incentive model built upon game theory. To adapt to real-time implementation, we developed a parallel computing-aided relax-enforcement-refinement (P-RER) solution method to efficiently solve the C-SOTP-BL. Thanks to the advanced computing performance of the P-RER, the CR-SOTP approach gains resilience through the coupled rolling horizon framework, which recursively plans and replans CAVs’ trajectory by solving the C-SOTP-BL with a descending scale to respond to random disturbances. Numerical experiments employing NGSIM data confirmed the effectiveness of the solution algorithm P-RER in real-time implementation, outperforming existing commercial solvers. The CR-SOTP can generate efficient and resilient trajectory plans to ensure stream-wide safe and smooth traffic merging at an OMM intersection subject to random disturbances. The experiments noticed notable enhancements in social welfare, demonstrating benefits outweigh the associated incentive cost for ensuring CAV compliance. Overall, we claim that the CR-SOTP strategy significantly improves stream-wide traffic safety, efficiency, and sustainability at multi-lane on-ramp intersections.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"194 ","pages":"Article 103173"},"PeriodicalIF":5.8,"publicationDate":"2025-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143488940","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-02-25DOI: 10.1016/j.trb.2025.103184
Xiaoshu Ding, Sisi Jian
Intercity multimodal transportation systems hold great promise for enhancing travel, boosting regional economies, and promoting sustainability. However, realizing their full potential hinges on effective cooperation among transport service providers (TSPs), which current practices often lack. This study proposes a novel framework to address this challenge by leveraging price competition through mobility resource exchange. Our framework considers both independent TSP operations and collaborative resource sharing, incorporating the price elasticity of demand to determine optimal resource exchange and pricing strategies. Through comprehensive analysis of Nash equilibrium outcomes under various capacity conditions, we identify strategies that maximize total profit for participating TSPs. Furthermore, we introduce an ex-post revenue sharing rule to ensure equitable profit allocation among alliance members. Our analytical findings prove that a resource exchange alliance consistently outperforms a no alliance scenario in terms of total profit, particularly in competitive markets with ample resources. Remarkably, the alliance can even achieve the first-best profit level, typically attainable only through perfect coordination. Numerical studies using real-world data further validate the viability of the proposed resource exchange framework. Results demonstrate that a resource exchange alliance not only ensures equitable benefit distribution but also consistently enhances profits across all price elasticity scenarios, highlighting its potential to revolutionize intercity multimodal transportation.
{"title":"Joint resource exchange and pricing for intercity multimodal transport systems","authors":"Xiaoshu Ding, Sisi Jian","doi":"10.1016/j.trb.2025.103184","DOIUrl":"10.1016/j.trb.2025.103184","url":null,"abstract":"<div><div>Intercity multimodal transportation systems hold great promise for enhancing travel, boosting regional economies, and promoting sustainability. However, realizing their full potential hinges on effective cooperation among transport service providers (TSPs), which current practices often lack. This study proposes a novel framework to address this challenge by leveraging price competition through mobility resource exchange. Our framework considers both independent TSP operations and collaborative resource sharing, incorporating the price elasticity of demand to determine optimal resource exchange and pricing strategies. Through comprehensive analysis of Nash equilibrium outcomes under various capacity conditions, we identify strategies that maximize total profit for participating TSPs. Furthermore, we introduce an ex-post revenue sharing rule to ensure equitable profit allocation among alliance members. Our analytical findings prove that a resource exchange alliance consistently outperforms a no alliance scenario in terms of total profit, particularly in competitive markets with ample resources. Remarkably, the alliance can even achieve the first-best profit level, typically attainable only through perfect coordination. Numerical studies using real-world data further validate the viability of the proposed resource exchange framework. Results demonstrate that a resource exchange alliance not only ensures equitable benefit distribution but also consistently enhances profits across all price elasticity scenarios, highlighting its potential to revolutionize intercity multimodal transportation.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"194 ","pages":"Article 103184"},"PeriodicalIF":5.8,"publicationDate":"2025-02-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143480032","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-02-22DOI: 10.1016/j.trb.2025.103175
Lu Zhen , Jingwen Wu , Shuaian Wang , Siyu Li , Miaomiao Wang
This study investigates an automotive maritime transportation planning problem, considering roll-on/roll-off (Ro-Ro) shipping and container shipping. Automobiles are distributed from a manufacturer to overseas dealers through maritime transportation. This transportation process involves three key decisions: the choice of maritime transportation mode for the automobiles, the shipping volume of the ships, and the routes of the ships. We investigate the above decisions and explore how to allocate automobiles to ships and ports to minimize total transportation costs. Considering the differences between Ro-Ro shipping and container shipping, we propose a mixed integer linear programming model to optimize maritime transportation plans for automobile distribution. We design a column generation algorithm to solve the model, in which an acceleration tactic is proposed to shorten the time required to resolve the pricing problem. The effectiveness of our algorithm is validated using experiments with both real and synthetic data based on an ocean shipping case and an offshore case. The computational results show that our algorithm can yield an optimal solution in a significantly shorter time than the CPLEX solver. Furthermore, we draw managerial implications from our sensitivity analyses that can be useful to automobile manufacturers. In addition, three extensions that consider additional real-world factors are discussed to generalize the findings to more generic contexts.
{"title":"Optimizing automotive maritime transportation in Ro-Ro and container shipping","authors":"Lu Zhen , Jingwen Wu , Shuaian Wang , Siyu Li , Miaomiao Wang","doi":"10.1016/j.trb.2025.103175","DOIUrl":"10.1016/j.trb.2025.103175","url":null,"abstract":"<div><div>This study investigates an automotive maritime transportation planning problem, considering roll-on/roll-off (Ro-Ro) shipping and container shipping. Automobiles are distributed from a manufacturer to overseas dealers through maritime transportation. This transportation process involves three key decisions: the choice of maritime transportation mode for the automobiles, the shipping volume of the ships, and the routes of the ships. We investigate the above decisions and explore how to allocate automobiles to ships and ports to minimize total transportation costs. Considering the differences between Ro-Ro shipping and container shipping, we propose a mixed integer linear programming model to optimize maritime transportation plans for automobile distribution. We design a column generation algorithm to solve the model, in which an acceleration tactic is proposed to shorten the time required to resolve the pricing problem. The effectiveness of our algorithm is validated using experiments with both real and synthetic data based on an ocean shipping case and an offshore case. The computational results show that our algorithm can yield an optimal solution in a significantly shorter time than the CPLEX solver. Furthermore, we draw managerial implications from our sensitivity analyses that can be useful to automobile manufacturers. In addition, three extensions that consider additional real-world factors are discussed to generalize the findings to more generic contexts.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"194 ","pages":"Article 103175"},"PeriodicalIF":5.8,"publicationDate":"2025-02-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143465249","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-02-21DOI: 10.1016/j.trb.2025.103174
Kai Qu , Xiangyi Fan , Xiangdong Xu , Grani A. Hanasusanto , Anthony Chen
Improving redundancy is one way of enhancing transportation network resilience by providing travelers with more alternative travel options in case of disastrous events. This paper studies an alternative means of improving network redundancy via retrofitting critical components at the strategical level, which is less constrained by the land use limitation and is less costly compared to building new infrastructures. We define redundancy-oriented network retrofit problem (RNRP) as to seek the retrofit resource allocation scheme that minimizes the loss of network redundancy under uncertain disastrous events. The lack of explicit formulation of network redundancy poses a challenge in the model development. We explore using the linear regression to approximate the loss of network redundancy function. We establish a stochastic programming (RNRP-SP) model and further a distributionally robust optimization (RNRP-DRO) model, corresponding to cases with different available information of potential disruptions. With the approximate loss of redundancy function, we show how to reformulate the two models and develop algorithms to efficiently solve the reformulated approximate models. We conduct numerical experiments in the realistic Winnipeg network of Canada to demonstrate the effectiveness of the retrofit scheme in improving redundancy. The retrofit schemes determined from the developed models are shown to generate better performance in improving redundancy compared with several heuristic approaches. We also show that the solution algorithms can produce high-quality solutions within a shorter time as compared to benchmark methods.
{"title":"Improving transportation network redundancy under uncertain disruptions via retrofitting critical components","authors":"Kai Qu , Xiangyi Fan , Xiangdong Xu , Grani A. Hanasusanto , Anthony Chen","doi":"10.1016/j.trb.2025.103174","DOIUrl":"10.1016/j.trb.2025.103174","url":null,"abstract":"<div><div>Improving redundancy is one way of enhancing transportation network resilience by providing travelers with more alternative travel options in case of disastrous events. This paper studies an alternative means of improving network redundancy via retrofitting critical components at the strategical level, which is less constrained by the land use limitation and is less costly compared to building new infrastructures. We define redundancy-oriented network retrofit problem (RNRP) as to seek the retrofit resource allocation scheme that minimizes the loss of network redundancy under uncertain disastrous events. The lack of explicit formulation of network redundancy poses a challenge in the model development. We explore using the linear regression to approximate the loss of network redundancy function. We establish a stochastic programming (RNRP-SP) model and further a distributionally robust optimization (RNRP-DRO) model, corresponding to cases with different available information of potential disruptions. With the approximate loss of redundancy function, we show how to reformulate the two models and develop algorithms to efficiently solve the reformulated approximate models. We conduct numerical experiments in the realistic Winnipeg network of Canada to demonstrate the effectiveness of the retrofit scheme in improving redundancy. The retrofit schemes determined from the developed models are shown to generate better performance in improving redundancy compared with several heuristic approaches. We also show that the solution algorithms can produce high-quality solutions within a shorter time as compared to benchmark methods.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"194 ","pages":"Article 103174"},"PeriodicalIF":5.8,"publicationDate":"2025-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143453591","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-02-20DOI: 10.1016/j.trb.2025.103176
Qiumin Liu , Vincent A.C. van den Berg , Erik T. Verhoef , Rui Jiang
We analyse time-varying tolling in the stochastic bottleneck model with price-sensitive demand and uncertain capacity. We find that price sensitivity and its interplay with uncertainty have important implications for the effects of tolling on travel costs, welfare and consumers. We evaluate three fully time-variant tolls and a step toll proposed in previous studies. We also consider a uniform toll, which affects overall demand but not trip timing decisions. The first fully time-variant toll is the ‘first-best’ toll, which varies non-linearly over time and results in a departure rate that also varies over time. It raises the generalised price (i.e. the sum of travel cost and toll), thus lowering demand. These outcomes differ fundamentally from those found for first-best pricing in the deterministic bottleneck model. We call the second toll ‘second-best’: it is simpler to design and implement as it maximises welfare under the constraint that the departure rate is constant over time. While a constant rate is optimal without uncertainty, it is not under uncertain capacity. Next, ‘third-best’ tolling adds the further constraint to the second-best that the generalised price should stay the same as without tolling. It attains a lower welfare and higher expected travel cost than the second-best scheme, but a lower generalised price. All our other tolls raise the price compared to the no-toll case.
In our numerical study, when there is less uncertainty: the second-best and third-best tolls achieve welfares closer to that of the first-best toll, and the three schemes become identical without uncertainty. As the degree of uncertainty falls, the uniform and single-step tolls attain higher welfare gains. Also, when demand becomes more price-sensitive, the uniform and single-step tolls attain relatively higher welfare gains. Our step toll would lower the generalised price without uncertainty but raises it in our stochastic setting.
{"title":"Pricing in the stochastic bottleneck model with price-sensitive demand","authors":"Qiumin Liu , Vincent A.C. van den Berg , Erik T. Verhoef , Rui Jiang","doi":"10.1016/j.trb.2025.103176","DOIUrl":"10.1016/j.trb.2025.103176","url":null,"abstract":"<div><div>We analyse time-varying tolling in the stochastic bottleneck model with price-sensitive demand and uncertain capacity. We find that price sensitivity and its interplay with uncertainty have important implications for the effects of tolling on travel costs, welfare and consumers. We evaluate three fully time-variant tolls and a step toll proposed in previous studies. We also consider a uniform toll, which affects overall demand but not trip timing decisions. The first fully time-variant toll is the ‘first-best’ toll, which varies non-linearly over time and results in a departure rate that also varies over time. It raises the generalised price (i.e. the sum of travel cost and toll), thus lowering demand. These outcomes differ fundamentally from those found for first-best pricing in the deterministic bottleneck model. We call the second toll ‘second-best’: it is simpler to design and implement as it maximises welfare under the constraint that the departure rate is constant over time. While a constant rate is optimal without uncertainty, it is not under uncertain capacity. Next, ‘third-best’ tolling adds the further constraint to the second-best that the generalised price should stay the same as without tolling. It attains a lower welfare and higher expected travel cost than the second-best scheme, but a lower generalised price. All our other tolls raise the price compared to the no-toll case.</div><div>In our numerical study, when there is less uncertainty: the second-best and third-best tolls achieve welfares closer to that of the first-best toll, and the three schemes become identical without uncertainty. As the degree of uncertainty falls, the uniform and single-step tolls attain higher welfare gains. Also, when demand becomes more price-sensitive, the uniform and single-step tolls attain relatively higher welfare gains. Our step toll would lower the generalised price without uncertainty but raises it in our stochastic setting.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"194 ","pages":"Article 103176"},"PeriodicalIF":5.8,"publicationDate":"2025-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143453614","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-02-18DOI: 10.1016/j.trb.2025.103172
Huai Jun (Norina) Sun, Okan Arslan
This paper presents a contextual framework for solving the experience-driven traveling salesman problem in last-mile delivery. The objective of the framework is to generate routes similar to historic high-quality ones as classified by operational experts by considering the unstructured and complex features of the last-mile delivery operations. The framework involves learning a transition weight matrix and using it in a TSP solver to generate high quality routes. In order to learn this matrix, we use descriptive analytics to extract and select important features of the high-quality routes from the data. We present a rule-based method using such extracted features. We then introduce a factorization of the transition weight matrix by features, which reduces the dimensions of the information to be learned. In the predictive analytics stage, we develop (1) Score Guided Coordinate Search as a derivative-free optimization algorithm, and (2) label-guided methods inspired by supervised learning algorithms for learning the routing preferences from the data. Any hidden preferences that are not obtained in the descriptive analytics are captured at this stage. Our approach allows us to blend the advantages of different facets of data science in a single collaborative framework, which is effective in generating high-quality solutions for a last-mile delivery problem. We test the efficiency of the methods using a case study based on Amazon Last-Mile Routing Challenge organized in 2021. A preliminary version of our rule-based method received the third place and a $25,000 award in the challenge. In this paper, we improve the learning performance of our previous methods through predictive analytics, while ensuring that the methods are effective, interpretable and flexible. Our best performing algorithm improves the performance of our rule-based method on an out-of-sample testing dataset by more than 23.1%.
{"title":"A contextual framework for learning routing experiences in last-mile delivery","authors":"Huai Jun (Norina) Sun, Okan Arslan","doi":"10.1016/j.trb.2025.103172","DOIUrl":"10.1016/j.trb.2025.103172","url":null,"abstract":"<div><div>This paper presents a contextual framework for solving the experience-driven traveling salesman problem in last-mile delivery. The objective of the framework is to generate routes similar to historic high-quality ones as classified by operational experts by considering the unstructured and complex features of the last-mile delivery operations. The framework involves learning a transition weight matrix and using it in a TSP solver to generate high quality routes. In order to learn this matrix, we use descriptive analytics to extract and select important features of the high-quality routes from the data. We present a <em>rule-based method</em> using such extracted features. We then introduce a factorization of the transition weight matrix by features, which reduces the dimensions of the information to be learned. In the predictive analytics stage, we develop (1) <em>Score Guided Coordinate Search</em> as a derivative-free optimization algorithm, and (2) <em>label-guided methods</em> inspired by supervised learning algorithms for learning the routing preferences from the data. Any hidden preferences that are not obtained in the descriptive analytics are captured at this stage. Our approach allows us to blend the advantages of different facets of data science in a single collaborative framework, which is effective in generating high-quality solutions for a last-mile delivery problem. We test the efficiency of the methods using a case study based on Amazon Last-Mile Routing Challenge organized in 2021. A preliminary version of our rule-based method received the third place and a $25,000 award in the challenge. In this paper, we improve the learning performance of our previous methods through predictive analytics, while ensuring that the methods are effective, interpretable and flexible. Our best performing algorithm improves the performance of our rule-based method on an out-of-sample testing dataset by more than 23.1%.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"194 ","pages":"Article 103172"},"PeriodicalIF":5.8,"publicationDate":"2025-02-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143429003","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-02-08DOI: 10.1016/j.trb.2025.103162
Hannan Tureci-Isik , Murat Köksalan , Diclehan Tezcaner-Öztürk
We develop interactive optimization algorithms for biobjective problems with continuous nondominated frontiers to search for the most preferred solution of a decision maker who is assumed to have an underlying linear or quasiconvex preference function. We progressively acquire preference information from the decision maker through pairwise comparisons of efficient solutions. We keep reducing the search space based on the obtained preference information and the properties of the form of the preference function. Our algorithms provide a performance guarantee on the final solution's distance from the most preferred solution in the objective function space. We demonstrate the algorithms on complex Unmanned Air Vehicle routing problems in continuous space with nonconvex and continuous nondominated frontiers. We consider the objectives of minimizing the total distance traveled and minimizing the total radar detection threat. We simulate the preference function of the decision maker using several underlying preference functions. The interactive algorithms for all preference functions converge to solutions within the desired accuracies after a few pairwise comparisons.
{"title":"Interactive biobjective optimization algorithms and an application to UAV routing in continuous space","authors":"Hannan Tureci-Isik , Murat Köksalan , Diclehan Tezcaner-Öztürk","doi":"10.1016/j.trb.2025.103162","DOIUrl":"10.1016/j.trb.2025.103162","url":null,"abstract":"<div><div>We develop interactive optimization algorithms for biobjective problems with continuous nondominated frontiers to search for the most preferred solution of a decision maker who is assumed to have an underlying linear or quasiconvex preference function. We progressively acquire preference information from the decision maker through pairwise comparisons of efficient solutions. We keep reducing the search space based on the obtained preference information and the properties of the form of the preference function. Our algorithms provide a performance guarantee on the final solution's distance from the most preferred solution in the objective function space. We demonstrate the algorithms on complex Unmanned Air Vehicle routing problems in continuous space with nonconvex and continuous nondominated frontiers. We consider the objectives of minimizing the total distance traveled and minimizing the total radar detection threat. We simulate the preference function of the decision maker using several underlying preference functions. The interactive algorithms for all preference functions converge to solutions within the desired accuracies after a few pairwise comparisons.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"193 ","pages":"Article 103162"},"PeriodicalIF":5.8,"publicationDate":"2025-02-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143350867","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-02-06DOI: 10.1016/j.trb.2025.103161
Shaocheng JIA , S.C. WONG , Wai WONG
Optimizing traffic signal control is crucial for improving efficiency in congested urban environments. Current adaptive signal control systems predominantly rely on on-road detectors, which entail significant capital and maintenance costs, thereby hindering widespread implementation. In this paper, a novel connected vehicle (CV)-based adaptive signal control (CVASC) framework is proposed that optimizes signal plans on a cycle-by-cycle basis without the need for on-road detectors, leveraging partial CV data. The framework comprises a consequential system delay (CSD) model, deterministic penetration rate control (DPRC), and stochastic penetration rate control (SPRC). The CSD model analytically estimates vehicle arrival rates and, consequently, the total junction delay, utilizing CV penetration rates as essential inputs. Employing the CSD model without considering CV penetration rate uncertainty results in fixed vehicle arrival rates and leads to DPRC. On the other hand, incorporating CV penetration rate uncertainty accounts for uncertain vehicle arrival rates, establishing SPRC, which poses a high-dimensional, non-convex, and stochastic optimization problem. An analytical stochastic delay model using generalized polynomial chaos expansion is proposed to efficiently and accurately estimate the mean, variance, and their gradients for the CSD model within SPRC. To solve DPRC and SPRC, a gradient-guided golden section search algorithm is introduced. Comprehensive numerical experiments and VISSIM simulations demonstrate the effectiveness of the CVASC framework, emphasizing the importance of accounting for CV penetration rate uncertainty and uncertain vehicle arrival rates in achieving optimal solutions for adaptive signal optimizations.
{"title":"Adaptive signal control at partially connected intersections: A stochastic optimization model for uncertain vehicle arrival rates","authors":"Shaocheng JIA , S.C. WONG , Wai WONG","doi":"10.1016/j.trb.2025.103161","DOIUrl":"10.1016/j.trb.2025.103161","url":null,"abstract":"<div><div>Optimizing traffic signal control is crucial for improving efficiency in congested urban environments. Current adaptive signal control systems predominantly rely on on-road detectors, which entail significant capital and maintenance costs, thereby hindering widespread implementation. In this paper, a novel connected vehicle (CV)-based adaptive signal control (CVASC) framework is proposed that optimizes signal plans on a cycle-by-cycle basis without the need for on-road detectors, leveraging partial CV data. The framework comprises a consequential system delay (CSD) model, deterministic penetration rate control (DPRC), and stochastic penetration rate control (SPRC). The CSD model analytically estimates vehicle arrival rates and, consequently, the total junction delay, utilizing CV penetration rates as essential inputs. Employing the CSD model without considering CV penetration rate uncertainty results in fixed vehicle arrival rates and leads to DPRC. On the other hand, incorporating CV penetration rate uncertainty accounts for uncertain vehicle arrival rates, establishing SPRC, which poses a high-dimensional, non-convex, and stochastic optimization problem. An analytical stochastic delay model using generalized polynomial chaos expansion is proposed to efficiently and accurately estimate the mean, variance, and their gradients for the CSD model within SPRC. To solve DPRC and SPRC, a gradient-guided golden section search algorithm is introduced. Comprehensive numerical experiments and VISSIM simulations demonstrate the effectiveness of the CVASC framework, emphasizing the importance of accounting for CV penetration rate uncertainty and uncertain vehicle arrival rates in achieving optimal solutions for adaptive signal optimizations.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"193 ","pages":"Article 103161"},"PeriodicalIF":5.8,"publicationDate":"2025-02-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143325364","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
扫码关注我们
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号