IDEAS home Printed from https://ideas.repec.org/a/kap/netspa/v10y2010i4p509-523.html
   My bibliography  Save this article

A Heuristic Algorithm for Hierarchical Hub-and-spoke Network of Time-definite Common Carrier Operation Planning Problem

Author

Listed:
  • Sheu Chen

Abstract

No abstract is available for this item.

Suggested Citation

  • Sheu Chen, 2010. "A Heuristic Algorithm for Hierarchical Hub-and-spoke Network of Time-definite Common Carrier Operation Planning Problem," Networks and Spatial Economics, Springer, vol. 10(4), pages 509-523, December.
    • Handle: RePEc:kap:netspa:v:10:y:2010:i:4:p:509-523
    DOI: 10.1007/s11067-008-9070-y
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s11067-008-9070-y
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s11067-008-9070-y?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. Michel Gendreau & Alain Hertz & Gilbert Laporte, 1994. "A Tabu Search Heuristic for the Vehicle Routing Problem," Management Science, INFORMS, vol. 40(10), pages 1276-1290, October.
    2. Fred Glover, 1989. "Tabu Search---Part I," INFORMS Journal on Computing, INFORMS, vol. 1(3), pages 190-206, August.
    3. Kuby, Michael J. & Gray, Robert Gordon, 1993. "The hub network design problem with stopovers and feeders: The case of Federal Express," Transportation Research Part A: Policy and Practice, Elsevier, vol. 27(1), pages 1-12, January.
    4. Brandao, Jose & Mercer, Alan, 1997. "A tabu search algorithm for the multi-trip vehicle routing and scheduling problem," European Journal of Operational Research, Elsevier, vol. 100(1), pages 180-191, July.
    5. Laura A. Schintler & Sean P. Gorman & Aura Reggiani & Roberto Patuelli & Andy Gillespie & Peter Nijkamp & Jonathan Rutherford, 2004. "Complex Network Phenomena in Telecommunication Systems," Tinbergen Institute Discussion Papers 04-118/3, Tinbergen Institute.
    6. Amberg, Anita & Domschke, Wolfgang & Vo[ss], Stefan, 2000. "Multiple center capacitated arc routing problems: A tabu search algorithm using capacitated trees," European Journal of Operational Research, Elsevier, vol. 124(2), pages 360-376, July.
    7. Roberto Patuelli & Aura Reggiani & Sean Gorman & Peter Nijkamp & Franz-Josef Bade, 2007. "Network Analysis of Commuting Flows: A Comparative Static Approach to German Data," Networks and Spatial Economics, Springer, vol. 7(4), pages 315-331, December.
    8. Nowicki, Eugeniusz, 1999. "The permutation flow shop with buffers: A tabu search approach," European Journal of Operational Research, Elsevier, vol. 116(1), pages 205-219, July.
    9. Skorin-Kapov, Darko & Skorin-Kapov, Jadranka, 1994. "On tabu search for the location of interacting hub facilities," European Journal of Operational Research, Elsevier, vol. 73(3), pages 502-509, March.
    10. Alain Hertz & Gilbert Laporte & Michel Mittaz, 2000. "A Tabu Search Heuristic for the Capacitated arc Routing Problem," Operations Research, INFORMS, vol. 48(1), pages 129-135, February.
    11. Lin, Cheng-Chang & Chen, Sheu-Hua, 2004. "The hierarchical network design problem for time-definite express common carriers," Transportation Research Part B: Methodological, Elsevier, vol. 38(3), pages 271-283, March.
    12. Crainic, Teodor Gabriel & Laporte, Gilbert, 1997. "Planning models for freight transportation," European Journal of Operational Research, Elsevier, vol. 97(3), pages 409-438, March.
    13. S Lozano & B Adenso-Díaz & I Eguia & L Onieva, 1999. "A one-step tabu search algorithm for manufacturing cell design," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 50(5), pages 509-516, May.
    14. Groothedde, Bas & Ruijgrok, Cees & Tavasszy, Lóri, 2005. "Towards collaborative, intermodal hub networks: A case study in the fast moving consumer goods market," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 41(6), pages 567-583, November.
    15. Anthony Chen & Chao Yang & Sirisak Kongsomsaksakul & Ming Lee, 2007. "Network-based Accessibility Measures for Vulnerability Analysis of Degradable Transportation Networks," Networks and Spatial Economics, Springer, vol. 7(3), pages 241-256, September.
    16. Lin, Cheng-Chang, 2001. "The freight routing problem of time-definite freight delivery common carriers," Transportation Research Part B: Methodological, Elsevier, vol. 35(6), pages 525-547, July.
    17. Amberg, Anita & Domschke, Wolfgang & Voß, S., 2000. "Multiple center capacitated arc routing problems: a tabu search algorithm using capacitated trees," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 15855, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Esmizadeh, Yalda & Bashiri, Mahdi & Jahani, Hamed & Almada-Lobo, Bernardo, 2021. "Cold chain management in hierarchical operational hub networks," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 147(C).
    2. Meltem Peker & Bahar Y. Kara & James F. Campbell & Sibel A. Alumur, 2016. "Spatial Analysis of Single Allocation Hub Location Problems," Networks and Spatial Economics, Springer, vol. 16(4), pages 1075-1101, December.

    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. Sumanta Basu & Ghosh, Diptesh, 2008. "A review of the Tabu Search Literature on Traveling Salesman Problems," IIMA Working Papers WP2008-10-01, Indian Institute of Management Ahmedabad, Research and Publication Department.
    2. Lin, Cheng-Chang, 2010. "The integrated secondary route network design model in the hierarchical hub-and-spoke network for dual express services," International Journal of Production Economics, Elsevier, vol. 123(1), pages 20-30, January.
    3. Beullens, Patrick & Muyldermans, Luc & Cattrysse, Dirk & Van Oudheusden, Dirk, 2003. "A guided local search heuristic for the capacitated arc routing problem," European Journal of Operational Research, Elsevier, vol. 147(3), pages 629-643, June.
    4. Olli Bräysy & Michel Gendreau, 2002. "Tabu Search heuristics for the Vehicle Routing Problem with Time Windows," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 10(2), pages 211-237, December.
    5. Van Woensel, T. & Kerbache, L. & Peremans, H. & Vandaele, N., 2008. "Vehicle routing with dynamic travel times: A queueing approach," European Journal of Operational Research, Elsevier, vol. 186(3), pages 990-1007, May.
    6. Chu, Feng & Labadi, Nacima & Prins, Christian, 2006. "A Scatter Search for the periodic capacitated arc routing problem," European Journal of Operational Research, Elsevier, vol. 169(2), pages 586-605, March.
    7. Jesica Armas & Peter Keenan & Angel A. Juan & Seán McGarraghy, 2019. "Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics," Annals of Operations Research, Springer, vol. 273(1), pages 135-162, February.
    8. Sarah Root & Amy Cohn, 2008. "A novel modeling approach for express package carrier planning," Naval Research Logistics (NRL), John Wiley & Sons, vol. 55(7), pages 670-683, October.
    9. Ishfaq, Rafay & Sox, Charles R., 2011. "Hub location-allocation in intermodal logistic networks," European Journal of Operational Research, Elsevier, vol. 210(2), pages 213-230, April.
    10. Tan, K.C. & Chew, Y.H. & Lee, L.H., 2006. "A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems," European Journal of Operational Research, Elsevier, vol. 172(3), pages 855-885, August.
    11. Lin, Cheng-Chang & Lee, Shwu-Chiou, 2010. "The competition game on hub network design," Transportation Research Part B: Methodological, Elsevier, vol. 44(4), pages 618-629, May.
    12. LECLUYSE, C. & VAN WOENSEL, Tom & PEREMANS, Herbert, 2007. "Vehicle routing with stochastic time-dependent travel times," Working Papers 2007018, University of Antwerp, Faculty of Business and Economics.
    13. Chen, Jeng-Fung, 2007. "A hybrid heuristic for the uncapacitated single allocation hub location problem," Omega, Elsevier, vol. 35(2), pages 211-220, April.
    14. Alumur, Sibel & Kara, Bahar Y., 2008. "Network hub location problems: The state of the art," European Journal of Operational Research, Elsevier, vol. 190(1), pages 1-21, October.
    15. Meuffels, W.J.M., 2015. "The design of road and air networks for express service providers," Other publications TiSEM d3266cb8-bc55-41be-adc7-4, Tilburg University, School of Economics and Management.
    16. Lai, David S.W. & Caliskan Demirag, Ozgun & Leung, Janny M.Y., 2016. "A tabu search heuristic for the heterogeneous vehicle routing problem on a multigraph," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 86(C), pages 32-52.
    17. Hande Yaman & Oya Ekin Karasan & Bahar Y. Kara, 2012. "Release Time Scheduling and Hub Location for Next-Day Delivery," Operations Research, INFORMS, vol. 60(4), pages 906-917, August.
    18. Marianov, Vladimir & Serra, Daniel & ReVelle, Charles, 1999. "Location of hubs in a competitive environment," European Journal of Operational Research, Elsevier, vol. 114(2), pages 363-371, April.
    19. James F. Campbell & Morton E. O'Kelly, 2012. "Twenty-Five Years of Hub Location Research," Transportation Science, INFORMS, vol. 46(2), pages 153-169, May.
    20. Mohamad Darayi & Kash Barker & Joost R. Santos, 2017. "Component Importance Measures for Multi-Industry Vulnerability of a Freight Transportation Network," Networks and Spatial Economics, Springer, vol. 17(4), pages 1111-1136, December.

    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:kap:netspa:v:10:y:2010:i:4:p:509-523. 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.