Discretization and Validation of the Continuum Approximation Scheme for Terminal System Design

Yanfeng Ouyang; Daganzo, Carlos F.
February 2006
Transportation Science;Feb2006, Vol. 40 Issue 1, p89
Academic Journal
This paper proposes an algorithm that automatically translates the "continuum approximation" (CA) recipes for location problems into discrete designs. It applies to terminal systems, but can also be used for other logistics problems. The study also systematically compares the logistics costs predicted by the CA approach with the actual costs for discrete designs obtained with the automated procedure. The predictions are quite accurate. The paper also gives conditions under which the discrete solution has a small optimality gap.


Related Articles

  • Automated Knowledge Based Filter Synthesis Using Gegenbauer Approximation and Optimization of Pole-Q Factors. Lutovac, M.; Pavlovic, V. // Electronics & Electrical Engineering;2013, Vol. 19 Issue 9, p97 

    This work gives an original algorithm that combines design and synthesis step with the optimization for targeted implementation technology. The approximation step is based on Gegenbauer polynomial and the corresponding cost function. The proposed methodology is an example of usage of computer...

  • Improving Mutual Coherence with Non-Uniform Discretization of Orthogonal Function for Image Denoising Application. Nozari, Hani; Siamy, Alireza // Journal of Signal & Information Processing;Aug2011, Vol. 2 Issue 3, p184 

    This paper presented a novel method on designing redundant dictionary from known orthogonal functions. Usual way of discretization of continuous functions is uniform sampling. Our experiments show that dividing the function definition interval with non-uniform measure makes the redundant...

  • Approximation of continuous functions by broken lines with constraints on the angles between adjacent segments. Baraboshkin, N. // Mathematical Notes;Nov2013, Vol. 94 Issue 5/6, p843 

    The problem of best uniform approximation of a function continuous on an interval by piecewise linear continuous functions with fixed nodes and constraints on the angle between adjacent segments is considered.

  • Efficient Complex Continuous-Time IIR Filter Design via Generalized Vector Fitting. Chi-Un Lei; Chung-Man Cheung; Hing-Kit Kwan; Ngai Wong // International MultiConference of Engineers & Computer Scientists;2008, p1393 

    We present a novel model identification technique for designing complex infinite-impulse- response (IIR) continuous-time filters through generalizing the Vector Fitting (VF) algorithm, which is extensively used for continuous-time frequency-domain rational approximation to symmetric functions,...

  • SVM-Based Synthetic Fingerprint Discrimination Algorithm and Quantitative Optimization Strategy. Chen, Suhang; Chang, Sheng; Huang, Qijun; He, Jin; Wang, Hao; Huang, Qiangui // PLoS ONE;Oct2014, Vol. 9 Issue 10, p1 

    Synthetic fingerprints are a potential threat to automatic fingerprint identification systems (AFISs). In this paper, we propose an algorithm to discriminate synthetic fingerprints from real ones. First, four typical characteristic factors—the ridge distance features, global gray...

  • A 2-Approximation Algorithm for Stochastic Inventory Control Models with Lost Sales. Levi, Retsef; Janakiraman, Ganesh; Nagarajan, Mahesh // Mathematics of Operations Research;May2008, Vol. 33 Issue 2, p351 

    In this paper, we describe the first computationally efficient policies for stochastic inventory models with lost sales and replenishment lead times that admit worst-case performance guarantees. In particular, we introduce dual-balancing policies for lost-sales models that are conceptually...

  • A Comparison of Some Explicit Methods for Fractional Differential Equations. Garrappa, Roberto // AIP Conference Proceedings;9/15/2008, Vol. 1048 Issue 1, p217 

    This work is concerned with a comparison of some explicit methods for differential equations of fractional order. Computational cost, accuracy and stability properties are investigated. We show how the use of a modified algorithm based on a trapezoidal approximation can improve the efficiency of...

  • A Wide Approximate Continuity. Lahiri, Indrajit // Vietnam Journal of Mathematics;Sep2002, Vol. 30 Issue 3, p271 

    Introducing the notion of widely approximate continuous functions we study some basic properties of such functions.

  • The continuum approximation in nucleation theory. Wu, David T. // Journal of Chemical Physics;8/1/1992, Vol. 97 Issue 3, p1922 

    The continuum approximation in nucleation theory is reconsidered. It is shown that a minor change in indexing the discrete flux leads naturally to an approximation which is both simple and accurate. More complicated schemes are introduced using the formalism of spectral density (weighting)...


Read the Article


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

Try another library?
Sign out of this library

Other Topics