| Attributs | Valeurs |
|---|
| type
| |
| Is Part Of
| |
| Subject
| |
| Title
| - Hub location problem in round-trip service applications
|
| Date
| |
| has manifestation of work
| |
| related by
| |
| Author
| |
| Abstract
| - In this paper, we introduce a new hub-and-spoke structure for service networks based on round-trips as practiced by some transport service providers. This problem is a variant of Uncapacitated Hub Location Problem wherein the spoke nodes allocated to a hub node form round-trips (cycles) starting from and ending to the hub node. This problem is motivated by two real-life practices in logistics wherein runaway nodes and runaway connections with their associated economies of scale were foreseen to increase redundancy in the network. We propose a mixed integer linear programming mathematical model with exponential number of constraints. In addition to the separation routines for separating from among exponential constraints, we propose a hyper-heuristic based on reinforcement learning and its comparable counterpart as a variable neighborhood search. Our extensive computational experiments confirm efficiency of the proposed approaches.
|
| article type
| |
| publisher identifier
| |
| Date Copyrighted
| |
| Rights
| - © EDP Sciences, ROADEF, SMAI 2021
|
| Rights Holder
| - EDP Sciences, ROADEF, SMAI
|
| is part of this journal
| |
| is primary topic
of | |
