Release Time Scheduling and Hub Location for Next-Day Delivery

Authors:
Hande Yaman;Oya Ekin Karasan;Bahar Y. Kara
Affiliations:
Department of Industrial Engineering, Bilkent University, 06800 Ankara, Turkey;Department of Industrial Engineering, Bilkent University, 06800 Ankara, Turkey;Department of Industrial Engineering, Bilkent University, 06800 Ankara, Turkey
Venue:
Operations Research
Year:
2012

Citing 13
Cited 0

The Latest Arrival Hub Location Problem

Management Science
A branch and cut algorithm for hub location problems with single assignment

Mathematical Programming: Series A and B
Projecting the flow variables for hub location problems

Networks
Adapting polyhedral properties from facility to hub location problems

Discrete Applied Mathematics - The fourth international colloquium on graphs and optimisation (GO-IV)
Solving the uncapacitated hub location problem using genetic algorithms

Computers and Operations Research
A hub covering model for cargo delivery systems

Networks - Special Issue on Multicommodity Flows and Network Design
Capacitated single allocation hub location problem-A bi-criteria approach

Computers and Operations Research
Uncapacitated single and multiple allocation p-hub center problems

Computers and Operations Research
New simple and efficient heuristics for the uncapacitated single allocation hub location problem

Computers and Operations Research
The stochastic p-hub center problem with service-level constraints

Computers and Operations Research
Hub location for time definite transportation

Computers and Operations Research
A 2-phase algorithm for solving the single allocation p-hub center problem

Computers and Operations Research
On mixed-integer zero-one representations for separable lower-semicontinuous piecewise-linear functions

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

Inspired by a real-life problem faced by one of the largest ground-based cargo companies of Turkey, the current study introduces a new facet to the hub location literature. The release time scheduling and hub location problem aims to select a specified number of hubs from a fixed set of demand centers, to allocate each demand center to a hub, and to decide on the release times of trucks from each demand center in such a way that the total amount of cargo guaranteed to be delivered to every potential destination by the next day is not below a threshold and the total routing cost is minimized. The paper introduces integer programming models to solve this problem in the special cases when the cargo uniformly arrives to each demand center during the day and the more realistic pattern of when the cargo arrivals exhibit a piecewise linear form. Several classes of valid inequalities are proposed to strengthen the formulations. Extensions with multiple service levels and discrete sets for release times are also discussed. Computational results show the computational viability of the models under realistic scenarios as well as the validity of the proposed problems in answering several interesting questions from the cargo sector's perspective.