A joint optimization model for liner container cargo assignment problem using state-augmented shipping network framework

This paper proposes a state-augmented shipping (SAS) network framework to integrate various activities in liner container shipping chain, including container loading/unloading, transshipment, dwelling at visited ports, in-transit waiting and in-sea transport process. Based on the SAS network framework, we develop a chance-constrained optimization model for a joint cargo assignment problem. The model attempts to maximize the carrier’s profit by simultaneously determining optimal ship fleet capacity setting, ship route schedules and cargo allocation scheme. With a few disparities from previous studies, we take into account two differentiated container demands: deterministic contracted basis demand received from large manufacturers and uncertain spot demand collected from the spot market. The economies of scale of ship size are incorporated to examine the scaling effect of ship capacity setting in the cargo assignment problem. Meanwhile, the schedule coordination strategy is introduced to measure the in-transit waiting time and resultant storage cost. Through two numerical studies, it is demonstrated that the proposed chance-constrained joint optimization model can characterize the impact of carrier’s risk preference on decisions of the container cargo assignment. Moreover, considering the scaling effect of large ships can alleviate the concern of cargo overload rejection and consequently help carriers make more promising ship deployment schemes.     

A stochastic optimization approach for the selection of reflective cracking mitigation techniques

PurposeIn Hot Mix Asphalt (HMA) overlays, the existing cracks in the underlying pavements can propagate upward to the new added overlay and may cause Reflective Cracks (RC). These cracks allow water infiltration to the underlying layers and causes further moisture damage as well as weakening the unbound layers. Over the years, several methods have been developed for mitigating the RCs. This study aims to investigate the current reflective cracking mitigation methods and develop a methodology for the selection of appropriate mitigation technique. The developed model is then applied to a case study in the state of Florida.MethodTo accomplish this goal, a nationwide literature review was conducted to better understand the current in practice methods in the United States. Moreover, a life cycle cost analysis (LCCA) in five different road types was performed to find the annuity of roadway rehabilitation for each of the mitigation methods. The uncertainty in the LCCA results is represented using Exploratory Modeling and Analysis (EMA) method. Then through a Multi Criteria Decision Making (MCDM) model, a stochastic optimization model was developed to find the appropriate reflective cracking mitigation solution under Florida’s climate and road conditions, based on different cost and performance weights.ResultsBased on the available data for the state of Florida, the LCCA results indicate that the annuity of maintaining the roadway with Fabrics and ISAC are lower compared to other methods. However, the results of stochastic optimization model reveal that while looking at the performance and cost at the same time, different methods would be more feasible. For instance, while the cost of the used method does not matter at all and only performance matters, STRATA® is more probable to be the appropriate mitigation technique. The findings of this research are critical for decision makers to better understand the most cost-effective mitigation technique in different conditions.     

A framework for neighbour links travel time estimation in an urban network

This paper proposes a solution to the problem of limited network sensor coverage caused by insufficient sample size of probe vehicles or inadequate numbers of fixed sensors. A framework is proposed to estimate link travel times using available data from neighbouring links. Two clues are used for real-time travel time estimation: link historical travel time data and online travel time data from neighbour links. In the absence of online travel time data from neighbour links, historical records only have to be relied upon. However, where the two types of data are available, a data fusion scheme can be applied to make use of the two clues. The proposed framework is validated using real-life data from the City of Vancouver, British Columbia. The estimation accuracy is found to be comparable to the existing literature. Overall, the results demonstrate the feasibility of using neighbour links data as an additional source of information that might not have been extensively explored before.     

Equity-based timetable synchronization optimization in urban subway network

In the urban subway transportation system, passengers may have to make at least one transfer traveling from their origin to destination. This paper proposes a timetable synchronization optimization model to optimize passengers’ waiting time while limiting the waiting time equitably over all transfer station in an urban subway network. The model aims to improve the worst transfer by adjusting the departure time, running time, the dwelling time and the headways for all directions in the subway network. In order to facilitate solution, we develop a binary variables substitute method to deal with the binary variables. Genetic algorithm is applied to solve the problem for its practicality and generality. Finally, the suggested model is applied to Beijing urban subway network and several performance indicators are presented to verify the efficiency of suggested model. Results indicate that proposed timetable synchronization optimization model can be used to improve the network performance for transfer passengers significantly.     

Dynamic modeling and control of taxi services in large-scale urban networks: A macroscopic approach

