Paper Search Console

Home Search Page About Contact

Journal Title

Title of Journal: Optim Lett

Search In Journal Title:

Abbravation: Optimization Letters

Search In Journal Abbravation:

Publisher

Springer Berlin Heidelberg

Search In Publisher:

DOI

10.1016/0093-934x(74)90039-x

Search In DOI:

ISSN

1862-4480

Search In ISSN:
Search In Title Of Papers:

Locating facilities in a competitive environment

Authors: A Karakitsiou A Migdalas
Publish Date: 2015/10/19
Volume: 11, Issue: 5, Pages: 929-945
PDF Link

Abstract

The research work dealing with the bilevel formulation of location problems is limited only to the competition among the locators that is it is supposed that either both the locator and the allocator are the same or the customer knows the optimality criterion of the locator and agrees passively with it Customers’ preferences as well as externalities such as road congestion facility congestion emissions etc caused by the location decisions are either ignored or controlled by incorporating constraints in order to ensure the achievement of a predetermined target However this approach treats customers as irresolute beings Thus if for example the customers travel to the facilities to obtain the offered service then there is no compulsion or intensive for them to attend the designated facility This means that once the facilities are open what the locator wishes the customers to do may not coincide with their own wish and behavior We suppose that the customers are involved in a Nash game in order to ensure what they conceive as the best level of services for themselves In order to take into consideration the effects of such competition in the facilities location decisions we propose a bilevel programming approach to the problem


Keywords:

References


.
Search In Abstract Of Papers:
Other Papers In This Journal:

  1. An interior penalty method for a finite-dimensional linear complementarity problem in financial engineering
  2. The modified proximal point algorithm in CAT(0) spaces
  3. An edge-swap heuristic for generating spanning trees with minimum number of branch vertices
  4. Selection of representative SNP sets for genome-wide association studies: a metaheuristic approach
  5. A semidefinite optimization approach to the Target Visitation Problem
  6. Elementary convex techniques for equilibrium, minimax and variational problems
  7. On the global convergence rate of the gradient descent method for functions with Hölder continuous gradients
  8. Symmetric duality for second-order fractional programs
  9. Generalized solutions of quasi variational inequalities
  10. A composite model in the context of a production-inventory system
  11. Preserving maximal monotonicity with applications in sum and composition rules
  12. Single machine serial-batching scheduling with independent setup time and deteriorating job processing times
  13. Strong convergence of Mann’s type iteration method for an infinite family of generalized asymptotically nonexpansive nonself mappings in Hilbert spaces
  14. Stochastic subgradient descent method for large-scale robust chance-constrained support vector machines
  15. Polynomial-time identification of robust network flows under uncertain arc failures
  16. A multi-space sampling heuristic for the vehicle routing problem with stochastic demands
  17. Maximizing strike aircraft planning efficiency for a given class of ground targets
  18. Dynamic lot-sizing problem with demand time windows and container-based transportation cost
  19. Sufficient conditions for protection routing in IP networks
  20. A note on diameters of point sets
  21. Capacity optimization through sensing threshold adaptation for cognitive radio networks
  22. Convexifying the set of matrices of bounded rank: applications to the quasiconvexification and convexification of the rank function
  23. The perspective of a bank in granting credits: an optimization model
  24. k -Sum decomposition of strongly unimodular matrices
  25. Solving the weighted MAX-SAT problem using the dynamic convexized method
  26. A comparison of several nearest neighbor classifier metrics using Tabu Search algorithm for the feature selection problem
  27. Global optimal approximate solutions

Search Result: