Optimal location with equitable loads

DOI10.1007/s10479-008-0339-9zbMath1163.90591OpenAlexW2014530950MaRDI QIDQ1026600

Oded Berman, Zvi Drezner, George O. Wesolowsky, Arie Tamir

Publication date: 25 June 2009

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-008-0339-9

zbMATH Keywords

networkfacility locationequitable loads

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)

Related Items

Geometric partitioning and robust ad-hoc network design, Equitable service by a facility: minimizing the Gini coefficient, The quintile share ratio in location analysis, The maximin HAZMAT routing problem, Capacity management in public service facility networks: a model, computational tests and a case study, The minimum equitable radius location problem with continuous demand, Inequity averse optimization in operational research, Voronoi diagrams with overlapping regions, Inverse and reverse balanced facility location problems with variable edge lengths on trees, Identifying trade‐offs in equity and efficiency for simultaneously optimizing location and multipriority dispatch of ambulances, Collection Center Location with Equity Considerations in Reverse Logistics Networks, Facility location and pricing problem: discretized mill price and exact algorithms, The balanced 2-median and 2-maxian problems on a tree, The discrete facility location problem with balanced allocation of customers, The reverse selective balance center location problem on trees, Closest assignment constraints in discrete location problems, Unnamed Item, Preprocessing for a map sectorization problem by means of mathematical programming, Balancing the arrival times of users in a two-stage location problem, A short note on locating facilities on a path to minimize load range equity measure, Multiple allocation hub interdiction and protection problems: model formulations and solution approaches, Effectiveness-equity models for facility location problems on tree networks, Dividing a Territory Among Several Vehicles, Inverse single facility location problem on a tree with balancing on the distance of server to clients, An elliptical cover problem in drone delivery network design and its solution algorithms, Service allocation equity in location coverage analytics, An approximation algorithm for the facility location problem with lexicographic minimax objective

Uses Software

• Isolde
• OR-Library
• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Approximation algorithms for scheduling unrelated parallel machines
• The \(p\)-median problem: a survey of metaheuristic approaches
• An efficient tabu search procedure for the \(p\)-median problem
• An efficient genetic algorithm for the \(p\)-median problem
• A statistical analysis of simulated annealing applied to the \(p\)-median problem
• Future paths for integer programming and links to artificial intelligence
• Algorithms for a facility location problem with stochastic customer demand and immobile servers
• The equitable location problem on the plane
• The minimum equitable radius location problem with continuous demand
• An Optimization Based Heuristic for Political Districting
• The Stochastic Queue p-Median Problem
• Generalized Selection and Ranking: Sorted Matrices
• A Cross Decomposition Algorithm for Capacitated Facility Location
• Optimal 2-Facility Network Districting in the Presence of Queuing
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• Exact and Approximate Algorithms for Scheduling Nonidentical Processors
• Variable neighborhood search for the p-median
• Dynamic facility location: The progressive p-median problem
• Solving thep-Center problem with Tabu Search and Variable Neighborhood Search
• A Fast Parametric Maximum Flow Algorithm and Applications
• All-norm approximation algorithms
• On the Limit of the Generalized Binomial Distribution
• The multiple server location problem
• Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
• Optimal Political Districting by Implicit Enumeration Techniques