GASUB: finding global optima to discrete location problems by a genetic-like algorithm

DOI10.1007/S10898-006-9076-2zbMATH Open1181.90168OpenAlexW1999998135MaRDI QIDQ2460125FDOQ2460125

Authors B. Pelegrin, Juana L. Redondo, P. Fernández, I. García, Pilar M. Ortigosa 

Publication date 14 November 2007

Published in Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10898-006-9076-2

zbMATH Keywords

combinatorial optimizationstochastic algorithmsdiscrete location problemsmultimodal genetic algorithms

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Recommendations

• An efficient genetic algorithm for the \(p\)-median problem
• Improving solution of discrete competitive facility location problems
• On the use of genetic algorithms to solve location problems
• Comparison of genetic algorithms, random restart and two-opt switching for solving large location-allocation problems
• New genetic algorithms based approaches to continuous \(p\)-median problem

Cites Work

• scientific article; zbMATH DE number 1803760 (Why is no real title available?)
• scientific article; zbMATH DE number 4209907 (Why is no real title available?)
• scientific article; zbMATH DE number 1138446 (Why is no real title available?)
• scientific article; zbMATH DE number 821272 (Why is no real title available?)
• A discrete long-term location--price problem under the assumption of discriminatory pricing: formulations and parametric analysis
• An efficient genetic algorithm for the \(p\)-median problem
• Competition of Firms: Discriminatory Pricing and Location
• Competitive Location Models: A Framework and Bibliography
• Competitive location on networks under delivered pricing
• Discretization and resolution of the \((r| X_ p)\)-medianoid problem involving quality criteria.
• Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
• Heuristic concentration: Two stage solution construction
• Locating multiple competitive facilities: Spatial interaction models with variable expenditures
• Location analysis: a synthesis and survey
• On locating new facilities in a competitive environment
• On price competition in location-price models with spatially separated makets
• Reliability and performance of UEGO, a clustering-based global optimizer

Cited In (5)

• Fuzzy logic based algorithms for maximum covering location problems
• A discrete competitive facility location model with proportional and binary rules sequentially applied
• GASUB
• Population-based algorithm for discrete facility location with ranking of candidate locations
• Customer allocation in maximum capture problems

Uses Software

• Isolde
• OR-Library
• XPRESS
• SITATION
• MOD-DIST
• MENU-OKF

This page was built for publication: GASUB: finding global optima to discrete location problems by a genetic-like algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2460125)