首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 15 毫秒
1.
The purpose of this paper is to determine optimal shipping strategies (i.e. routes and shipment sizes) on freight networks by analyzing trade-offs between transportation, inventory, and production set-up costs. Networks involving direct shipping, shipping via a consolidation terminal, and a combination of terminal and direct shipping are considered. This paper makes three main contributions. First, an understanding is provided of the interface between transportation and production set-up costs, and of how these costs both affect inventory. Second, conditions are identified that indicate when networks involving direct shipments between many origins and destinations can be analyzed on a link-by-link basis. Finally, a simple optimization method is developed that simultaneously determines optimal routes and shipment sizes for networks with a consolidation terminal and concave cost functions. This method decomposes the network into separate sub-networks, and determines the optimum analytically without the need for mathematical programming techniques.  相似文献   

2.
The paper describes a new method of optimizing traffic signal settings. The area-wide urban traffic control system developed in the paper is based on the Bee Colony Optimization (BCO) technique. The BCO method is based on the principles of the collective intelligence applied by the honeybees during the nectar collecting process. The optimal (or near-optimal) values of cycle length, offsets, and splits are discovered by minimizing the total travel time of all network users travelling through signalized intersections. The set of numerical experiments is performed on well-known traffic benchmark network. The results obtained by the BCO approach are compared with the results found by Simulated Annealing (SA). It has been shown that the suggested BCO approach outperformed the SA.  相似文献   

3.

The problem of generating a set of “good” transportation alternatives during the early and intermediate stages of transportation planning is addressed in this paper. A linear programming model of a multi‐modal transportation system is developed. The model is run interactively to determine optimal operating levels for all modes for various transport policy decisions. The model described is a component of a composite network generation model incorporating dynamic changes. The linear programming component determines optimal operating policies for given points in time. The composite model incorporates these in a dynamic programming framework to determine optimal staged investment policies over several time periods.  相似文献   

4.
This paper studies the transit network scheduling problem and aims to minimize the waiting time at transfer stations. First, the problem is formulated as a mixed integer programming model that gives the departure times of vehicles in lines so that passengers can transfer between lines at transfer stations with minimum waiting times. Then, the model is expanded to a second model by considering the extra stopping time of vehicles at transfer stations as a new variable set. By calculating the optimal values for these variables, transfers can be better performed. The sizes of the models, compared with the existing models, are small enough that the models can be solved for small- and medium-sized networks using regular MIP solvers, such as CPLEX. Moreover, a genetic algorithm approach is represented to more easily solve larger networks. A simple network is used to describe the models, and a medium-sized, real-life network is used to compare the proposed models with another existing model in the literature. The results demonstrate significant improvement. Finally, a large-scale, real-life network is used as a case study to evaluate the proposed models and the genetic algorithm approach.  相似文献   

5.
Container liner shipping companies only partially alter their shipping networks to cope with the changing demand, rather than entirely redesign and change the network. In view of the practice, this paper proposes an optimal container liner shipping network alteration problem based on an interesting idea of segment, which is a sequence of legs from a head port to a tail port that are visited by the same type of ship more than once in the existing shipping network. In segment-based network alteration, the segments are intact and each port is visited by the same type of ship and from the same previous ports. As a result, the designed network needs minimum modification before implementation. A mixed-integer linear programming model with a polynomial number of variables is developed for the proposed segmented-based liner shipping network alternation problem. The developed model is applied to an Asia–Europe–Oceania liner shipping network with a total of 46 ports and 11 ship routes. Results demonstrate that the problem could be solved efficiently and the optimized network reduces the total cost of the initial network considerably.  相似文献   

6.
This research focuses on an efficient design of transit network in urban areas. The system developed is used to create, analyze and optimize routes and frequencies of transit system in the network level. The analysis is based on elastic demand, so the shift of demand between modes in network due to different service level is of prime consideration. The developed system creates all feasible routes connecting all pairs of terminals in the network. Out of this vast pool of routes, a set of optimal routes is generated for a certain predetermined number that maintains connectivity of significant demand. Based on these generated routes, the system fulfils transportation demand by assigning demand that considers path and route choices for non-transit users and transit users. Together with the assignment of demand, transit frequencies are optimized and the related fleet-size is calculated. Having an optimal setting of solution, the system is continued by reconnecting the routes to find some other better solutions in the periphery of the optimal setting. A set of mathematical programming modules is developed. Real data from Sioux Falls city network is used to evaluate the performance of the model and compare with other heuristic methods.  相似文献   

