IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v144y2006i1p153-16010.1007-s10479-006-0010-2.html
   My bibliography  Save this article

A note on asymptotic formulae for one-dimensional network flow problems

Author

Listed:
  • Carlos Daganzo
  • Karen Smilowitz

Abstract

This note develops asymptotic formulae for single-commodity network flow problems with random inputs. The transportation linear programming problem (TLP) where N points lie in a region of R 1 is one example. It is found that the average distance traveled by an item in the TLP increases with N 1/2 ; i.e., the unit cost is unbounded when N and the length of the region are increased in a fixed ratio. Further, the optimum distance does not converge in probability to the average value. These one-dimensional results are a useful stepping stone toward a network theory for two and higher dimensions. Copyright Springer Science+Business Media, LLC 2006

Suggested Citation

  • Carlos Daganzo & Karen Smilowitz, 2006. "A note on asymptotic formulae for one-dimensional network flow problems," Annals of Operations Research, Springer, vol. 144(1), pages 153-160, April.
  • Handle: RePEc:spr:annopr:v:144:y:2006:i:1:p:153-160:10.1007/s10479-006-0010-2
    DOI: 10.1007/s10479-006-0010-2
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-006-0010-2
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1007/s10479-006-0010-2?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Daganzo, Carlos F & Smilowitz, Karen R, 2000. "Asymptotic Approximations for the Transportation LP and Other Scalable Network Problems," University of California Transportation Center, Working Papers qt7wb1g4z7, University of California Transportation Center.
    2. Newell, Gordon F. & Daganzo, Carlos F., 1986. "Design of multiple-vehicle delivery tours--I a ring-radial network," Transportation Research Part B: Methodological, Elsevier, vol. 20(5), pages 345-363, October.
    3. Daganzo, Carlos F. & Smilowitz, Karen R., 2000. "Asymptotic Approximations for the Transportation LP and Other Scalable Network Problems," Institute of Transportation Studies, Research Reports, Working Papers, Proceedings qt3dn2j66w, Institute of Transportation Studies, UC Berkeley.
    4. Daganzo, Carlos F., 1984. "The length of tours in zones of different shapes," Transportation Research Part B: Methodological, Elsevier, vol. 18(2), pages 135-145, April.
    5. Newell, Gordon F. & Daganzo, Carlos F., 1986. "Design of multiple vehicle delivery tours--II other metrics," Transportation Research Part B: Methodological, Elsevier, vol. 20(5), pages 365-376, October.
    6. M. Haimovich & A. H. G. Rinnooy Kan, 1985. "Bounds and Heuristics for Capacitated Routing Problems," Mathematics of Operations Research, INFORMS, vol. 10(4), pages 527-542, November.
    7. Richard M. Karp, 1977. "Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane," Mathematics of Operations Research, INFORMS, vol. 2(3), pages 209-224, August.
    8. Newell, G. F., 1986. "Design of multiple-vehicle delivery tours--III valuable goods," Transportation Research Part B: Methodological, Elsevier, vol. 20(5), pages 377-390, October.
    9. Carlos F. Daganzo, 1984. "The Distance Traveled to Visit N Points with a Maximum of C Stops per Vehicle: An Analytic Model and an Application," Transportation Science, INFORMS, vol. 18(4), pages 331-350, November.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Carlos F. Daganzo & Karen R. Smilowitz, 2004. "Bounds and Approximations for the Transportation Problem of Linear Programming and Other Scalable Network Problems," Transportation Science, INFORMS, vol. 38(3), pages 343-356, August.
    2. Langevin, André & Mbaraga, Pontien & Campbell, James F., 1996. "Continuous approximation models in freight distribution: An overview," Transportation Research Part B: Methodological, Elsevier, vol. 30(3), pages 163-188, June.
    3. Lei, Chao & Ouyang, Yanfeng, 2018. "Continuous approximation for demand balancing in solving large-scale one-commodity pickup and delivery problems," Transportation Research Part B: Methodological, Elsevier, vol. 109(C), pages 90-109.
    4. Ouyang, Yanfeng, 2007. "Design of vehicle routing zones for large-scale distribution systems," Transportation Research Part B: Methodological, Elsevier, vol. 41(10), pages 1079-1093, December.
    5. Merchán, Daniel & Winkenbach, Matthias & Snoeck, André, 2020. "Quantifying the impact of urban road networks on the efficiency of local trips," Transportation Research Part A: Policy and Practice, Elsevier, vol. 135(C), pages 38-62.
    6. Estrada, Miquel & Roca-Riu, Mireia, 2017. "Stakeholder’s profitability of carrier-led consolidation strategies in urban goods distribution," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 104(C), pages 165-188.
    7. Bergmann, Felix M. & Wagner, Stephan M. & Winkenbach, Matthias, 2020. "Integrating first-mile pickup and last-mile delivery on shared vehicle routes for efficient urban e-commerce distribution," Transportation Research Part B: Methodological, Elsevier, vol. 131(C), pages 26-62.
    8. Sungwon Lee & Taesung Hwang, 2018. "Estimating Emissions from Regional Freight Delivery under Different Urban Development Scenarios," Sustainability, MDPI, vol. 10(4), pages 1-14, April.
    9. Daganzo, Carlos F. & Smilowitz, Karen R., 2000. "Asymptotic Approximations for the Transportation LP and Other Scalable Network Problems," Institute of Transportation Studies, Research Reports, Working Papers, Proceedings qt3dn2j66w, Institute of Transportation Studies, UC Berkeley.
    10. Lei, Chao & Zhang, Qian & Ouyang, Yanfeng, 2017. "Planning of parking enforcement patrol considering drivers’ parking payment behavior," Transportation Research Part B: Methodological, Elsevier, vol. 106(C), pages 375-392.
    11. Banerjee, Dipayan & Erera, Alan L. & Stroh, Alexander M. & Toriello, Alejandro, 2023. "Who has access to e-commerce and when? Time-varying service regions in same-day delivery," Transportation Research Part B: Methodological, Elsevier, vol. 170(C), pages 148-168.
    12. Daganzo, Carlos F & Smilowitz, Karen R, 2000. "Asymptotic Approximations for the Transportation LP and Other Scalable Network Problems," University of California Transportation Center, Working Papers qt7wb1g4z7, University of California Transportation Center.
    13. Koç, Çağrı & Bektaş, Tolga & Jabali, Ola & Laporte, Gilbert, 2016. "Thirty years of heterogeneous vehicle routing," European Journal of Operational Research, Elsevier, vol. 249(1), pages 1-21.
    14. Anna Franceschetti & Ola Jabali & Gilbert Laporte, 2017. "Continuous approximation models in freight distribution management," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 25(3), pages 413-433, October.
    15. Franceschetti, Anna & Honhon, Dorothée & Laporte, Gilbert & Woensel, Tom Van & Fransoo, Jan C., 2017. "Strategic fleet planning for city logistics," Transportation Research Part B: Methodological, Elsevier, vol. 95(C), pages 19-40.
    16. Novaes, Antonio G. N. & Graciolli, Odacir D., 1999. "Designing multi-vehicle delivery tours in a grid-cell format," European Journal of Operational Research, Elsevier, vol. 119(3), pages 613-634, December.
    17. Campbell, James F., 1995. "Using small trucks to circumvent large truck restrictions: Impacts on truck emissions and performance measures," Transportation Research Part A: Policy and Practice, Elsevier, vol. 29(6), pages 445-458, November.
    18. Geunes, Joseph & Shen, Zuo-Jun Max & Emir, Akin, 2007. "Planning and approximation models for delivery route based services with price-sensitive demands," European Journal of Operational Research, Elsevier, vol. 183(1), pages 460-471, November.
    19. Osorio, Jesus & Lei, Chao & Ouyang, Yanfeng, 2021. "Optimal rebalancing and on-board charging of shared electric scooters," Transportation Research Part B: Methodological, Elsevier, vol. 147(C), pages 197-219.
    20. Bertazzi, Luca & Speranza, Maria Grazia & Ukovich, Walter, 1997. "Minimization of logistic costs with given frequencies," Transportation Research Part B: Methodological, Elsevier, vol. 31(4), pages 327-340, August.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:144:y:2006:i:1:p:153-160:10.1007/s10479-006-0010-2. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.