Multiobjective bilevel optimization for transportation planning and management problems

Many previous studies have formulated the decision‐making problems in transportation system planning and management as single‐objective bilevel optimization models. However, real‐world decision‐making processes always have several social concerns and thus multiple objectives need to be achieved simultaneously. In most cases, these objective functions conflict with each other and are also not simple enough to be combined into a single one. Therefore it is necessary to apply multiobjective optimization to generate non‐dominated or Pareto optimal alternatives. It can be foreseen that the multiobjective bilevel modeling approach can become a powerful, and possibly interactive, decision tool, allowing the decision‐makers to learn more about the problem before committing to a final decision. Such multiobjective bilevel models are difficult to solve due to their intrinsic nonconvexity and multiple objectives. This paper consequently proposes a solution algorithm for the multiobjective bilevel models using genetic algorithms. The proposed algorithm is illustrated, using the numerical example taken from the previous study. It is found that the proposed algorithm is efficient to search simultaneously the Pareto optimal solutions.     

Accelerating convergence of the Frank-Wolfe algorithm

We consider the Frank-Wolfe algorithm in the context of the traffic assignment problem. The slow-convergence characteristics close to the optimum solution of this popular approach are well known. Several proposals have improved on the original method by modifying the search direction. We propose modifying the step size, which leads to very significant improvements in efficiency.     

The convergence of diagonalization algorithms for asymmetric network equilibrium problems

We provide a sufficient condition for the convergence of diagonalization algorithms for equilibrium traffic assignment problems with asymmetric Jacobian matrix B(v) of the link user cost mapping s(v) of the flow v. When

Full-size image

, where D(v^*) > 0 is the diagonal of B(v^*) and v^* is the equilibrium flow, we demonstrate a local convergence theorem for nonlinear cost functions. The implication of this result for practical applications of the model are outlined.     

On the convergence of iterative methods for the distribution balancing problem

A general distribution balancing problem, specified by the given outflows and inflows and the factorial form of its solution, is formulated. Solution uniqueness and boundedness is discussed—primarily in graph theoretical terms. An entropy maximisation problem, subject to general linear constraints, is transformed into an unconstrained optimisation problem by application of standard duality theory, and a relevant general convergence theorem for iterative solution methods is given. The optimum solution in a special case is identified with the flow solution. When expressed in flow variables, the dual objective has a unique and bounded optimum solution and is an appropriate unifying concept for measuring the rate of convergence of different solution methods. By regarding the balancing procedure as an iterative optimisation method, a new and simple proof of its convergence is given, together with some asymptotic results, which are also compared with those of Newton's method. It is pointed out that there are two different forms of Newton's method, according to the choice of variables—untransformed or transformed— in the original distribution balancing problem. When Newton's method is applied to the whole system of equations simultaneously, the trajectory of iterates is observed to depend on this variable choice. For the transformed variables it is noticed that the convergence with the balancing procedure is quicker than with Newton's method applied to the outflow- and inflow- equations, alternately. To guarantee global convergence with Newton's method and to increase the rate a supplementary linear search routine is recommended.     

Application of genetic algorithm for scheduling and schedule coordination problems

The problems on scheduling and schedule co‐ordination usually have conflicting objectives related to user's cost and operator's cost. Users want to spend less time to wait, transfer and travel by public buses. Operators are interested in profit making by lesser vehicle operating cost and having a minimum number of buses. As far as level of service is concerned users are interested in lesser crowing while operators are concerned with maximizing profit and thus to have higher load factors. In schedule co‐ordination problems transfer time plays an important role. Users are interested in coordinating services with in acceptable waiting time whereas operators prefer to have lesser services and want to meet higher demands, which invariably increases waiting time. These problems have multiple conflicting objectives and constraints. It is difficult to determine optimum solution for such problems with the help of conventional approaches. It is found that Genetic Algorithm performs well for such multi objective problems.     

On the convergence of Bell's logit assignment formulation

In Bell M.G.H. (1995. Transportation Research B 29, 287–295), a new logit assignment formulation was developed, which considered all possible paths in the network while still retaining the absence of a need for path enumeration. In his formulation, it presumes that the sum of a geometric series of the weights matrix always converges and hence can be computed as the inversion of a matrix. In this paper, we investigate the convergence properties of this geometric series by means of an eigensystem interpretation which states that the series converges if and only if all the eigenvalues associated with the weights matrix fall into the unit circle in a complex plane. It is found that the geometric series converges unconditionally for acyclic networks, but not necessarily does so for general networks.     

