50 years of metaheuristics
In this paper, we review the milestones in the development of heuristic methods for
optimization over the last 50 years. We propose a critical analysis of the main findings and …
optimization over the last 50 years. We propose a critical analysis of the main findings and …
Solution methods for the p‐median problem: An annotated bibliography
J Reese - NETWORKS: an international Journal, 2006 - Wiley Online Library
The p‐median problem is a network problem that was originally designed for, and has been
extensively applied to, facility location. In this bibliography, we summarize the literature on …
extensively applied to, facility location. In this bibliography, we summarize the literature on …
Fifty years of metaheuristics
In this paper, we review the milestones in the development of heuristic methods for
optimization over the last 50 years. We propose a critical analysis of the main findings and …
optimization over the last 50 years. We propose a critical analysis of the main findings and …
A model and methodologies for the location problem with logistical components
SS Syam - Computers & Operations Research, 2002 - Elsevier
This paper significantly extends traditional facility location models by introducing several
logistical cost components such as holding, ordering, and transportation costs in a multi …
logistical cost components such as holding, ordering, and transportation costs in a multi …
Using logic-based Benders decomposition to solve the capacity-and distance-constrained plant location problem
MM Fazel-Zarandi, JC Beck - INFORMS Journal on …, 2012 - pubsonline.informs.org
We address an optimization problem that requires deciding the location of a set of facilities,
the allocation of customers to those facilities under capacity constraints, and the allocation of …
the allocation of customers to those facilities under capacity constraints, and the allocation of …
Adaptive genetic algorithm for solving sugarcane loading stations with multi-facility services problem
This paper presents a computational tool for operational planning of sugarcane loading
stations. The loading stations are used to facilitate the supply of sugarcane to a sugar mill …
stations. The loading stations are used to facilitate the supply of sugarcane to a sugar mill …
Joint distribution center location problem for restaurant industry based on improved k-means algorithm with penalty
Y Zhou, R Xie, T Zhang, J Holguin-Veras - IEEE Access, 2020 - ieeexplore.ieee.org
The location of joint distribution center (JDC) is of great importance in urban freight system.
This work aims to minimize the total cost, including the fixed cost, the transportation cost, and …
This work aims to minimize the total cost, including the fixed cost, the transportation cost, and …
A modified grouping genetic algorithm to select ambulance site locations
AJ Comber, S Sasaki, H Suzuki… - International Journal of …, 2011 - Taylor & Francis
This article describes the development and application of a modified grouping genetic
algorithm (GGA) used to identify sets of optimal ambulance locations. The GGA was …
algorithm (GGA) used to identify sets of optimal ambulance locations. The GGA was …
An effective heuristic for the P-median problem with application to ambulance location
We consider the p-median problem which is to find the location of p-facilities so as to
minimize the average weighted distance or time between demand points and service …
minimize the average weighted distance or time between demand points and service …
P-medyan tesis yeri seçim problemi ve çözüm yaklaşımları
M Bastı - AJIT-e: Academic Journal of Information Technology, 2012 - dergipark.org.tr
Her geçen gün globalleşen ve rekabetin sürekli olarak arttığı dünyamızda organizasyonların
yaşamlarını devam ettirebilmelerinde başarılı bir tedarik zinciri yönetimi stratejisi …
yaşamlarını devam ettirebilmelerinde başarılı bir tedarik zinciri yönetimi stratejisi …