| 1. |
- Abenoza, Roberto, et al.
(författare)
-
Investigating the nature of Public Transport service attributes
- 2018
-
Ingår i: Transportation Science. - 0041-1655 .- 1526-5447.
-
Tidskriftsartikel (refereegranskat)abstract
- Classifying public transport service attributes based on their influence on overall traveler satisfaction can assist stakeholders and practitioners in introducing cost-efficient measures. To date most studies employed methods that were based on the assumption that the impact of service attributes on traveler satisfaction is entirely linear and symmetric. This study examines whether service attributes have a non-linear and asymmetric influence on the overall travel experience by employing the Three-factor theory (basic, performance and exciting factors). The analysis is conducted for different traveler segments depending on their level of captivity, travel frequency by public transport and travel mode used, and is based on a relatively large sample size collected for Stockholm County. Moreover, the estimated models control for important socio-demographic and travel characteristics that have been insofar overlooked. Results are presented in the form of a series of multi-level cubes that represent different essentiality of traveler needs which provide a useful methodological framework to further design quality service improvements that can be applied to various geographical contexts. Our findings highlight that a “one size fits all” approach is not adequate for identifying the needs of distinct traveler segments and of travelers using different travel modes. Furthermore, two-thirds of the attributes are consistently classified into the same factor category which entails important policy implications. This research deepens and expands the very limited knowledge of the application of the three-factor theory in the transport field.
|
|
| 2. |
- Berling, Peter, 1973-, et al.
(författare)
-
Dynamic Speed Optimization in Supply Chains with Stochastic Demand
- 2016
-
Ingår i: Transportation Science. - : Institute for Operations Research and the Management Sciences (INFORMS). - 0041-1655 .- 1526-5447. ; 50:3, s. 1114-1127
-
Tidskriftsartikel (refereegranskat)abstract
- In this paper, we analyze how to continuously adjust the speed in a supply chain with stochastic demand. For each unit (e.g., truckload, shipping container) in the chain, one must decide at which speed it should be moved downstream, given the state of the system, to minimize total supply chain costs. We decompose the problem into a set of one-dimensional subproblems that can be easily solved and characterize the optimal variable speed policy: under some assumptions, we show that it is optimal to set a speed that is first increasing in the distance to the market, and then decreasing. As a result, at optimality a given unit will experience an accelerating speed and then it will be slowed down, unless a demand occurs, in which case, the speed will be adjusted upward. We finally provide a transportation case study where we estimate the benefits of a variable-speed compared to a fixed-speed policy and show them to be significant both financially and from a CO2-emissions perspective.
|
|
| 3. |
- Bohlin, Markus, et al.
(författare)
-
Optimization Methods for Multistage Freight Train Formation
- 2015. - 6
-
Ingår i: Transportation Science. - : Institute for Operations Research and the Management Sciences. - 0041-1655 .- 1526-5447. ; 50:3, s. 823-840
-
Tidskriftsartikel (refereegranskat)abstract
- This paper considers mathematical optimization for the multistage train formation problem, which at the core is the allocation of classification yard formation tracks to outbound freight trains, subject to realistic constraints on train scheduling, arrival and departure timeliness, and track capacity. The problem formulation allows the temporary storage of freight cars on a dedicated mixed-usage track. This real-world practice increases the capacity of the yard, measured in the number of simultaneous trains that can be successfully handled. Two optimization models are proposed and evaluated for the multistage train formation problem. The first one is a column-based integer programming model, which is solved using branch and price. The second model is a simplified reformulation of the first model as an arc-indexed integer linear program, which has the same linear programming relaxation as the first model. Both models are adapted for rolling horizon planning and evaluated on a five-month historical data set from the largest freight yard in Scandinavia. From this data set, 784 instances of different types and lengths, spanning from two to five days, were created. In contrast to earlier approaches, all instances could be solved to optimality using the two models. In the experiments, the arc-indexed model proved optimality on average twice as fast as the column-based model for the independent instances, and three times faster for the rolling horizon instances. For the arc-indexed model, the average solution time for a reasonably sized planning horizon of three days was 16 seconds. Regardless of size, no instance took longer than eight minutes to be solved. The results indicate that optimization approaches are suitable alternatives for scheduling and track allocation at classification yards.
|
|
| 4. |
- Brännlund, Ulf, et al.
(författare)
-
Railway Timetabling Using Lagrangian Relaxation
- 1998
-
Ingår i: Transportation Science. - : Institute for Operations Research and the Management Sciences (INFORMS). - 0041-1655 .- 1526-5447. ; 32:4, s. 358-369
-
Tidskriftsartikel (refereegranskat)abstract
- We present a novel optimization approach for the timetabling problem of a railway company, i.e., scheduling of a set of trains to obtain a profit maximizing timetable, while not violating track capacity constraints. The scheduling decisions are based on estimates of the value of running different types of service at specified times. We model the problem as a very large integer programming problem. The model is flexible in that if allows for general cost functions. We have used a Lagrangian relaxation solution approach, in which the track capacity constraints are relaxed and assigned prices, so that the problem separates into one dynamic program for each physical train. The number of dual variables is very large. However, it turns out that only a small fraction of these are nonzero, wh ich one may take advantage of in the dual updating schemes. The approach has been, tested on a realistic example suggested by the Swedish National Railway Administration. This example contains 18 passenger trains and 8 freight trains to be scheduled during a day on a stretch of single track, consisting of 17 stations. The computation times are rather modest and the obtained timetables are within a few percent of optimality.
|
|
| 5. |
- Chen, Zhiwei, et al.
(författare)
-
A Continuous Model for Designing Corridor Systems with Modular Autonomous Vehicles Enabling Station-wise Docking
- 2022
-
Ingår i: Transportation Science. - : Institute for Operations Research and the Management Sciences (INFORMS). - 0041-1655 .- 1526-5447. ; 56:1, s. 1-30
-
Tidskriftsartikel (refereegranskat)abstract
- The "asymmetry" between spatiotemporally varying passenger demand and fixed-capacity transportation supply has been a long-standing problem in urban mass transportation (UMT) systems around the world. The emerging modular autonomous vehicle (MAV) technology offers us an opportunity to close the substantial gap between passenger demand and vehicle capacity through station-wise docking and undocking operations. However, there still lacks an appropriate approach that can solve the operational design problem for UMT corridor systems with MAVs efficiently. To bridge this methodological gap, this paper proposes a continuum approximation (CA) model that can offer near-optimal solutions to the operational design for MAV-based transit corridors very efficiently. We investigate the theoretical properties of the optimal solutions to the investigated problem in a certain (yet not uncommon) case. These theoretical properties allow us to estimate the seat demand of each time neighborhood with the arrival demand curves, which recover the "local impact" property of the investigated problem. With the property, a CA model is properly formulated to decompose the original problem into a finite number of subproblems that can be analytically solved. A discretization heuristic is then proposed to convert the analytical solution from the CA model to feasible solutions to the original problem. With two sets of numerical experiments, we show that the proposed CA model can achieve near-optimal solutions (with gaps less than 4% for most cases) to the investigated problem in almost no time (less than 10 ms) for large-scale instances with a wide range of parameter settings (a commercial solver may even not obtain a feasible solution in several hours). The theoretical properties are verified, and managerial insights regarding how input parameters affect system performance are provided through these numerical results. Additionally, results also reveal that, although the CA model does not incorporate vehicle repositioning decisions, the timetabling decisions obtained by solving the CA model can be easily applied to obtain near-optimal repositioning decisions (with gaps less than 5% in most instances) very efficiently (within 10 ms). Thus, the proposed CA model provides a foundation for developing solution approaches for other problems (e.g., MAV repositioning) with more complex system operation constraints whose exact optimal solution can hardly be found with discrete modeling methods.
|
|
| 6. |
- Engevall, Stefan, et al.
(författare)
-
The heterogeneous vehicle-routing game
- 2004
-
Ingår i: Transportation Science. - : Institute for Operations Research and the Management Sciences (INFORMS). - 0041-1655 .- 1526-5447. ; 38:1, s. 71-85
-
Tidskriftsartikel (refereegranskat)abstract
- In this paper, we study a cost-allocation problem that arises in a distribution-planning situation at the Logistics Department at Norsk Hydro Olje AB, Stockholm, Sweden. We consider the routes from one depot during one day. The total distribution cost for these routes is to be divided among the customers that are visited. This cost-allocation problem is formulated as a vehicle-routing game (VRG), allowing the use of vehicles with different capacities. Cost-allocation methods based on different concepts from cooperative game theory, such as the core and the nucleolus, are discussed. A procedure that can be used to investigate whether the core is empty or not is presented, as well as a procedure to compute the nucleolus. Computational results for the Norsk Hydro case are presented and discussed.
|
|
| 7. |
- Flötteröd, Gunnar, et al.
(författare)
-
Bayesian demand calibration for dynamic traffic simulations
- 2011
-
Ingår i: Transportation Science. - : Institute for Operations Research and the Management Sciences (INFORMS). - 0041-1655 .- 1526-5447. ; 45:4, s. 541-561
-
Tidskriftsartikel (refereegranskat)abstract
- We present an operational framework for the calibration of demand models for dynamic traffic simulations, where calibration refers to the estimation of a structurally predefined model's parameters from real data. Our focus is on disaggregate simulators that represent every traveler individually. We calibrate, also at an individual level, arbitrary choice dimensions within a Bayesian framework, where the analyst's prior knowledge is represented by the dynamic traffic simulator itself and the measurements are comprised of time-dependent traffic counts. The approach is equally applicable to an equilibrium-based planning model and to a telematics model of spontaneous and imperfectly informed drivers. It is based on consistent mathematical arguments, yet it is applicable in a purely simulation-based environment and, as our experimental results show, is capable of handling large scenarios.
|
|
| 8. |
- Hamdan, Sadeque, et al.
(författare)
-
Central Authority-Controlled Air Traffic Flow Management: An Optimization Approach
- 2022
-
Ingår i: Transportation Science. - : INFORMS. - 0041-1655 .- 1526-5447. ; 56:2, s. 299-321
-
Tidskriftsartikel (refereegranskat)abstract
- Despite various planning efforts, airspace capacity can sometimes be exceeded, typically because of disruptive events. Air traffic flow management (ATFM) is the process of managing flights in this situation. In this paper, we present an ATFM model that accounts for different rerouting options (path rerouting and diversion) and preexisting en route flights. The model proposes having a central authority to control all decisions, which is then compared with current practice. We also consider interflight and interairline fairness measures in the network. We use an exact approach to solve small- to medium-sized instances, and we propose a modified fix-and-relax heuristic to solve large-sized instances. Allowing a central authority to control all decisions increases network efficiency compared with the case where the ATFM authority and airlines control decisions independently. Our experiments show that including different rerouting options in ATFM can help reduce delays by up to 8% and cancellations by up to 23%. Moreover, ground delay cost has much more impact on network decisions than air delay cost, and network decisions are insensitive to changes in diversion cost. Furthermore, the analysis of the tradeoff between total network cost and overtaking cost shows that adding costs for overtaking can significantly improve fairness at only a small increase in total system cost. A balanced total cost per flight among airlines can be achieved at a small increase in the network cost (0.2%-3.0%) when imposing airline fairness. In conclusion, the comprehensiveness of the model makes it useful for analyzing a wide range of alternatives for efficient ATFM.
|
|
| 9. |
- Holguin-Veras, Jose, et al.
(författare)
-
A Multiclass Tour Flow Model and Its Role in Multiclass Freight Tour Synthesis
- 2020
-
Ingår i: Transportation Science. - : Institute for Operations Research and the Management Sciences (INFORMS). - 0041-1655 .- 1526-5447. ; 54:3, s. 631-650
-
Tidskriftsartikel (refereegranskat)abstract
- This paper summarizes the research conducted by the authors concerning the development of an analytical freight demand model that explicitly considers freight pickup and delivery flows by industry sector, the multiclass tour flow model (MC-TFM). The mathematical properties of the resultant model are investigated, including the convexity of the optimization model, the interconnection between the MC-TFM and the family of gravity models, and the MC-TFM's elasticities. The MC-TFM is then integrated into a multiclass freight tour synthesis model (MC-FTS) that is capable of inferring freight tour demand on the basis of secondary data such as traffic counts and estimates of freight trip generation by industry sector. The ability of the resulting MC-FTS is tested by means of numerical experiments involving test cases.
|
|
| 10. |
- Holmberg, Kaj
(författare)
-
The (Over)zealous Snow Remover Problem
- 2019
-
Ingår i: Transportation Science. - : INFORMS. - 0041-1655 .- 1526-5447. ; 53:3, s. 867-881
-
Tidskriftsartikel (refereegranskat)abstract
- Planning snow removal is a difficult, infrequently occurring optimization problem, concerning complicated routing of vehicles. Clearing a street includes several different activities, and the tours must be allowed to contain subtours. The streets are classified into different types, each type requiring different activities. We address the problem facing a single vehicle, including details such as precedence requirements and turning penalties. We describe a solution approach based on a reformulation to an asymmetric traveling salesman problem in an extended graph, plus a heuristic for finding feasible solutions and a reordering procedure. The method has been implemented and tested on real life examples, and the solution times are short enough to allow online usage. We compare the solutions to lower bounds obtained by solving a mixed integer programming model. We study two different principles for the number of sweeps on a normal street, encountered in discussions with snow removal contractors. A principle using a first sweep in the middle of the street around the block, in order to quickly allow usage of the streets, is found to yield interesting theoretical and practical difficulties.
|
|
| 11. |
- Högdahl, Johan, 1989-, et al.
(författare)
-
A Combined Simulation-Optimization Approach for Robust Timetabling on Main Railway Lines
- 2023
-
Ingår i: Transportation Science. - : Institute for Operations Research and the Management Sciences (INFORMS). - 0041-1655 .- 1526-5447. ; 57:1, s. 52-81
-
Tidskriftsartikel (refereegranskat)abstract
- Performance aspects such as travel time, punctuality and robustness are conflicting goals of utmost importance for railway transports. To successfully plan railway traffic, it is therefore important to strike a balance between planned travel times and expected delays. In railway operations research, a lot of attention has been given to construct models and methods to generate robust timetables—that is, timetables with the potential to withstand design errors, incorrect data, and minor everyday disturbances. Despite this, the current state-of-practice in railway planning is to construct timetables manually, possibly with support of microsimulation for robustness evaluation. This paper aims to narrow the gap between the state-of-the-art optimization-based research approaches, and the current state-of-practice to construct timetables by combining simulation and optimization. The paper proposes a combined simulation-optimization approach for double-track lines, which generalizes previous work to allow full flexibility in the order of trains by including a new and more generic model to predict delays. By utilizing delay data from simulation, the approach can make socio-economically optimal modifications of a given timetable by minimizing predicted disutility—the weighted sum of scheduled travel time and total predicted delay. In a large simulation experiment on the heavily congested Swedish Western Main Line, it is demonstrated that compared with a real-life, manually constructed, timetable large reductions of delays as well as improvements in punctuality could be obtained to a small cost of marginally longer travel times. The cost of scheduled in-vehicle travel time and mean delay was reduced by 5% on average, representing a large improvement for a highly utilized railway line. Furthermore, a separate scaling experiment indicate that the approach can be suitable also for larger problems.
|
|
| 12. |
- Joborn, M., et al.
(författare)
-
Economies of scale in empty freight car distribution in scheduled railways
- 2004
-
Ingår i: Transportation Science. - : Institute for Operations Research and the Management Sciences (INFORMS). - 0041-1655 .- 1526-5447. ; 38:2, s. 121-134
-
Tidskriftsartikel (refereegranskat)abstract
- In this paper, we consider empty freight car distribution in a scheduled railway system. We analyze the cost structure for the repositioning of empty cars, and conclude that the distribution cost shows an economy-of-scale behavior. In addition to the cost proportional to the number of cars sent from origin to destination, there is a cost related to car-handling operations at yards, which depends on the number of car groups that are handled. Thus, if we can find a transportation pattern in which fewer but larger groups of cars are built, the total distribution cost can be decreased. The objective of the paper is to propose an optimization model that explicitly takes this economy-of-scale effect into account. We use a time-dependent network to describe the possible car movements in time and space, and show how this network can be transformed into a network with fixed costs on links representing movements of cars with identical origin and destination terminals. The resulting optimization model is a capacitated network design model, where each capacity constraint limits the flow on several arcs. We describe a tabu heuristic for solving the model, and present computational results. © 2004 INFORMS.
|
|
| 13. |
- Lindberg, Per Olov, 1942-, et al.
(författare)
-
The Stiff is Moving - Conjugate Direction Frank-Wolfe Methods with Applications to Traffic Assignment
- 2012
-
Ingår i: Transportation Science. - : Institute for Operations Research and the Management Sciences (INFORMS). - 0041-1655 .- 1526-5447. ; 47:2, s. 280-293
-
Tidskriftsartikel (refereegranskat)abstract
- We present versions of the Frank-Wolfe method for linearly constrained convex programs, in which consecutive search directions are made conjugate. Preliminary computational studies in a MATLAB environment applying pure Frank-Wolfe, Conjugate direction Frank-Wolfe (CFW), Bi-conjugate Frank-Wolfe (BFW) and ”PARTANized” Frank-Wolfe methods to some classical Traffic Assignment Problems show that CFW and BFW compare favorably to the other methods. This spurred a more detailed study, comparing our methods to Bar-Gera’s origin-based algorithm. This study indicates that our methods are competitive for accuracy requirements suggested by Boyce et al. We further show that CFW is globally convergent. We moreover point at independent studies by other researchers that show that our methods compare favourably with recent bush-based and gradient projection algorithms on computers with several cores.
|
|
| 14. |
- Mo, Baichuan, et al.
(författare)
-
Ex Post Path Choice Estimation for Urban Rail Systems Using Smart Card Data : An Aggregated Time-Space Hypernetwork Approach
- 2023
-
Ingår i: Transportation Science. - : Institute for Operations Research and the Management Sciences (INFORMS). - 0041-1655 .- 1526-5447. ; 57:2, s. 313-335
-
Tidskriftsartikel (refereegranskat)abstract
- This paper proposes an ex post path choice estimation framework for urban rail systems using an aggregated time-space hypernetwork approach. We aim to infer the actual passenger flow distribution in an urban rail system for any historical day using the observed automated fare collection (AFC) data. By incorporating a schedule-based dynamic transit network loading (SDTNL) model, the framework captures the crowding correlation among stations and the interaction between the path choice and passenger left behind, which is important for the path choice estimation in a “near-capacity” operated urban rail system. The path choice estimation is formulated as an optimization problem, which aims to minimize the difference between the model-derived and observed information with path choice parameters as decision variables. The original problem is intractable because of nonlinear (logit model) and nonanalytical (SDTNL) constraints. A solution procedure is proposed to decompose the original problem into three tractable subproblems, which can be solved efficiently. Solving the decomposed problem is equivalent to finding a fixed point. We prove that the solution to the original problem is the same as the decomposed problem (i.e., the fixed point) when passenger path choices follow the predefined behavior model. If this condition does not hold, the solution of the original problem is proved to be an “almost fixed point” for the decomposed problem. The model is validated using both synthetic and real-world AFC data from a major urban railway system. The analysis with synthetic data validates the model’s effectiveness in estimating path choice parameters and left behind probabilities, which outperforms state-of-art simulation-based optimization methods and probabilistic models in both accuracy and efficiency. The analysis using actual data shows that the estimated path shares are more reasonable than the baseline uniform path shares and survey-derived path shares. The model estimation is robust to different initial parameter values and AFC data from various dates.
|
|
| 15. |
- Osorio, Carolina, et al.
(författare)
-
Capturing Dependency Among Link Boundaries in a Stochastic Dynamic Network Loading Model
- 2015
-
Ingår i: Transportation Science. - : Institute for Operations Research and the Management Sciences (INFORMS). - 0041-1655 .- 1526-5447. ; 49:2, s. 420-431
-
Tidskriftsartikel (refereegranskat)abstract
- This work adds realistic dependency structure to a previously developed analytical stochastic network loading model. The model is a stochastic formulation of the link-transmission model, which is an operational instance of Newell's simplified theory of kinematic waves. Stochasticity is captured in the source terms, the flows, and, consequently, in the cumulative flows. The previous approach captured dependency between the upstream and downstream boundary conditions within a link (i.e., the respective cumulative flows) only in terms of time-dependent expectations without capturing higher-order dependency. The model proposed in this paper adds an approximation of full distributional stochastic dependency to the link model. The model is validated versus stochastic microsimulation in both stationary and transient regimes. The experiments reveal that the proposed model provides a very accurate approximation of the stochastic dependency between the link's upstream and downstream boundary conditions. The model also yields detailed and accurate link state probability distributions.
|
|
| 16. |
- Västberg, Oskar Blom, et al.
(författare)
-
A Dynamic Discrete Choice Activity-Based Travel Demand Model
- 2020
-
Ingår i: Transportation Science. - : INFORMS. - 0041-1655 .- 1526-5447. ; 54:1, s. 21-41
-
Tidskriftsartikel (refereegranskat)abstract
- This paper presents a dynamic discrete choice model (DDCM) for daily activity-travel planning. A daily activity-travel pattern is constructed from a sequence of decisions of when, where, why, and how to travel. Individuals' preferences for activity-travel patterns are described by the sum of the utility of all travel and activity episodes in that pattern, but components of the utility functions, such as travel times, may be stochastic. In each decision stage, individuals act as if they maximized the expected utility of the remainder of the day. The DDCM-model presented allows for a detailed treatment of timing decision consistent with other choice dimensions, respects time-space constraints, and enables the inclusion of explicitly modeled uncertainties in, for example, travel time. In a case study, a model for daily planning of activity and travel on workdays is estimated whereby individuals can perform any number of trips that each is a combination of one of 1,240 locations, four modes, and six activities. Simulation results indicate that the model within sample accurately replicates timing decisions, trip lengths, and the distributions of the number of trips, tours, and trips per tour.
|
|