7.
We propose a new mathematical formulation for the problem of optimal traffic assignment in dynamic networks with multiple origins and destinations. This problem is motivated by route guidance issues that arise in an Intelligent Vehicle-Highway Systems (IVHS) environment. We assume that the network is subject to known time-varying demands for travel between its origins and destinations during a given time horizon. The objective is to assign the vehicles to links over time so as to minimize the total travel time experienced by all the vehicles using the network. We model the traffic network over the time horizon as a discrete-time dynamical system. The system state at each time instant is defined in a way that, without loss of optimality, avoids complete microscopic detail by grouping vehicles into platoons irrespective of origin node and time of entry to network. Moreover, the formulation contains no explicit path enumeration. The state transition function can model link travel times by either impedance functions, link outflow functions, or by a combination of both. Two versions (with different boundary conditions) of the problem of optimal traffic assignment are studied in the context of this model. These optimization problems are optimal control problems for nonlinear discrete-time dynamical systems, and thus they are amenable to algorithmic solutions based on dynamic programming. The computational challenges associated with the exact solution of these problems are discussed and some heuristics are proposed.  相似文献   

8.
This is research is aimed at elaborating a new methodology of shortest path finding by utilizing the methods of taxonomy and genetic algorithms. Combination of the two is developed and called Genetic Taxonomy Evaluator (GTE) which is expected to be an alternative tool to solve shortest path finding problems within the transportation networks While keeping the properties of transportation networks Taxonomy Reconstructor (TR) transforms the network representation into taxonomic structure, which is hierarchically shaped, based on problem to be solved. In the process TR also creates classification of nodes in the network. This classification provides facilities to isolate the problem to the core, and the criteria that can be inserted in the Genetic Algorithm (GA). A package program for GTE is then developed in C-Language and performance of model is analyzed upon a medium scale of Sioux-Falls City Network. In conclusion, it is found that to achieve fairly quick convergence of GTE computation several optimal parameters of GA should be determined prior to searching for the shortest paths. And since GTE has only been applied to limited case, it is suggested that the findings could be a threshold for further researches.  相似文献   

9.
A bi-attribute concave shortest path (BC-SP) problem seeks to find an optimal path in a bi-attribute network that minimizes a linear combination of two path costs, one of which is evaluated by a nondecreasing concave function. Due to the nonadditivity of its objective function, Bellman’s principle of optimality does not hold. This paper proposes a parametric search method to solve the BC-SP problem, which only needs to solve a series of shortest path problems, i.e., the parameterized subproblems (PSPs). Several techniques are developed to reduce both the number of PSPs and the computation time for these PSPs. Specifically, we first identify two properties of the BC-SP problem to guide the parametric search using the gradient and concavity of its objective function. Based on the properties, a monotonic descent search (MDS) and an intersection point search (IPS) are proposed. Second, we design a speedup label correcting (LC) algorithm, which uses optimal solutions of previously solved PSPs to reduce the number of labeling operations for subsequent PSPs. The MDS, IPS and speedup LC techniques are embedded into a branch-and-bound based interval search to guarantee optimality. The performance of the proposed method is tested on the mean-standard deviation shortest path problem and the route choice problem with a quadratic disutility function. Experiments on both real transportation networks and grid networks show that the proposed method reduces the computation time of existing algorithms by one to two orders of magnitude.  相似文献   

10.
This paper addresses the optimal toll design problem for the cordon-based congestion pricing scheme, where both a time-toll and a nonlinear distance-toll (i.e., joint distance and time toll) are levied for each network user’s trip in a pricing cordon. The users’ route choice behaviour is assumed to follow the Logit-based stochastic user equilibrium (SUE). We first propose a link-based convex programming model for the Logit-based SUE problem with a joint distance and time toll pattern. A mathematical program with equilibrium constraints (MPEC) is developed to formulate the optimal joint distance and time toll design problem. The developed MPEC model is equivalently transformed into a semi-infinite programming (SIP) model. A global optimization method named Incremental Constraint Method (ICM) is designed for solving the SIP model. Finally, two numerical examples are used to assess the proposed methodology.  相似文献   

