A continuous approximation model for time definite many-to-many transportation

被引:17
|
作者
Campbell, James F. [1 ]
机构
[1] Univ Missouri, Coll Business Adm, St Louis, MO 63121 USA
关键词
Continuous approximations; Many-to-many transportation; Time definite transportation; Hub location; FACILITY LOCATION DESIGN; HUB LOCATION; NETWORK DESIGN; TERMINALS; SYSTEM;
D O I
10.1016/j.trb.2013.04.002
中图分类号
F [经济];
学科分类号
02 ;
摘要
Time definite freight transportation carriers provide very reliable scheduled services between origin and destination terminals. They seek to reduce transportation costs through consolidation of shipments at hubs, but are restricted by the high levels of service to provide less circuitous routings. This paper develops a continuous approximation model for time definite transportation from many origins to many destinations. We consider a transportation carrier serving a fixed geographic region in which demand is modeled as a continuous distribution and time definite service levels are imposed by limiting the maximum travel distance via the hub network. Analytical expressions are developed for the optimal number of hubs, hub locations, and transportation costs. Computational results for an analogous discrete demand model are presented to illustrate the behavior observed with the continuous approximation models. (c) 2013 Elsevier Ltd. All rights reserved.
引用
收藏
页码:100 / 112
页数:13
相关论文
共 50 条
  • [1] APPROXIMATE ANALYTIC MODEL OF MANY-TO-MANY DEMAND RESPONSIVE TRANSPORTATION SYSTEMS
    DAGANZO, CF
    TRANSPORTATION RESEARCH, 1978, 12 (05): : 325 - 333
  • [2] CHINA RAILWAY TRANSPORTATION "MANY-TO-MANY" ORGANIZATION REFORM
    Jiang Xiaoguang
    Zhou Changyu
    INNOVATION & SUSTAINABILITY OF MODERN RAILWAY PROCEEDINGS OF ISMR' 2008, 2008, : 446 - 449
  • [3] Many-to-Many Graph Matching: A Continuous Relaxation Approach
    Zaslavskiy, Mikhail
    Bach, Francis
    Vert, Jean-Philippe
    MACHINE LEARNING AND KNOWLEDGE DISCOVERY IN DATABASES, PT III, 2010, 6323 : 515 - 530
  • [4] Tractable Model of Dynamic Many-to-Many Matching
    Peski, Marcin
    AMERICAN ECONOMIC JOURNAL-MICROECONOMICS, 2022, 14 (02) : 1 - 43
  • [5] Many-to-Many Path Planning for Emergency Material Transportation in Dynamic Environment
    Meng, Xiang-Zhi
    Zhou, Hang
    Hu, Xiao-Bing
    2020 IEEE SYMPOSIUM SERIES ON COMPUTATIONAL INTELLIGENCE (SSCI), 2020, : 276 - 280
  • [6] Approximation Algorithms for Many-to-Many Traffic Grooming in Optical WDM Networks
    Saleh, Mohammad A.
    Kamal, Ahmed E.
    IEEE-ACM TRANSACTIONS ON NETWORKING, 2012, 20 (05) : 1527 - 1540
  • [7] Approximation Algorithms for Many-to-Many Traffic Grooming in WDM Mesh Networks
    Saleh, Mohammad A.
    Kamal, Ahmed E.
    2010 PROCEEDINGS IEEE INFOCOM, 2010,
  • [8] Many-to-Many Multilingual Translation Model for Languages of Indonesia
    Wongso, Wilson
    Joyoadikusumo, Ananto
    Buana, Brandon Scott
    Suhartono, Derwin
    IEEE ACCESS, 2023, 11 : 91385 - 91397
  • [9] Inventory-transportation Integrated Optimization Problem in Many-to-many Distribution Network
    Pei, Yingmei
    Ye, Chunming
    Liu, Lihui
    SUSTAINABLE ENVIRONMENT AND TRANSPORTATION, PTS 1-4, 2012, 178-181 : 1965 - +
  • [10] Many-to-Many Pair Trading
    Wang, Yingying
    Li, Xiaodong
    Wu, Pangjing
    Xie, Haoran
    WEB AND BIG DATA, PT I, APWEB-WAIM 2022, 2023, 13421 : 399 - 407