Discrete location models with customers’ choice and path improvements

We examine several facility location problems within a directed network involving two distinct cost types. The first, referred to as the ‘‘customer cost’’, represents the expense each customer considers when selecting a facility to obtain service (e.g., delivery time or a measure of quality degradation). Consequently, once facilities are established, each customer chooses the one that minimizes their individual cost. The second type, termed the ‘‘company cost’’, encompasses all expenses incurred by the company due to customer allocation to their chosen facilities. Additionally, the company possesses a budget that can be allocated to reduce company costs associated with the network’s arcs (the so-called arcs upgrading). The company’s objective is to simultaneously determine facility locations and distribute the budget (or a portion of it) across the network arcs to minimize the total company cost. This total company cost comprises the post-upgrading company costs and the invested budget, while accounting for customer reactions after facility placement. Different problem variants emerge based on the facility location criteria and customers’ choice strategy. In this paper, we address the following problems: the 𝑝��-median problem, a two-stage facility location problem, a single-allocation hub location problem, and a tree-of-hubs location problem — all incorporating customers’ choice and arc upgrading.

Authors

Publication Details

Journal
Omega
Published
2025-11-04
DOI
https://doi.org/10.1016/j.omega.2025.103458
Primary Topic
Facility Location and Emergency Management
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Discrete location models with customers’ choice and path improvements

Inmaculada Espejo, Alfredo Marı́n
Omega
Facility Location and Emergency Management
article

Discrete location models with customers’ choice and path improvements

Inmaculada Espejo, Alfredo Marı́n
article en

Abstract

We examine several facility location problems within a directed network involving two distinct cost types. The first, referred to as the ‘‘customer cost’’, represents the expense each customer considers when selecting a facility to obtain service (e.g., delivery time or a measure of quality degradation). Consequently, once facilities are established, each customer chooses the one that minimizes their individual cost. The second type, termed the ‘‘company cost’’, encompasses all expenses incurred by the company due to customer allocation to their chosen facilities. Additionally, the company possesses a budget that can be allocated to reduce company costs associated with the network’s arcs (the so-called arcs upgrading). The company’s objective is to simultaneously determine facility locations and distribute the budget (or a portion of it) across the network arcs to minimize the total company cost. This total company cost comprises the post-upgrading company costs and the invested budget, while accounting for customer reactions after facility placement. Different problem variants emerge based on the facility location criteria and customers’ choice strategy. In this paper, we address the following problems: the 𝑝��-median problem, a two-stage facility location problem, a single-allocation hub location problem, and a tree-of-hubs location problem — all incorporating customers’ choice and arc upgrading.

OmegaVol. 139
Deutsche Forschungsgemeinschaft, Ministerio de Ciencia e Innovación, Junta de Andalucía, European Regional Development Fund, Agencia Estatal de Investigación
Openalex Percentile: Top 63%
Facility Location and Emergency Management
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.