Heuristics for the capacitated modular hub location problem
type: Item
instance of: scholarly article
title: Heuristics for the capacitated modular hub location problem
zbMATH Open document ID: 1391.90382
author: Arild Hoff
author: Juanjo Peiró
author: Rafael Martí
author: Ángel Corberán
published in: Computers \& Operations Research
publication date: 2018-07-11T00:00:00Z
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6901468
zbMATH Keywords: hub location
zbMATH Keywords: modular links
zbMATH Keywords: heuristic algorithms
zbMATH Keywords: memory structures
describes a project that uses: Tabu search
describes a project that uses: OR-Library
describes a project that uses: Scatter Search
MaRDI profile type: Publication
full work available at URL: j.cor.2017.05.004
OpenAlex ID: W2610802549
cites work: Network hub location problems: The state of the art
cites work: The hub location and routing problem
cites work: Networking Policies for Hub-and-Spoke Systems with Application to the Air Transportation System
cites work: A tabu-search based heuristic for the hub covering problem over incomplete hub networks
cites work: Hub Arc Location Problems: Part I—Introduction and Results
cites work: Solving the Hub location problem in telecommunication network design: A local search approach
cites work: Scatter search for the single source capacitated facility location problem
cites work: A Lagrangean heuristic for hub-and-spoke system design with capacity selection and congestion
cites work: Efficient algorithms for the uncapacitated single allocation p-hub median problem
cites work: Q4354785
cites work: A general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem
cites work: GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
cites work: Scatter search. Methodology and implementation in C. With CD-ROM.
cites work: A quadratic integer program for the location of interacting hub facilities
cites work: GRASP for the uncapacitated \(r\)-allocation \(p\)-hub median problem
cites work: GRASP and path relinking for the max-min diversity problem
cites work: ON THE HUB-AND-SPOKE MODEL WITH ARC CAPACITY CONATRAINTS
cites work: An exact algorithm for the modular hub location problem with single assignments
cites work: Star \(p\)-hub median problem with modular arc capacities
cites work: Allocation strategies in hub networks
cites work: Solving the hub location problem with modular link capacities
cites work: The hub location and network design problem with fixed and variable arc costs: formulation and dual-based solution heuristic
DOI: 10.1016/J.COR.2017.05.004
description: scientific article; zbMATH DE number 6901468