The capacitated single-allocation p-hub location routing problem: a Lagrangian relaxation and a hyper-heuristic approach
The capacitated single-allocation p-hub location routing problem: a Lagrangian relaxation and a hyper-heuristic approach
A variant of the hub location routing problem studied in this work, which is the problem of locating a set of hub nodes, is establishing the hub-level network and allocating the spoke nodes to the hub nodes. As a particular property of this problem, each cluster of spoke nodes allocated to a hub constitutes a directed route that starts from the hub, visits all the spokes in the same cluster, and terminates to the same hub. We propose a hybrid of hyper-heuristic and a relax-and-cut solution method, which includes cooperation among several low-level heuristics governed and controlled by a learning mechanism. This hybridization provides a mechanism in which the obtained dual information through the Lagrangian relaxation (bundle) method being utilized to guide the local searches for constructing/improving feasible solutions. Several classes of valid inequalities as well as efficient separation routings are also proposed for being used within the relax-and-cut approach. Our extensive computational experiments confirm the efficiency of this solution method in terms of quality as well as computational time.
Hub location problem, Hyper-heuristic, Meta-heuristic, Reinforcement learning
1-35
Danach, Kassem
1124ab12-fdf5-458a-ae61-1ca06f5ca829
Gelareh, Shahin
a21719bb-d942-4838-9945-533034bfac77
Neamatian Monemi, Rahimeh
b18838f0-854b-4c2c-9100-c50c531e5666
Danach, Kassem
1124ab12-fdf5-458a-ae61-1ca06f5ca829
Gelareh, Shahin
a21719bb-d942-4838-9945-533034bfac77
Neamatian Monemi, Rahimeh
b18838f0-854b-4c2c-9100-c50c531e5666
Danach, Kassem, Gelareh, Shahin and Neamatian Monemi, Rahimeh
(2019)
The capacitated single-allocation p-hub location routing problem: a Lagrangian relaxation and a hyper-heuristic approach.
EURO Journal on Transportation and Logistics, .
(doi:10.1007/s13676-019-00141-w).
Abstract
A variant of the hub location routing problem studied in this work, which is the problem of locating a set of hub nodes, is establishing the hub-level network and allocating the spoke nodes to the hub nodes. As a particular property of this problem, each cluster of spoke nodes allocated to a hub constitutes a directed route that starts from the hub, visits all the spokes in the same cluster, and terminates to the same hub. We propose a hybrid of hyper-heuristic and a relax-and-cut solution method, which includes cooperation among several low-level heuristics governed and controlled by a learning mechanism. This hybridization provides a mechanism in which the obtained dual information through the Lagrangian relaxation (bundle) method being utilized to guide the local searches for constructing/improving feasible solutions. Several classes of valid inequalities as well as efficient separation routings are also proposed for being used within the relax-and-cut approach. Our extensive computational experiments confirm the efficiency of this solution method in terms of quality as well as computational time.
Text
Danach2019_Article_TheCaPacitatedSingle-allocatio
- Version of Record
More information
Accepted/In Press date: 10 April 2019
e-pub ahead of print date: 2 May 2019
Keywords:
Hub location problem, Hyper-heuristic, Meta-heuristic, Reinforcement learning
Identifiers
Local EPrints ID: 431672
URI: http://eprints.soton.ac.uk/id/eprint/431672
ISSN: 2192-4376
PURE UUID: 6b6d951d-bc60-43e4-badd-19d7c05e6a0b
Catalogue record
Date deposited: 13 Jun 2019 16:30
Last modified: 16 Mar 2024 02:18
Export record
Altmetrics
Contributors
Author:
Kassem Danach
Author:
Shahin Gelareh
Author:
Rahimeh Neamatian Monemi
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics