Metaheuristics for bilevel optimization: A comprehensive review
A bilevel programming model represents the relationship in a specific decision process that
involves decisions within a hierarchical structure of two levels. The upper-level problem is …
involves decisions within a hierarchical structure of two levels. The upper-level problem is …
Profit-maximizing parcel locker location problem under threshold Luce model
The growth of e-commerce has created increasing complexity in logistics services. To
remain competitive, logistics and e-commerce companies are exploring new modes as …
remain competitive, logistics and e-commerce companies are exploring new modes as …
Branch-and-cut approach based on generalized benders decomposition for facility location with limited choice rule
This paper studies the exact solution approaches for a generalized competitive facility
location problem. We consider a company that plans to introduce a service by opening a set …
location problem. We consider a company that plans to introduce a service by opening a set …
Store location with multipurpose shopping trips and a new random utility customers' choice model
This paper addresses retail store location in a duopoly. One firm, the so-called leader, has
already located several stores, while a second firm, the follower that offers a different …
already located several stores, while a second firm, the follower that offers a different …
[HTML][HTML] A comparative performance analysis of intelligence-based algorithms for optimizing competitive facility location problems
Most companies operate to maximize profits and increase their market shares in competitive
environments. Since the proper location of the facilities conditions their market shares and …
environments. Since the proper location of the facilities conditions their market shares and …
New heuristic algorithms for discrete competitive location problems with binary and partially binary customer behavior
P Fernández, B Pelegrín, A Lančinskas… - Computers & Operations …, 2017 - Elsevier
We consider discrete location problems for an entering firm which competes with other
established firms in a market where customers are spatially separated. In these problems, a …
established firms in a market where customers are spatially separated. In these problems, a …
Parcel locker location problem with selectable volume sizes and heterogeneous customers in the last mile delivery
L Zhou, C Li, C Hu, J Du - Transportation Letters, 2024 - Taylor & Francis
This study introduces a novel parcel locker location problem in the last mile delivery where
each parcel locker is equipped with a set of selectable volume sizes and provides services …
each parcel locker is equipped with a set of selectable volume sizes and provides services …
Competitive location: a state-of-art review
M Ashtiani - International Journal of Industrial Engineering …, 2016 - growingscience.com
This paper provides a review on recent works in the field of competitive facility location
models based on the following seven components: 1) Variables, 2) Competition type, 3) …
models based on the following seven components: 1) Variables, 2) Competition type, 3) …
Location of competitive facilities: a comprehensive review and future research agenda
Purpose The research in competitive facility location (CFL) is quite dynamic, both from a
problem formulation and an algorithmic point of view. Research direction has changed …
problem formulation and an algorithmic point of view. Research direction has changed …
A genetic algorithm in combination with a solution archive for solving the generalized vehicle routing problem with stochastic demands
This work presents a steady-state genetic algorithm enhanced by a complete trie-based
solution archive for solving the generalized vehicle routing problem with stochastic demands …
solution archive for solving the generalized vehicle routing problem with stochastic demands …