613. Time-dependent decisions in hub location and routing
Invited abstract in session MA-15: Applications to Logistics and Supply Chain Management, stream Combinatorial Optimization.
Monday, 8:30-10:00Room: Esther Simpson 1.08
Authors (first author is the speaker)
| 1. | Francisco Saldanha-da-Gama
|
| Sheffield University Management School | |
| 2. | Afaf ALOULLAL
|
| Université Polytechnique Hauts-de-France | |
| 3. | Raca Todosijevic
|
| Mathematical Institute of the Serbian Academy of Sciences and Arts |
Abstract
This paper investigates the relevance of time-dependent decisions in hub-location routing problems. A multi-period planning horizon is considered during which the system is to be phased in. In addition to hub location, hub network decisions are also considered. The origin-destination flows are assumed to be time-dependent as well as the costs underlying the problem which include, setup costs for hubs and hub edges and variable operational costs at the hubs. An optimization model is discussed for the problem. For small instances, it can be solved up to proven optimality using a general-purpose solver. For larger instances, a four-phase matheuristic combining principles of relax-and-fix, variable neighborhood descent and local branching schemes is proposed. Two variants of the algorithm are discussed. The model and proposed procedure are tested using data generated by extending existing hub location instances to our problem. The results are analyzed. The major conclusion to draw is that by capturing time in the decision-making process, one may find solutions that better hedge against parameter changes throughout time. Furthermore, the overall procedure presented in this paper is quite general in the sense that it can be easily adapted to other multi-period decision making problems and different objective functions.
Keywords
- Combinatorial Optimization
- Network Design
- Location
Status: accepted
Back to the list of papers