An algorithm for solving asymmetric equilibrium problems with a continuous cost-flow function

The paper gives two user objective functions for the asymmetric assignment problem, and an algorithm of descent type. The algorithm produces a sequence of flows which converges to the set of equilibria if the cost-flow function is continuous.     

On the use of mathematical programming in the evaluation of transport policies

This paper focuses on the evaluation processes by which decisions regarding transportation alternatives can be assisted. A multidimensional approach usually called multiple criteria decision making is required to represent the complexity of transportation policy and systems.

The multiple criteria decision making techniques can be divided into two groups. The first is based on a ranking scheme approach and the second on a mathematical programming approach.

A multiple objective mathematical programming procedure known as Goal Programming is presented. The authors examined the use of that procedure in real transportation problems.

The results suggest that multiple objective mathematical programming techniques in general do not appear to be appropriate in transportation policy analysis involving mutually exclusive alternatives. Their use can be limited to special cases in the private sector.     

On the modeling and solution algorithm for the reverse logistics recycling flow equilibrium problem

This paper presents a study that characterizes, formulates, and solves the reverse logistic recycling flow equilibrium (RLRFE) problem. The RLRFE problem is concerned with the recycling channel in which recyclable collectors, processors, landfills, and demand markets form a multi-tiered network to process the recycled material flows from sources destined either for landfills or demand markets. Motivated by a government policy making or enterprise conglomerate recycling system design and operation needs, the RLRFE problem is elaborated from a system-optimal perspective using the variational inequality (VI) approach. For each origin–destination (OD) pair, the corresponding equilibrium conditions are established as a variation of the Wardrop second principle. In light of demand and cost function interactions, a nested diagonalization solution (ND) algorithm is proposed that gradually transforms the RLRFE problem into a traffic assignment model. To address multiple landfills in the recycling network and to understand how a variable-demand problem can be analyzed as a fixed-demand problem, we propose a supernetwork representation of the RLRFE problem. A numerical analysis on a test case illustrates the model formulation and the proposed algorithm.     

On the equivalence of common rearrangements for sum constrained travel estimation problems

This paper examines the problem of estimating the parameters of nonlinear sum constrained models by use of rearrangements to permit linear estimation methods. Over the years a number of different, and sometimes ingenious, techniques have been proposed but a remaining difficulty arises from the fact that different rearrangements lead to different parameter estimates. In this paper it is shown that while ordinary least squares certainly results in different estimates, generalised least squares leads to identical parameter estimates provided convergence to the true maximum likelihood estimates is achieved. In particular it is seen that estimates are invariant with choice of base or deletion of one equation and identical for the single base, multinominal logit, geometric mean and link constant versions. The findings of this paper apply to any sum-constrained model and in transportation these occur very frequently as mode choice problems, singly-constrained gravity models, and as route choice models in path assignment. While we develop all results in this paper in the context of an intercity passenger modal market share model, the transferability of these results to other problems should be recognised.     

数字图像处理技术在隧道围岩收敛量测中应用的初步研究

文章系统地总结了国内外图像处理技术在隧道工程中的应用现状和隧道变形收敛量测的各种方法,并对各种方法的优缺点进行了详细分析;尝试了应用数字图像处理技术对隧道围岩收敛进行量测的新方法(二次比较法);编制了一套隧道图像处理系统(TUNNEL IMAGE PROCESSING SYSTEM,简称TIPS)。室内试验证明,本系统对距离的量测结果是可靠的,灵敏度和精度达到了相关要求。本研究成果可供有关人员在现场实用研究中参考。     

A direct method for speeding up the convergence of the furness biproportional method

This paper describes a direct non-iterative balancing technique which could be used as a complementary part to the Furness method to speed up the convergence to the final solution. This is particularly useful when the convergence of the Furness iterations is uneconomically slow and/or when high balancing accuracy is needed. The direct method however, might be used as a substitute to the Furness method in evaluating the consequences of a few alternative sets of small variations in the marginal totals of a two dimensional array.     

An algorithm for the combined distribution and assignment problem

