Enumeration and Search Procedures for a Hub Location Problem with Economies of Scale
Explore this paper's citation graph
Summary
It is shown that, for a fixed set of hubs, the FLOWLOC model can be solved using the classic Uncapacitated Facility Location Problem (UFLP), which motivates an optimal enumeration procedure for the FLowLOC model, as well as some search heuristics that are based upon tabu search and greedy random adaptive search procedures (GRASP).
- Type
- article
- Published
- 2002-02-01
- Cited by
- 78
- References
- 22
- OpenAlex
- https://openalex.org/W17344140
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:29875373
Keywords
Heuristics, Mathematical optimization, Computer science, Tabu search, Theory of computation
References
- Location on Networks: A Survey. Part I: The p-Center and p-Median Problems
- Hub location with flow economies of scale
- HUB NETWORK DESIGN WITH SINGLE AND MULTIPLE ALLOCATION: A COMPUTATIONAL STUDY
- Location and allocation for distribution systems with transshipments and transportion economies of scale
- Style and principles
- Tight linear programming relaxations of uncapacitated p-hub median problems
- On tabu search for the location of interacting hub facilities
- Avoiding local optima in thep-hub location problem using tabu search and GRASP
- Solving a Freight Transport Problem Using Facility Location Techniques
- Integer programming formulations of discrete hub location problems
- Exact and heuristic algorithms for the uncapacitated multiple allocation p-hub median problem
- A quadratic integer program for the location of interacting hub facilities
- Efficient solution procedure and reduced size formulations for p-hub location problems
- HUB LOCATION IN BACKBONE/TRIBUTARY NETWORK DESIGN: A REVIEW
- Tabu Search - Part II
- An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems
- Hub Location and the p-Hub Median Problem
- A Dual-Based Procedure for Uncapacitated Facility Location
- THE HUB NETWORK DESIGN PROBLEM: A REVIEW AND SYNTHESIS.
- Tabu Search
Cited by
- Development of a Single Allocation Hub Network Design Model with Transportation Economies of Scale
- An improved MIP heuristic for the intermodal hub location problem
- Hub Location and Network Design with Fixed and Variable Costs
- GRASP: Procedimientos de búsquedas miopes aleatorizados y adaptativos
- Joint Design and Pricing of Intermodal Port - Hinterland Network Services: Considering Economies of Scale and Service Time Constraints
- The technological model of operating area by the combined transport
- Integration of AHP-QFD for selecting facility location
- Hubbing and routing in postal delivery systems
- Efficient location and allocation strategies for undesirable facilities considering their fundamental properties
- Successive smoothing algorithm for solving large-scale optimization models with fixed cost
- Benders decomposition for the uncapacitated multiple allocation hub location problem
- Capacitated single allocation hub location problem - A bi-criteria approach
- An improved Benders decomposition algorithm for the tree of hubs location problem
- Hub-and-spoke network design with congestion
- Supply chain design considering economies of scale and transport frequencies
- LOGISTICS NETWORK DESIGN WITH SUPPLIER CONSOLIDATION HUBS AND MULTIPLE SHIPMENT OPTIONS
- Metaheuristics for optimization problems in computer communications
- Single Allocation Hub Network Design Model with Consolidated Traffic Flows
- Hub location problems: A review of models, classification, solution techniques, and applications
- A hub location inventory model for bicycle sharing system design: Formulation and solution
Related papers
- INITIAL SEGMENTS OF THE Σ _2^0 ENUMERATION DEGREES
- Enumeration of Enumeration Algorithms
- Enumeration Schemes for Restricted Permutations
- A local search template (extended abstract)
- Some local search algorithms for no-wait flow-shop problem with makespan criterion
- Metaheuristics for High School Timetabling
- A comparison of tabu search and local search methods for single machine scheduling with ready time