共查询到20条相似文献,搜索用时 15 毫秒
1.
We consider an analytical signal control problem on a signalized network whose traffic flow dynamic is described by the Lighthill–Whitham–Richards (LWR) model (Lighthill and Whitham, 1955; Richards, 1956). This problem explicitly addresses traffic-derived emissions as constraints or objectives. We seek to tackle this problem using a mixed integer mathematical programming approach. Such class of problems, which we call LWR-Emission (LWR-E), has been analyzed before to certain extent. Since mixed integer programs are practically efficient to solve in many cases (Bertsimas et al., 2011b), the mere fact of having integer variables is not the most significant challenge to solving LWR-E problems; rather, it is the presence of the potentially nonlinear and nonconvex emission-related constraints/objectives that render the program computationally expensive.To address this computational challenge, we proposed a novel reformulation of the LWR-E problem as a mixed integer linear program (MILP). This approach relies on the existence of a statistically valid macroscopic relationship between the aggregate emission rate and the vehicle occupancy on the same link. This relationship is approximated with certain functional forms and the associated uncertainties are handled explicitly using robust optimization (RO) techniques. The RO allows emissions-related constraints and/or objectives to be reformulated as linear forms under mild conditions. To further reduce the computational cost, we employ a link-based LWR model to describe traffic dynamics with the benefit of fewer (integer) variables and less potential traffic holding. The proposed MILP explicitly captures vehicle spillback, avoids traffic holding, and simultaneously minimizes travel delay and addresses emission-related concerns. 相似文献
2.
In the real world, planned aircraft maintenance schedules are often affected by incidents. Airlines may thus need to adjust their aircraft maintenance schedules following the incidents that occur during routine operations. In tradition, such aircraft maintenance schedule adjustment has been performed manually, a process which is neither effective nor efficient, especially when the problem scale is large. In this study, an aircraft maintenance schedule adjustment model is developed, with the objective of minimizing the total system cost, subject to the related operating constraints. The model is formulated as a zero-one integer program and is solved using a mathematical programing solver. The effectiveness of the model is evaluated by application to a case study using data from an aircraft maintenance center in Taiwan. The test results show the proposed model, as well as the scheduling rules abstracted from the results are useful for the decision maker to adjust good maintenance schedules. 相似文献
3.
Abstract In this article, a cargo container loading plan model is developed based on the operations of FedEx, the international air express carrier. The objective is to minimize total container handling cost, subject to related operating constraints. The model is expected to be a useful planning tool whereby international air express carriers such as FedEx can decide on container loading plans that will lead to lower operating costs, thus enhancing profits and market competitiveness. The model is formulated as a non-linear mixed integer program that is characterized as NP-hard. A solution method is then developed, with the use of the mathematical programming solver, CPLEX, to solve the problem efficiently. To evaluate the model and the solution method, we perform a case study using data from FedEx. The preliminary results indicate that the model and the solution method are both efficient and effective. 相似文献
4.
George Kozanidis 《先进运输杂志》2009,43(2):155-182
Every aircraft, military or civilian, must be grounded for maintenance after it has completed a certain number of flight hours since its last maintenance check. In this paper, we address the problem of deciding which available aircraft should fly and for how long, and which grounded aircraft should perform maintenance operations, in a group of aircraft that comprise a combat unit. The objective is to achieve maximum availability of the unit over the planning horizon. We develop a multiobjective optimization model for this problem, and we illustrate its application and solution on a real life instance drawn from the Hellenic Air Force. We also propose two heuristic approaches for solving large scale instances of the problem. We conclude with a discussion that gives insight into the behavior of the model and of the heuristics, based on the analysis of the results obtained. 相似文献
5.
Siu Kei Hwe Raymond K. Cheung Yat-wah Wan 《Transportation Research Part A: Policy and Practice》2006,40(10):918-935
A significant portion of the 200,000 people working in Hong Kong’s central business district (CBD) relies on buses as their primary means of transport. During peak hours, nearly a thousand double-decker buses pour into a tiny area of 150 ha. This causes traffic congestion and air pollution. Moreover, given that the flow is uni-directional (into the CBD in the morning and out of the CBD in the afternoon), the occupancy of buses in the CBD is actually low.In this paper, we propose to reduce traffic congestion and to increase bus occupancy by merging bus routes. We describe the peculiar situation of the CBD in Hong Kong and explain the necessary conditions for the possible success of merging routes. Our analysis shows that merging will lead to an overall benefit for all parties, including government, bus operators, and passengers. The actual merging decisions, which routes to merge and at what frequencies buses should run, are determined by a mathematical model. The model also shows quantitatively the benefits of merging routes and the impacts of other factors. The procedure that we follow and the model that we adopt can be applied to other CBD. 相似文献
6.
Allocating movable resources dynamically enables evacuation management agencies to improve evacuation system performance in both the spatial and temporal dimensions. This study proposes a mixed integer linear program (MILP) model to address the dynamic resource allocation problem for transportation evacuation planning on large-scale networks. The proposed model is built on the earliest arrival flow formulation that significantly reduces problem size. A set of binary variables, specifically, the beginning and the ending time of resource allocation at a location, enable a strong formulation with tight constraints. A solution algorithm is developed to solve for an optimal solution on large-scale network applications by adopting Benders decomposition. In this algorithm, the MILP model is decomposed into two sub-problems. The first sub-problem, called the restricted master problem, identifies a feasible dynamic resource allocation plan. The second sub-problem, called the auxiliary problem, models dynamic traffic assignment in the evacuation network given a resource allocation plan. A numerical study is performed on the Dallas–Fort Worth network. The results show that the Benders decomposition algorithm can solve an optimal solution efficiently on a large-scale network. 相似文献
7.
Park-and-Ride (PNR) facilities are a commonly used means of making a transit system more widely available. However, given that a PNR passenger must drive for part of the trip, this approach to transit provision has an ambiguous influence on vehicle kilometers traveled (VKT). The impact of PNR on VKT is highly dependent of how PNR users would choose to travel if the PNR facilities were not available. Given that this issue has received little attention in a US context, we use the light rail system in Charlotte, North Carolina as a case study to examine the potential impact of PNR removal on VKT. Using a travel survey of PNR passengers, we estimate the VKT currently generated while driving to and from the rail stations and then estimate how VKT would change under various PNR removal scenarios that assume different behavioral responses. We find that, under the most realistic scenarios, PNR removal would lead the average PNR passenger to increase her driving by 8–15 VKT per round trip. 相似文献
8.
This paper presents a modelling and optimisation framework for deriving ramp metering and variable speed control strategies. We formulate the optimal control problems aiming to minimise the travel delay on motorways based upon a macroscopic cell transmission model of traffic. The optimal ramp metering optimisation is formulated as a linear programming (LP) while the variable speed control problem is formulated as a mixed integer LP. The optimisation models are applied to a real scenario over a section of M25 motorway in the UK. This paper also includes various analyses on the sensitivity of the optimal control solutions with respect to different network configurations and model assumptions. 相似文献
9.
A multi-period multipath refueling location model is developed to expand public electric vehicle (EV) charging network to dynamically satisfy origin–destination (O–D) trips with the growth of EV market. The model captures the dynamics in the topological structure of network and determines the cost-effective station rollout scheme on both spatial and temporal dimensions. The multi-period location problem is formulated as a mixed integer linear program and solved by a heuristic based on genetic algorithm. The model and heuristic are justified using the benchmark Sioux Falls road network and implemented in a case study of South Carolina. The results indicate that the charging station rollout scheme is subject to a number of major factors, including geographic distributions of cities, vehicle range, and deviation choice, and is sensitive to the types of charging station sites. 相似文献
10.
This paper presents a mathematical model to plan emergencies in a densely populated urban zone where a certain numbers of pedestrians depend on transit for evacuation. The proposed model features an integrated operational framework, which simultaneously guides evacuees through urban streets and crosswalks (referred to as “the pedestrian network”) to designated pickup points (e.g., bus stops), and routes a fleet of buses at different depots to those pick‐up points and transports evacuees to their destinations or safe places. In this level, the buses are routed through the so‐called “vehicular network.” An integrated mixed integer linear program that can effectively take into account the interactions between the aforementioned two networks is formulated to find the maximal evacuation efficiency in two networks. Because the large instances of the proposed model are mathematically difficult to solve to optimality, a two‐stage heuristic is developed to solve larger instances of the model. Results from hundreds of numerical examples analysis indicate that proposed heuristic works well in providing (near) optimal or feasibly good solutions for medium‐scale to large‐scale instances that may arise in real transit‐based evacuation situations in a much shorter amount of computational time compared with cplex (can find optimal/feasible solutions for only five instances within 3 hours of running). Copyright © 2016 John Wiley & Sons, Ltd. 相似文献
11.
This paper focuses on how to minimize the total passenger waiting time at stations by computing and adjusting train timetables for a rail corridor with given time-varying origin-to-destination passenger demand matrices. Given predetermined train skip-stop patterns, a unified quadratic integer programming model with linear constraints is developed to jointly synchronize effective passenger loading time windows and train arrival and departure times at each station. A set of quadratic and quasi-quadratic objective functions are proposed to precisely formulate the total waiting time under both minute-dependent demand and hour-dependent demand volumes from different origin–destination pairs. We construct mathematically rigorous and algorithmically tractable nonlinear mixed integer programming models for both real-time scheduling and medium-term planning applications. The proposed models are implemented using general purpose high-level optimization solvers, and the model effectiveness is further examined through numerical experiments of real-world rail train timetabling test cases. 相似文献
12.
Mohsen Babaei Jan‐Dirk Schmöcker Navid Khademi Ahmad‐Reza Ghaffari Ali Naderan 《先进运输杂志》2016,50(6):1252-1271
This paper introduces the taxi route network design problem (TXRNDP) for a fixed‐route taxi service operating in Iran and, in similar form, in various other developing countries. The service operates fairly similar to regular transit services in that vehicles are only permitted to follow a certain predetermined route on the network. The service is provided with small size vehicles and main features are that vehicles only depart if full and that there are no intermediate boarding stops. In Iran the service attracts a high modal share but requires better coordination which is the main motivation for the present study. We develop a mathematical programming model to minimize the total travel time experienced by passengers while constraining the number of taxi lines, the trip transfer ratio and the length of taxi lines. A number of assumptions are introduced in order to allow finding an exact rather than heuristic solution. We further develop a linear programming solution to minimize the number of taxis required to serve the previously found fixed‐route taxi network. Results of a case study with the city of Zanjan, Iran, illustrate the resulting taxi flows and suggest the capability of the proposed model to reduce the total travel time, the total waiting time and the number of taxi lines compared to the current taxi operation. Copyright © 2016 John Wiley & Sons, Ltd. 相似文献
13.
Abstract Effective management of interfaces between procurement, supply, production and distribution for higher efficiency in the supply chain is an important issue in global manufacturing, where the synchronization of production and transportation planning represents important savings in operational costs. This paper focuses on the synchronization of production planning and transportation planning in a production distribution network, where transportation is subcontracted to a professional transportation enterprise (PTE) for vehicle-hiring. Dynamic and flexible numbers of vehicles are used to cater for fast changing market demands. Thus, the number of vehicles to be hired is viewed from the planning point of view as an operational decision considered simultaneously with production and transportation planning. A mathematical model – SPTP/MTDS – for synchronized production and transportation planning under multiple times and direct shipping strategy (MTDS) is discussed, and a Lagrange relaxation decomposition-based two layer decision procedure (LRD-TLDP) is developed. By introducing artificial decision variables and Lagrange multipliers, SPTP/MTDS is decomposed into a production decision sub-problem (SPTP-PD), and a distribution decision sub-problem (SPTP-DD). A priority-based assignment heuristic and a partial chain-based genetic algorithm are developed to solve SPTP-PD and SPTP-DD, respectively. An illustration of the application of the model in an electronic appliance manufacturing enterprise in China is presented. 相似文献
14.
Philippe Barla Bernard Lamonde Luis F. Miranda-Moreno Nathalie Boucher 《Transportation》2009,36(4):389-402
This paper presents estimates of the rebound effect and other elasticities for the Canadian light-duty vehicle fleet using
panel data at the provincial level from 1990 to 2004. We estimate a simultaneous three-equation model of aggregate demand
for vehicle kilometers traveled, vehicle stock and fuel efficiency. Price and income elasticities obtained are broadly consistent
with those reported in the literature. Among other results, an increase in the fuel price of 10% would reduce driving by ~2%
in the long term and by 1% the average fuel consumption rate. Estimates of the short- and long-term rebound effects are ~8
and 20%, respectively. We also find that an increase in the gross domestic product per capita of 10% would cause an increase
in driving distance of 2–3% and an increase of up to 4% in vehicle stock per adult. In terms of policy implications, our results
suggest that: (1) the effectiveness of new fuel efficiency standards will be somewhat mitigated by the rebound effect and
(2) fuel price increases have limited impacts on gasoline demand.
Philippe Barla is full professor at the economics department of Université Laval. He is currently the director of the research center GREEN and is a member of CDAT. He is conducting theoretical and empirical research on energy efficiency in the transportation sector. Bernard Lamonde obtained his MA in economics in 2007 working on this project. He is working as an economist for Agence de l’efficacité énergique du Québec. Luis Miranda-Moreno is professor at McGill Department of Civil Engineering and Applied Mechanics. He was post-doctoral student at CDAT when this research was carried out. His research interests include road safety, travel behaviour and demand modeling. Nathalie Boucher holds a PhD in economics from Queens’ University. She is the executive director the CDAT a research center dedicated to improving knowledge about energy use in the Canadian private and commercial transportation sector. 相似文献
Philippe BarlaEmail: |
Philippe Barla is full professor at the economics department of Université Laval. He is currently the director of the research center GREEN and is a member of CDAT. He is conducting theoretical and empirical research on energy efficiency in the transportation sector. Bernard Lamonde obtained his MA in economics in 2007 working on this project. He is working as an economist for Agence de l’efficacité énergique du Québec. Luis Miranda-Moreno is professor at McGill Department of Civil Engineering and Applied Mechanics. He was post-doctoral student at CDAT when this research was carried out. His research interests include road safety, travel behaviour and demand modeling. Nathalie Boucher holds a PhD in economics from Queens’ University. She is the executive director the CDAT a research center dedicated to improving knowledge about energy use in the Canadian private and commercial transportation sector. 相似文献
15.
16.
This paper addresses the scheduling of supply chains with interrelated factories consisting of a single vendor and multiple customers. In this research, one transporter is available to deliver jobs from vendor to customers, and the jobs can be processed by batch. The problem studied in this paper focuses on a real-case scheduling problem of a multi-location hospital supplied with a central pharmacy. The objective of this work is to minimize the total cost, while satisfying the customer’s due dates constraints. A mathematical formulation of the problem is given as a Mixed Integer Programming model. Then, a Branch-and-Bound algorithm is proposed as an exact method for solving this problem, a greedy local search is developed as a heuristic approach, and a hybrid Genetic Algorithm is presented as a meta-heuristic. Computation experiments are conducted to highlight the performance of the proposed methods. 相似文献
17.
A schedule consisting of an appropriate arrival time at each time control point can ensure reliable transport services. This paper develops a novel time control point strategy coupled with transfer coordination for solving a multi‐objective schedule design problem to improve schedule adherence and reduce intermodal transfer disutility. The problem is formulated using a robust mixed‐integer nonlinear programming model. The mixed‐integer nonlinear programming model is equivalently transformed into a robust mixed‐integer linear programming model, which is then approximated by a deterministic mixed‐integer linear programming model through Monte Carlo simulation. Thus, the optimal scheduled arrival time at each time control point can be precisely obtained using cplex . Numerical experiments based on three bus lines and the mass rapid transit system in Singapore are presented, and the results show that the schedule determined using the developed model is able to provide not only reliable bus service but also a smooth transfer experience for passengers. Copyright © 2016 John Wiley & Sons, Ltd. 相似文献
18.
Oversaturation has become a severe problem for urban intersections, especially the bottleneck intersections that cause queue spillover and network gridlock. Further improvement of oversaturated arterial traffic using traditional mitigation strategies, which aim to improve intersection capacity by merely adjusting signal control parameters, becomes challenging since exiting strategies may (or already) have reached their “theoretical” limits of optimum. Under such circumstance, several novel unconventional intersection designs, including the well-recognized continuous flow intersection (CFI) design, are originated to improve the capacity at bottleneck intersections. However, the requirement of installing extra sub-intersections in a CFI design would increase vehicular stops and, more critically, is unacceptable in tight urban areas with closed spaced intersections. To address these issues, this research proposes a simplified continuous flow intersection (called CFI-Lite) design that is ideal for arterials with short links. It benefits from the CFI concept to enable simultaneous move of left-turn and through traffic at bottleneck intersections, but does not need installation of sub-intersections. Instead, the upstream intersection is utilized to allocate left-turn traffic to the displaced left-turn lane. It is found that the CFI-Lite design performs superiorly to the conventional design and regular CFI design in terms of bottleneck capacity. Pareto capacity improvement for every traffic stream in an arterial system can be achieved under effortless conditions. Case study using data collected at Foothill Blvd in Los Angeles, CA, shows that the new design is beneficial in more than 90% of the 408 studied cycles. The testing also shows that the average improvements of green bandwidths for the synchronized phases are significant. 相似文献
19.
Determining the number and location of depots for winter road maintenance (WRM) represents one of the important strategic decisions while planning WRM activities. However, most organizations dealing with WRM make empirically based decisions. Optimizing the number and location of WRM depots has the potential to achieve considerable cost savings, improve mobility and efficiency, as well as reduce environmental impacts. This paper presents two optimization models. The first model determines the location of WRM depots by minimizing the total distance travelled by maintenance vehicles. The second model determines the optimum number and location of WRM depots by minimizing total transportation costs and capital expenditure and operational expenditure of the depots. The models are then applied to the district road network in Serbia. Results show that their application could lead to significant reductions in WRM costs. 相似文献
20.
This paper focuses on developing mathematical optimization models for the train timetabling problem with respect to dynamic travel demand and capacity constraints. The train scheduling models presented in this paper aim to minimize passenger waiting times at public transit terminals. Linear and non-linear formulations of the problem are presented. The non-linear formulation is then improved through introducing service frequency variables. Heuristic rules are suggested and embedded in the improved non-linear formulation to reduce the computational time effort needed to find the upper bound. The effectiveness of the proposed train timetabling models is illustrated through the application to an underground urban rail line in the city of Tehran. The results demonstrate the effectiveness of the proposed demand-oriented train timetabling models, in terms of decreasing passenger waiting times. Compared to the baseline and regular timetables, total waiting time is reduced by 6.36% and 10.55% respectively, through the proposed mathematical optimization models. 相似文献