Much interest has recently been shown in the combination of the distribution and assignment models. In this paper we adopt a generalized Benders' decomposition to solve this combined problem for a system optimized assignment with linear link costs and explicit capacity constraints on link flows. The master problem which is generated is used to show that the combined problem can be viewed as a modified distribution problem, of gravity form, with a minimax instead of a linear objective function. An algorithm for solving the master problem is discussed, and some computational results presented.     

An approximate dynamic programming approach for the empty container allocation problem

The objective of this study is to demonstrate the successful application of an approximate dynamic programming approach in deriving effective operational strategies for the relocation of empty containers in the containerized sea-cargo industry. A dynamic stochastic model for a simple two-ports two-voyages (TPTV) system is proposed first to demonstrate the effectiveness of the approximate optimal solution obtained through a simulation based approach known as the temporal difference (TD) learning for average cost minimization. An exact optimal solution can be obtained for this simple TPTV model. Approximate optimal results from the TPTV model utilizing a linear approximation architecture under the TD framework can then be compared to this exact solution. The results were found comparable and showed promising improvements over an existing commonly used heuristics. The modeling and solution approach can be extended to a realistic multiple-ports multiple-voyages (MPMV) system. Some results for the MPMV case are shown.     

A relationship between the gravity model for trip distribution and the transportation problem in linear programming

A gravity model for trip distribution describes the number of trips between two zones as a product of three factors; one is associated with the zone in which a trip begins, one with the zone in which it ends and the third with the separation between the zones. The separation or deterrence factor is usually a decreasing function of the generalized cost of travelling between the zones, where generalized cost is usually some combination of the time of travel, the distance travelled and the actual monetary costs.If the deterrence factor is of the exponential form exp (-αc) and if the total numbers of origins and destinations in each zone are known, then the resulting trip matrix depends solely on α. In this paper it is shown that as α tends to infinity, this trip matrix tends to a limit in which the total cost of trips is the least possible allowed by the given origin and destination totals. That is to say the limit is a cost-minimizing solution to the linear programming transportation problem having the same origin and destination totals. If this transportation problem has many cost-minimizing solutions then it is shown that the limit is one particular solution in which each non-zero flow from an origin i to a destination j is of the form r_is_j. A numerical example is given.     

内河船舶防污染面临的问题及对策研究

随着我国东线南水北调工程的建设,内河船舶对水域环境造成的污染引起了高度的重视,为了保障南水北调工程的建设和人民群众生活及生态环境安全,加强内河船舶污染控制工作成为海事船检部门工作的重中之重。严格把关船舶污染水域源头,从现行法制手段、国家监督管理机制、船舶防污设计等多个方面进行分析,采取有效的防污染措施,提高当前内河船舶防污染工作,重视内河船舶防污染治理,提升内河船舶防污染水平。本文针对京杭运河徐州段船舶防污现状,浅析内河船舶防污染面临的问题,并研究解决对策。     

台湾海峡隧道的环保问题及应对措施

在全球经济高速发展的当今,实现海峡两岸“三通”,是国内外各界积极探索的重要课题,其中海峡隧道的建设,是实现台湾海峡经济区战略发展的关键所在。由于海峡隧道建设工程浩大,交通运输繁忙,在建设和营运期,势必产生诸多环境问题,必须在建设前期予以充分论证,确保经济发展和环境保护双赢。     

公路新旧路基结合部的病害及处治

结合已有的工程经验,总结出路基结合部的主要病害及成因,并从改造方案的选择、基底处理、边坡清理、台阶开挖、路基填料、路堤加筋、路堤的压实度控制、施工工艺等方面提出了处治方法。     

A model and algorithm for multicriteria route-mode choice

Using an idea proposed independently by Quandt and Schneider, the paper declares mode choice to be a special instance of route choice. It describes a (non-logit) model which includes in its route-choice mechanism the decision variables traditionally associated with mode choice. With the assumption that each traveller selects the route which minimizes his own personal linear choice function, it is clear that the routes with a nonzero chance of being picked are only those not dominated by any other path (e.g. are not both costlier and longer than any other path). The precise probability of a route being chosen is just the integral over the appropriate portion of the probability density of the coefficients of the choice function. The integration limits are implied by the amount of each disutility on each of the undominated routes. An algorithm is given which is quite efficient in finding these paths in a large and complex multimodal network.     

浅谈客运索道可编程序控制器的维护

文章介绍了该公司引进奥地利多倍玛尔（Dopplmayr）公司索道可编程序控制器的运行情况，维护经验及其故障诊断、排除方法。