Taxis are increasingly becoming a prominent mobility mode in many major cities due to their accessibility and convenience. The growing number of taxi trips and the increasing contribution of taxis to traffic congestion are cause for concern when vacant taxis are not distributed optimally within the city and are unable to find unserved passengers effectively. A way of improving taxi operations is to deploy a taxi dispatch system that matches the vacant taxis and waiting passengers while considering the search friction dynamics. This paper presents a network-scale taxi dispatch model that takes into account the interrelated impact of normal traffic flows and taxi dynamics while optimizing for an effective dispatching system. The proposed model builds on the concept of the macroscopic fundamental diagram (MFD) to represent the dynamic evolution of traffic conditions. The model considers multiple taxi service firms operating in a heterogeneously congested city, where the city is assumed to be partitioned into multiple regions each represented with a well-defined MFD. A model predictive control approach is devised to control the taxi dispatch system. The results show that lack of the taxi dispatching system leads to severe accumulation of unserved taxi passengers and vacant taxis in different regions whereas the dispatch system improves the taxi service performance and reduces traffic congestion by regulating the network towards the undersaturated condition. The proposed framework demonstrates sound potential management schemes for emerging mobility solutions such as fleet of automated vehicles and demand-responsive transit services.     

Properties of a well-defined macroscopic fundamental diagram for urban traffic

A field experiment in Yokohama (Japan) revealed that a macroscopic fundamental diagram (MFD) linking space-mean flow, density and speed exists on a large urban area. It was observed that when the highly scattered plots of flow vs. density from individual fixed detectors were aggregated the scatter nearly disappeared and points grouped along a well defined curve. Despite these and other recent findings for the existence of well-defined MFDs for urban areas, these MFDs should not be universally expected. In this paper we investigate what are the properties that a network should satisfy, so that an MFD with low scatter exists. We show that the spatial distribution of vehicle density in the network is one of the key components that affect the scatter of an MFD and its shape. We also propose an analytical derivation of the spatial distribution of congestion that considers correlation between adjacent links. We investigate the scatter of an MFD in terms of errors in the probability density function of spatial link occupancy and errors of individual links’ fundamental diagram (FD). Later, using real data from detectors for an urban arterial and a freeway network we validate the proposed derivations and we show that an MFD is not well defined in freeway networks as hysteresis effects are present. The datasets in this paper consist of flow and occupancy measures from 500 fixed sensors in the Yokohama downtown area in Japan and 600 loop detectors in the Twin Cities Metropolitan Area Freeway network in Minnesota, USA.     

Economic conditions for minibus usage in a multimodal feeder network

The introduction of minibuses into the transit fleets of some cities makes it more important than ever to investigate the economic and operating conditions of these vehicles for various transit and paratransit services. A high performance transit system is of great interest, owing to its desirable characteristics. However, it is not feasible to establish and use such a system all over a city. It is therefore necessary to support a high performance transit system with other modes to extend its area of operation (owing to higher demand) and also to connect those areas that are not covered by the high performance system to it. This paper considers the use of minibuses in the design of metro line feeders and to characterize the economic domain in which it is efficient to use them in a feeder network. Based on results from ant colony optimization, the performance measures of minibuses are compared with those of conventional buses to help make decision makers aware of the use and role of these vehicles. The study contradicts the common belief that, since minibuses require similar driver costs to those of conventional buses, it is not economical to use them in a transit fleet; in fact, it is shown that minibuses can displace conventional buses in some situations in a feeder network.     

Spillback congestion in dynamic traffic assignment: A macroscopic flow model with time-varying bottlenecks

In this paper, we propose a new model for the within-day Dynamic Traffic Assignment (DTA) on road networks where the simulation of queue spillovers is explicitly addressed, and a user equilibrium is expressed as a fixed-point problem in terms of arc flow temporal profiles, i.e., in the infinite dimension space of time’s functions. The model integrates spillback congestion into an existing formulation of the DTA based on continuous-time variables and implicit path enumeration, which is capable of explicitly representing the formation and dispersion of vehicle queues on road links, but allows them to exceed the arc length. The propagation of congestion among adjacent arcs will be achieved through the introduction of time-varying exit and entry capacities that limit the inflow on downstream arcs in such a way that their storage capacities are never exceeded. Determining the temporal profile of these capacity constraints requires solving a system of spatially non-separable macroscopic flow models on the supply side of the DTA based on the theory of kinematic waves, which describe the dynamic of the spillback phenomenon and yield consistent network performances for given arc flows. We also devise a numerical solution algorithm of the proposed continuous-time formulation allowing for “long time intervals” of several minutes, and give an empirical evidence of its convergence. Finally, we carry out a thorough experimentation in order to estimate the relevance of spillback modeling in the context of the DTA, compare the proposed model in terms of effectiveness with the Cell Transmission Model, and assess the efficiency of the proposed algorithm and its applicability to real instances with large networks.     

