TITLE

Linearly-Constrained Entropy Maximization Problem with Quadratic Cost and Its Applications to Transportation Planning Problems

AUTHOR(S)
Fang, S. C.; Tsao, H.-S. J.
PUB. DATE
November 1995
SOURCE
Transportation Science;Nov95, Vol. 29 Issue 4, p353
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
Many transportation problems can be formulated as a linearly-constrained convex programming problem whose objective function consists of entropy functions and other cost-related terms. In this paper, we propose an unconstrained convex programming dual approach to solving these problems. In particular, we focus on a class of linearly-constrained entropy maximization problem with quadratic cost, study its Lagrangian dual, and provide a globally convergent algorithm with a quadratic rate of convergence. The theory and algorithm can be readily applied to the trip distribution problem with quadratic cost and many other entropy-based formulations, including the conventional trip distribution problem with linear cost, the entropy-based modal split model, and the decomposed problems of the combined problem of trip distribution and assignment. The efficiency and the robustness of this approach are confirmed by our computational experience.
ACCESSION #
4454292

 

Related Articles

  • A DYNAMIC PROGRAMMING ALGORITHM FOR EMBEDDED MARKOV CHAINS WHEN THE PLANNING HORIZON IS AT INFINITY. de Cani, John S. // Management Science;Jul1964, Vol. 10 Issue 4, p716 

    This paper presents an algorithm for the solution of dynamic programming problems requiring the determination of optimal policies for the control of a special class of stochastic processes when the time horizon of the planning period is at infinity. These processes can be mathematically...

  • Minimax Procedure for a Class of Linear Programs under Uncertainty. Jagannathan, R. // Operations Research;Jan/Feb77, Vol. 25 Issue 1, p173 

    We consider a linear programming problem with random a[sub ij] and b[sub I] elements that have known (finite) mean and variance, but whose distribution functions are otherwise unspecified. A minimax solution of the stochastic programming model is obtained by solving an equivalent deterministic...

  • New optimality cuts for a single-vehicle stochastic routing problem. Hjorring, Curt; Holt, John // Annals of Operations Research;1999, Vol. 86 Issue 1-4, p569 

    In the Vehicle Routing literature, investigations have concentrated on problems in which the customer demands are known precisely. We consider an application in which the demands arc unknown prior to the creation of vehicle routes, but follow some known probability distribution. Because of the...

  • On the effectiveness of set covering formulations for the vehicle routing problem with time windows. Bramel, Julien; Simchi-Levi, David // Operations Research;Mar/Apr97, Vol. 45 Issue 2, p295 

    The Vehicle Routing Problem with Time Windows (VRPTW) is one of the most important problems in distribution and transportation. A classical and recently popular technique that has proven effective for solving these problems is based on formulating them as a set covering problem. The method...

  • Time-Dependent Structural Equations Modeling: A Methodology for Analyzing the Dynamic Attitude-Behavior Relationship. Lyon, Patricia K. // Transportation Science;Nov84, Vol. 18 Issue 4, p395 

    The attitude-behavior relationship is expressed as a set of time- dependent structural equations whose endogenous variables are measures of attitudes (continuous) and behavior (binary). The dynamic aspect of the structure is incorporated in three ways: the equations have a lagged endogenous...

  • THE THEORY OF SEARCH: OPTIMUM DISTRIBUTION OF SEARCH EFFORT. Charnes, A.; Cooper, W. W. // Management Science;Oct58, Vol. 5 Issue 1, p44 

    The article discusses the theory of search. The author attempts to formulate the optimum allocation of search effort as a convex programming problem. By doing so, the author believes the solutions to the problems could be made to be treated by the adjacent extreme point methods of linear...

  • SEPARABLE MARKOVIAN DECISION PROBLEMS. Denardo, Eric V. // Management Science;Mar68, Vol. 14 Issue 7, p451 

    The special structure of a class of Markovian decision problems is exploited to simplify the determination of optimum policies. For certain pairs consisting of a state i and decision k, the cost ci[sub k, sup k] separates (c[sub 1, sup k] = a[sub 1] + b[sub k]), while the transition...

  • Path Preferences and Optimal Paths in Probabilistic Networks. Eiger, Amir; Mirchandani, Pitu B.; Soroush, Hossein // Transportation Science;Feb85, Vol. 19 Issue 1, p75 

    The classical shortest route problem in networks assumes deterministic link weights, and route evaluation by a utility (or cost)function that is linear over path weights. When the environment is stochastic and the "traveler's" utility function for travel attributes is nonlinear, we define...

  • Study on Optimization for Comprehensive Passenger Hub Layout Planning. Hui Hu; Dengdian Xuan; Li Zhu; Dawei Hu // Journal of Convergence Information Technology;May2012, Vol. 7 Issue 8, p120 

    As an important section of the comprehensive transportation system, the comprehensive passenger hub is an essential area to jointly connect urban traffic and city transportation. Based on the traditional four-stage method of traffic planning, a two-stage hub layout planning model with multiple...

Share

Read the Article

Courtesy of THE LIBRARY OF VIRGINIA

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics