2012Unpublished venueRequires access

The Stability of the Solutions of Optimization Hub-and-Spoke Network Design Problem with Fixed Hub Arc Costs

Kerui Weng

Open publisher page 0 citations

Abstract

Hub-and-Spoke network design problem with fixed hub arc cost has a wide range of applications within the third party logistics, postal services and airline transportation. Current researches concentrated on hub location while this paper em- phasizes the fixed hub arc costs which reflect a fact that the transportation on hub arc must be provided with large-scale vehicles and therefore pay extra fixed costs. This paper constructs a mixed 0-1 integer programming model, and provided a heuristic algorithm based on Lagrangian relaxation. We also extend the problem by adding the route distance constraint which is very important for emergency logistics and express delivery. We solve the extended problem by modifying the original algorithm.

About this research paper

What this paper is about

Hub-and-Spoke network design problem with fixed hub arc cost has a wide range of applications within the third party logistics, postal services and airline transportation. Current researches concentrated on hub location while this paper em- phasizes the fixed hub arc costs which reflect a fact that the transportation on hub arc must be provided with large-scale vehicles and therefore pay extra fixed costs. This paper constructs a mixed 0-1 integer programming model, and provided a heuristic algorithm based on Lagrangian relaxation. We also extend the problem by adding the route distance constraint which is very important for emergency logistics and express delivery. We solve the extended problem by modifying the original algorithm.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Hub-and-Spoke network design problem with fixed hub arc cost has a wide range of applications within the third party logistics, postal services and airline transportation. Current researches concentrated on hub location while this paper em- phasizes the fixed hub arc costs which reflect a fact that the transportation on hub arc must be provided with large-scale vehicles and therefore pay extra fixed costs. This paper constructs a mixed 0-1 integer programming model, and provided a heuristic algorithm based on Lagrangian relaxation. We also extend the problem by adding the route distance constraint which is very important for emergency logistics and express delivery. We solve the extended problem by modifying the original algorithm.

Key concepts: Spoke-hub distribution paradigm, Arc (geometry), Fixed cost, Constraint (computer-aided design), Network planning and design, Mathematical optimization, Lagrangian relaxation, Computer science

Related papers

Back to paper searchBrowse research topicsOriginal source
The Stability of the Solutions of Optimization Hub-and-Spoke Network Design Problem with Fixed Hub Arc Costs — Research Paper | ScholarLens