Equity-oriented skip-stopping schedule optimization in an oversaturated urban rail transit network

In this study, we focus on improving system-wide equity performance in an oversaturated urban rail transit network based on multi-commodity flow formulation. From the system perspective, an urban rail transit network is a distributed system, where a set of resources (i.e., train capacity) is shared by a number of users (i.e., passengers), and equitable individuals and groups should receive equal shares of resources. However, when oversaturation occurs in an urban rail transit network during peak hours, passengers waiting at different stations may receive varying shares of train capacity leading to the inequity problem under train all-stopping pattern. Train skip-stopping pattern is an effective operational approach, which holds back some passengers at stations and re-routes their journeys in the time dimension based on the available capacity of each train. In this study, the inequity problem in an oversaturated urban rail transit network is analyzed using a multi-commodity flow modeling framework. In detail, first, discretized states, corresponding to the number of missed trains for passengers, are constructed in a space-time-state three-dimensional network, so that the system-wide equity performance can be viewed as a distribution of all passengers in different states. Different from existing flow-based optimization models, we formulate individual passenger and train stopping pattern as commodity and network structure in the multi-commodity flow-modeling framework, respectively. Then, we aim to find an optimal commodity flow and well-designed network structure through the proposed multi-commodity flow model and simultaneously achieve the equitable distribution of all passengers and the optimal train skip-stopping pattern. To quickly solve the proposed model and find an optimal train skip-stopping pattern with preferable system-wide equity performance, the proposed linear programming model can be effectively decomposed to a least-cost sub-problem with positive arc costs for each individual passenger and a least-cost sub-problem with negative arc costs for each individual train under a Lagrangian relaxation framework. For application and implementation, the proposed train skip-stopping optimization model is applied to a simple case and a real-world case based on Batong Line in the Beijing Subway Network. The simple case demonstrates that our proposed Lagrangian relaxation framework can obtain the approximate optimal solution with a small-gap lower bound and a lot of computing time saved compared with CPLEX solver. The real-world case based on Batong Line in the Beijing Subway Network compares the equity and efficiency indices under the operational approach of train skip-stopping pattern with those under the train all-stopping pattern to state the advantage of the train skip-stopping operational approach.     

Rationing and pricing strategies for congestion mitigation: Behavioral theory,econometric model,and application in Beijing

Some travel demand management policies such as road pricing have been widely studied in literature. Rationing policies, including vehicle ownership quota and vehicle usage restrictions, have been implemented in several megaregions to address congestion and other negative transportation externalities, but not well explored in literature. Other strategies such as Vehicle Mileage Fee have not been well accepted by policy makers, but attract growing research interest. As policy makers face an increasing number of policy tools, a theoretical framework is needed to analyze these policies and provide a direct comparison of their welfare implications such as efficiency and equity. However, such a comprehensive framework does not exist in literature. To bridge this gap, this study develops an analytical framework for analyzing and comparing travel demand management policies, which consists of a mathematical model of joint household vehicle ownership and usage decisions and welfare analysis methods based on compensating variation and consumer surplus. Under the assumptions of homogenous users and single time period, this study finds that vehicle usage rationing performs better when relatively small percentages of users (i.e. low rationing ratio) are rationed off the roads and when induced demand elasticity resulting from congestion mitigation is low. When the amount of induced demand exceeds a certain level, it is shown analytically that vehicle usage restrictions will always cause welfare losses. When the policy goal is to reduce vehicle travel by a fixed portion, road pricing provides a larger welfare gain. The performance of different policies is influenced by network congestion and congestibility. This paper further generalizes the model to consider heterogenous users and demonstrates how it can be applied for policy analysis on a real network after careful calibration.     

A framework for evaluating the dynamic impacts of a congestion pricing policy for a transportation socioeconomic system

This paper provides a modeling framework based on the system dynamics approach by which policy makers can understand the dynamic and complex nature of traffic congestion within a transportation socioeconomic system representation of a metropolitan area. This framework offers policy makers an assessment platform that focuses on the short- and long-term system behaviors arising from an area-wide congestion pricing policy along with other congestion mitigation policies. Since only a few cities in the world have implemented congestion pricing and several are about to do so, a framework that helps policy makers to understand the impacts of congestion pricing is currently quite relevant. Within this framework, improved bus and metro capacities contribute to the supply dynamics which in turn affect the travel demand of individuals and their choice of different transportation modes. Work travel and social networking activities are assumed to generate additional travel demand dynamics that are affected by travelers’ perception of the level of service of the different transportation modes, their perception of the congestion level, and the associated traveling costs. It is assumed that the, population, tourism and employment growth are exogenous factors that affect demand. Furthermore, this paper builds on a previously formulated approach where fuzzy logic concepts are used to represent linguistic variables assumed to describe consumer perceptions about transportation conditions.     

Global optimization method for mixed transportation network design problem: A mixed-integer linear programming approach

This paper proposes a global optimization algorithm for solving a mixed (continuous/discrete) transportation network design problem (MNDP), which is generally expressed as a mathematical programming with equilibrium constraint (MPEC). The upper level of the MNDP aims to optimize the network performance via both expansion of existing links and addition of new candidate links, whereas the lower level is a traditional Wardrop user equilibrium (UE) problem. In this paper, we first formulate the UE condition as a variational inequality (VI) problem, which is defined from a finite number of extreme points of a link-flow feasible region. The MNDP is approximated as a piecewise-linear programming (P-LP) problem, which is then transformed into a mixed-integer linear programming (MILP) problem. A global optimization algorithm based on a cutting constraint method is developed for solving the MILP problem. Numerical examples are given to demonstrate the efficiency of the proposed method and to compare the results with alternative algorithms reported in the literature.     

Robust optimization for emergency logistics planning: Risk mitigation in humanitarian relief supply chains

This paper proposes a methodology to generate a robust logistics plan that can mitigate demand uncertainty in humanitarian relief supply chains. More specifically, we apply robust optimization (RO) for dynamically assigning emergency response and evacuation traffic flow problems with time dependent demand uncertainty. This paper studies a Cell Transmission Model (CTM) based system optimum dynamic traffic assignment model. We adopt a min–max criterion and apply an extension of the RO method adjusted to dynamic optimization problems, an affinely adjustable robust counterpart (AARC) approach. Simulation experiments show that the AARC solution provides excellent results when compared to deterministic solution and sampling based stochastic programming solution. General insights of RO and transportation that may have wider applicability in humanitarian relief supply chains are provided.     

Impact analysis of cordon-based congestion pricing on mode-split for a bimodal transportation network

This paper investigates the impact of cordon-based congestion pricing scheme on the mode-split of a bimodal transportation network with auto and rail travel modes. For any given toll-charge pattern, its impact on the mode-split can be estimated by solving a combined mode-split and traffic-assignment problem. Using a binary logit model for the mode-split, the combined problem is converted into a traffic-assignment problem with elastic demand. Probit-based stochastic user equilibrium (SUE) principle is adopted for this traffic-assignment problem, and a continuously distributed value of time (VOT) is assumed to convert the toll charges and transit fares into time-units. This combined mode-split and traffic-assignment problem is then formulated as a fixed-point model, which can be solved by a convergent Cost Averaging method. The combined mode-split and traffic-assignment problem is then used to analyze a multimodal toll design problem for cordon-based congestion pricing scheme, with the aim of increasing the mode-share of public transport system to a targeted level. Taking the fixed-point model as a constraint, the multimodal toll design problem is thus formulated as a mathematical programming with equilibrium constraints (MPEC) model. A genetic algorithm (GA) is employed to solve this MPEC model, which is then numerical validated by a network example.     

Estimation of origin‐destination matrices for a multimodal public transit network

This paper presents a procedure for the estimation of origin‐destination (O‐D) matrices for a multimodal public transit network. The system consists of a number of favored public transit modes that are obtained from a modal split process in a traditional four‐step transportation model. The demand of each favored mode is assigned to the multimodal network, which is comprised of a set of connected links of different public transit modes. An entropy maximization procedure is proposed to simultaneously estimate the O‐D demand matrices of all favored modes, which are consistent with target data sets such as the boarding counts and line segment flows that are observed directly in the network. A case study of the Hong Kong multimodal transit network is used to demonstrate the effectiveness of the proposed methodology.     

Understanding public response to a congestion charge: A random-effects ordered logit approach

Public acceptance is consistently listed as having an enormous impact on the implementation and success of a congestion charge scheme. This paper investigates public acceptance of such a scheme in Australia. Surveys were conducted in Brisbane and Melbourne, the two fastest growing Australian cities. Using an ordered logit modeling approach, the survey data including stated preferences were analyzed to pinpoint the important factors influencing people’s attitudes to a congestion charge and, in turn, to their transport mode choices. To accommodate the nature of, and to account for the resulting heterogeneity of the panel data, random effects were considered in the models. As expected, this study found that the amount of the congestion charge and the financial benefits of implementing it have a significant influence on respondents’ support for the charge and on the likelihood of their taking a bus to city areas. However, respondents’ current primary transport mode for travelling to the city areas has a more pronounced impact. Meanwhile, respondents’ perceptions of the congestion charge’s role in protecting the environment by reducing vehicle emissions, and of the extent to which the charge would mean that they travelled less frequently to the city for shopping or entertainment, also have a significant impact on their level of support for its implementation. We also found and explained notable differences across two cities. Finally, findings from this study have been fully discussed in relation to the literature.     

Modelling and simulation of transportation system effectiveness to reduce traffic congestion: a system dynamics framework

ABSTRACT

This paper is designed to evaluate and improve the effectiveness of transportation systems and reduce traffic congestion through the use of simulation models and scenario development. A system dynamics framework is used to test and evaluate the alternatives of future strategies for the city of Surabaya, Indonesia. Some factors affecting the effectiveness of transport systems include operational effectiveness and service effectiveness, as well as uncertainty. To improve the effectiveness of transportation systems, several strategies can be implemented, such as subsidizing public transportation, increasing the cost of private vehicle parking fees, raising taxes on private vehicles, and reducing delays in public transportation through scenario development. Scenario results show that, by pursuing these strategies, effectiveness could be improved by 80% as the impact of the increase in operational and service effectiveness, helping to mitigate traffic congestion. Congestion could be reduced to 70% (on average) due to the decrease in daily traffic.     

A quantum evolutionary algorithm for the second-best congestion pricing problem in urban traffic networks

This paper investigates the congestion pricing problem in urban traffic networks. A first-best strategy, a second-best strategy for toll leveling in closed cordons and a second-best strategy for determining both toll levels and toll points are considered. The problem is known to be a mixed integer programming model and formulated as a bi-level optimization problem, with an objective of maximizing the social welfare. A method is presented to solve the problem, based on a novel metaheuristic algorithm, namely quantum evolutionary algorithm (QEA). To verify the proposed method, the widely used genetic algorithm (GA) is also applied to solve the problem. The problem is solved for a medium-size urban traffic network and the results of the QEA are compared against the conventional GA. Computational results show that the QEA outperforms the GA in solution quality.     

Measuring the satisfaction of multimodal travelers for local transit services in different urban contexts

The importance of measuring customer satisfaction for a public transport service is apparent, even beyond more immediate marketing purposes. The present paper shows how satisfaction measures can be exploited to gain insights on the relationship between personal attitudes, transit use and urban context. We consider nine satisfaction measures of urban transit services, as expressed by a representative sample of Italian multimodal travelers (i.e. users of both private cars and public transport). We use correlations and correspondence analyses to show if and how each attribute is related to the levels of use of public transport, and how the relationship is affected by the urban context. Then we apply a recently developed method to combine ordinal variables into one score, by adapting it to work with large samples and with satisfaction measures which have a neutral point in the scale (i.e. “neither satisfied nor dissatisfied”). The resulting overall satisfaction levels and frequency of use were not correlated in our sample. We also found the highest satisfaction levels in smaller towns and the lowest ones in metropolitan cities. Since we focus on multimodal travelers, an interpretation paradigm is proposed according to which transit services must be well evaluated by car drivers in smaller towns in order to be considered a real alternative to cars. On the other hand, transit is more competitive on factual elements in larger cities, so that it can still be used by drivers, even if it is not very well evaluated.     

On a mean field game approach modeling congestion and aversion in pedestrian crowds

In this paper we present a new class of pedestrian crowd models based on the mean field games theory introduced by Lasry and Lions in 2006. This macroscopic approach is based on a microscopic model, that considers smart pedestrians who rationally interact and anticipate the future. This leads to a forward-backward structure in time. We focus on two-population interactions and validate the modeling with simple examples. Two complementary classes of problems are addressed, namely the case of crowd aversion and the one of congestion. In both cases we describe the model and present numerical solvers (based on the optimization formulation and the partial differential equations respectively). Finally we present numerical tests involving anticipation phenomena and complex group behaviors such as lane formation.