11.
Macroscopic fundamental diagram (MFD) describes the macro relationship between a network vehicle density and a network space mean flow, without requiring the mastery of complex origin to destination data. Thus, MFD provides an opportunity for the macro control of urban road network. However, most of the existing MFD control methods ignore the active role of traffic guidance in solving congestion problems. This study presents a traffic guidance–perimeter control coupled (TGPCC) method to improve the performance of macroscopic traffic networks. The method considers the optimal cumulative volume of a network as the goal and establishes a programming function according to the network equilibrium rule of traffic flow amongst multiple MFD sub-regions, which regards the minimum delay of network, as the objective. The Logit model for the compliance rate of driver route guidance is established by the stated preference survey. Moreover, the perimeter control (PC) method is proposed for adjusting the phase split of intersections. Finally, three schemes, namely, the TGPCC, PC and the method without PC and guidance are tested on a network with four well-defined MFD sub-regions. Results show that the TGPCC addresses the issue of congestion and decreases the total delay accordingly.  相似文献   

12.
The benefit, in terms of social surplus, from introducing congestion charging schemes in urban networks is depending on the design of the charging scheme. The literature on optimal design of congestion pricing schemes is to a large extent based on static traffic assignment, which is known for its deficiency in correctly predict travel times in networks with severe congestion. Dynamic traffic assignment can better predict travel times in a road network, but are more computational expensive. Thus, previously developed methods for the static case cannot be applied straightforward. Surrogate‐based optimization is commonly used for optimization problems with expensive‐to‐evaluate objective functions. In this paper, we evaluate the performance of a surrogate‐based optimization method, when the number of pricing schemes, which we can afford to evaluate (because of the computational time), are limited to between 20 and 40. A static traffic assignment model of Stockholm is used for evaluating a large number of different configurations of the surrogate‐based optimization method. Final evaluation is performed with the dynamic traffic assignment tool VisumDUE, coupled with the demand model Regent, for a Stockholm network including 1240 demand zones and 17 000 links. Our results show that the surrogate‐based optimization method can indeed be used for designing a congestion charging scheme, which return a high social surplus. Copyright © 2016 John Wiley & Sons, Ltd.  相似文献   

13.
This research develops a realistic and efficient operational model to optimize empty equipment and crew movements in long-haul trucking networks with consolidation, where returning drivers home within a reasonable amount of time is an important issue. The problem can be stated as follows. On a network of consolidation centers, demand is expressed as a set of trailer-loads that need to be moved between each pair of consolidation centers in each time period and the objective is to optimize trailer, tractor and driver movements while ensuring that drivers return home within a pre-determined period of time. In this paper, a dynamic integer programming model is developed and an efficient approximate solution method is proposed, which involves column generation and branch-and-bound. The algorithm switches from a combination of network and primal simplex to dual simplex to overcome the degeneracy problem, which is very common for dynamic networks. This novel approach enables solving large problems with many intervals. We solved problems with up to 30 nodes and 48 periods successfully by using real data provided by a less-than-truckload company, and by generating statistical forecasts based on the real data.  相似文献   

14.
The problem of designing network-wide traffic signal control strategies for large-scale congested urban road networks is considered. One known and two novel methodologies, all based on the store-and-forward modeling paradigm, are presented and compared. The known methodology is a linear multivariable feedback regulator derived through the formulation of a linear-quadratic optimal control problem. An alternative, novel methodology consists of an open-loop constrained quadratic optimal control problem, whose numerical solution is achieved via quadratic programming. Yet a different formulation leads to an open-loop constrained nonlinear optimal control problem, whose numerical solution is achieved by use of a feasible-direction algorithm. A preliminary simulation-based investigation of the signal control problem for a large-scale urban road network using these methodologies demonstrates the comparative efficiency and real-time feasibility of the developed signal control methods.  相似文献   

