Bi-level programming model and hybrid genetic algorithm for flow interception problem with customer choice
DOI10.1016/J.CAMWA.2008.10.035zbMATH Open1186.90107OpenAlexW2165383819MaRDI QIDQ971769FDOQ971769
Authors: Jun Yang, Min Zhang, Bo He, Chao Yang 
Publication date: 16 May 2010
Published in: Computers & Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.camwa.2008.10.035
Recommendations
- Generalized flow-interception facility location models with probabilistic customer flows
- Flow intercepting facility location: Problems, models and heuristics
- Locating flow-intercepting facilities: New approaches and results
- A generalized model for locating facilities on a network with flow-based demand
- Location and design decisions of facilities in a distribution system with elastic customer demand
Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59) Fuzzy and other nonstochastic uncertainty mathematical programming (90C70) Discrete location and assignment (90B80)
Cites Work
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
- New Branch-and-Bound Rules for Linear Bilevel Programming
- Stackelberg-Nash equilibrium for multilevel programming with multiple followers using genetic algorithms
- Theory and practice of uncertain programming
- Title not available (Why is that?)
- The Location of Emergency Service Facilities
- Uncertainty theory
- The Mixed Integer Linear Bilevel Programming Problem
- Optimal Location of Discretionary Service Facilities
- Locating Discretionary Service Facilities, II: Maximizing Market Size, Minimizing Inconvenience
- Algorithms for a facility location problem with stochastic customer demand and immobile servers
- Applying the flow-capturing location-allocation model to an authentic network: Edmonton, Canada
- On the Stackelberg strategy in nonzero-sum games
- Title not available (Why is that?)
- Bilevel programming: a survey
- A probabilistic minimax location problem on the plane
- A hybrid tabu-ascent algorithm for the linear bilevel programming problem
- Solving the competitive discretionary service facility location problem
- A competitive facility location problem on a tree network with stochastic weights.
- Single- and multi-objective defensive location problems on a network
- Facility location-allocation problem in random fuzzy environment: using \((\alpha,\beta )\)-cost minimization model under the Hurewicz criterion
- Locating flow-intercepting facilities: New approaches and results
Cited In (9)
- Entropy based solid transportation problems with discounted unit costs under fuzzy random environment
- A bi-level programming model for location of commodity exchange markets
- Integer linear programming model for multidimensional two-way number partitioning problem
- A survey on bilevel optimization under uncertainty
- An effective bilevel programming approach for the evasive flow capturing location problem
- Neural network for solving convex quadratic bilevel programming problems
- An interval programming approach for the bilevel linear programming problem under fuzzy random environments
- A novel approach to solve multi-objective fuzzy stochastic bilevel programming using genetic algorithm
- On convex lower-level black-box constraints in bilevel optimization with an application to gas market models with chance constraints
Uses Software
This page was built for publication: Bi-level programming model and hybrid genetic algorithm for flow interception problem with customer choice
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q971769)