15.
This paper investigates intermodal freight transport planning problems among deep-sea terminals and inland terminals in hinterland haulage for a horizontally fully integrated intermodal freight transport operator at the tactical container flow level. An intermodal freight transport network (IFTN) model is first developed to capture the key characteristics of intermodal freight transport such as the modality change phenomena at intermodal terminals, physical capacity constraints of the network, time-dependent transport times on freeways, and time schedules for trains and barges. After that, the intermodal freight transport planning problem is formulated as an optimal intermodal container flow control problem from a system and control perspective with the use of the proposed IFTN model. To deal with the dynamic transport demands and dynamic traffic conditions in the IFTN, a receding horizon intermodal container flow control (RIFC) approach is proposed to control and to reassign intermodal container flows in a receding horizon way. This container flow control approach involves solving linear programming problems and is suited for transport planning on large-sized networks. Both an all-or-nothing approach and the proposed RIFC approach are evaluated through simulation studies. Simulation results show the potential of the proposed RIFC approach.  相似文献   

16.
An equivalent continuous time optimal control problem is formulated to predict the temporal evolution of traffic flow pattern on a congested multiple origin-destination network, corresponding to a dynamic generalization of Wardropian user equilibrium. Optimality conditions are derived using the Pontryagin minimum principle and given economic interpretations, which are generalizations of similar results previously reported for single-destination networks. Analyses of sufficient conditions for optimality and of singular controls are also given. Under the steady-state assumptions, the model is shown to be a proper dynamic extension of Beckmann's mathematical programming problem for a static user equilibrium traffic assignment.  相似文献   

17.
The advancement of information and communication technology allows the use of more sophisticated information provision strategies for real-time congested traffic management in a congested network. This paper proposes an agent-based optimization modeling framework to provide personalized traffic information for heterogeneous travelers. Based on a space–time network, a time-dependent link flow based integer programming model is first formulated to optimize various information strategies, including elements of where and when to provide the information, to whom the information is given, and what alternative route information should be suggested. The analytical model can be solved efficiently using off-the-shelf commercial solvers for small-scale network. A Lagrangian Relaxation-based heuristic solution approach is developed for medium to large networks via the use of a mesoscopic dynamic traffic simulator.  相似文献   

18.
This research focuses on finding the best transfer schemes in metro networks. Using sample-based time-invariant link travel times to capture the uncertainty of a realistic network, a two-stage stochastic integer programming model with the minimized expected travel time and penalty value incurred by transfer activities is formulated. The first stage aims to find a sequence of potential transfer nodes (stations) that can compose a feasible path from origins to destinations in the transfer activity network, and the second stage provides the least time paths passing by the generated transfer stations in the first stage for evaluating the given transfer schemes and then outputs the best routing information. To solve our proposed model, an efficient hybrid algorithm, in which the label correcting algorithm is embedded into a branch and bound searching framework, is presented to find the optimal solutions of the considered problem. Finally, the numerical experiments are implemented in different scales of metro networks. The computational results demonstrate the effectiveness and performance of the proposed approaches even for the large-scale Beijing metro network.  相似文献   

19.
Broadcast capacity of the entire network is one of the fundamental properties of vehicular ad hoc networks (VANETs). It measures how efficiently the information can be transmitted in the network and usually it is limited by the interference between the concurrent transmissions in the physical layer of the network. This study defines the broadcast capacity of vehicular ad hoc network as the maximum successful concurrent transmissions. In other words, we measure the maximum number of packets which can be transmitted in a VANET simultaneously, which characterizes how fast a new message such as a traffic incident can be transmitted in a VANET. Integer programming (IP) models are first developed to explore the maximum number of successful receiving nodes as well as the maximum number of transmitting nodes in a VANET. The models embed an traffic flow model in the optimization problem. Since IP model cannot be efficiently solved as the network size increases, this study develops a statistical model to predict the network capacity based on the significant parameters in the transportation and communication networks. MITSIMLab is used to generate the necessary traffic flow data. Response surface method and linear regression technologies are applied to build the statistical models. Thus, this paper brings together an array of tools to solve the broadcast capacity problem in VANETs. The proposed methodology provides an efficient approach to estimate the performance of a VANET in real-time, which will impact the efficacy of travel decision making.  相似文献   

20.
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.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号