2013
DOI: 10.1016/j.apm.2013.01.001
|View full text |Cite
|
Sign up to set email alerts
|

A combined facility location and network design problem with multi-type of capacitated links

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
24
0
3

Year Published

2014
2014
2021
2021

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 54 publications
(27 citation statements)
references
References 19 publications
0
24
0
3
Order By: Relevance
“…We name a few recent key works for completeness, for example, the hybrid multi-start heuristic (Resende and Werneck, 2006), second-order cone programming (Wagner et al, 2009), approximation algorithms (Huang and Li, 2008;Li, 2013), greedy heuristic and fix-and-optimize heuristic (Ghaderi and Jabalameli, 2013), Lagrangian relaxation heuristic (Nezhad et al, 2013), mixed integer linear programming model (Kratica et al, 2014), discrete variant of unconscious search (Ardjmand et al, 2014), multi-objective optimization model (Tang et al, 2013), and the weighted Dantzig-Wolfe decomposition and path-relinking combined method , which have been presented for solving an uncapacitated facility location problem. Also, some algorithms and methods have been proposed for solving the capacitated facility location problem to optimality such as the mixed integer programming formulation (Melkote and Daskin, 2001;Aros-Vera et al, 2013;Rosa et al, 2014), branch-and-price algorithm (Klose and Görtz, 2007), Lagrangian heuristic algorithm (Wu et al, 2006;Elhedhli and Merrick, 2012), kernel search heuristic (Guastaroba and Speranza, 2014), Lagrangian Heuristic and Ant Colony System (Chen and Ting, 2008), Lagrangian relaxation algorithm (Yun et al, 2014), a fix-and-optimize heuristic based on the evolutionary fire-fly algorithm (Rahmaniani and Ghaderi, 2013), hybrid Firefly-Genetic Algorithm (Rahmani and MirHassani, 2014), swarm intelligence based on sample average approximation (Aydin and Murat, 2013), modified Clarke and Wright savings heuristic algorithm , iterated tabu search heuristic (Ho, 2015), improved approximation algorithm (Aardal et al, 2015), two-stage robust models and algorithms , and the evolutionary multi-objective optimization approach (Rakas et al, 2004;Harris et al, 2014).…”
Section: Introductionmentioning
confidence: 99%
“…We name a few recent key works for completeness, for example, the hybrid multi-start heuristic (Resende and Werneck, 2006), second-order cone programming (Wagner et al, 2009), approximation algorithms (Huang and Li, 2008;Li, 2013), greedy heuristic and fix-and-optimize heuristic (Ghaderi and Jabalameli, 2013), Lagrangian relaxation heuristic (Nezhad et al, 2013), mixed integer linear programming model (Kratica et al, 2014), discrete variant of unconscious search (Ardjmand et al, 2014), multi-objective optimization model (Tang et al, 2013), and the weighted Dantzig-Wolfe decomposition and path-relinking combined method , which have been presented for solving an uncapacitated facility location problem. Also, some algorithms and methods have been proposed for solving the capacitated facility location problem to optimality such as the mixed integer programming formulation (Melkote and Daskin, 2001;Aros-Vera et al, 2013;Rosa et al, 2014), branch-and-price algorithm (Klose and Görtz, 2007), Lagrangian heuristic algorithm (Wu et al, 2006;Elhedhli and Merrick, 2012), kernel search heuristic (Guastaroba and Speranza, 2014), Lagrangian Heuristic and Ant Colony System (Chen and Ting, 2008), Lagrangian relaxation algorithm (Yun et al, 2014), a fix-and-optimize heuristic based on the evolutionary fire-fly algorithm (Rahmaniani and Ghaderi, 2013), hybrid Firefly-Genetic Algorithm (Rahmani and MirHassani, 2014), swarm intelligence based on sample average approximation (Aydin and Murat, 2013), modified Clarke and Wright savings heuristic algorithm , iterated tabu search heuristic (Ho, 2015), improved approximation algorithm (Aardal et al, 2015), two-stage robust models and algorithms , and the evolutionary multi-objective optimization approach (Rakas et al, 2004;Harris et al, 2014).…”
Section: Introductionmentioning
confidence: 99%
“…One can say that most of network optimization problems can be seen as a kind of (1) NDP, (2) NLP or (3) a combination of both where the objective and the constraints may differ from one problem to another: connectivity [6] [7], limited budget [8], hop limit [2] [9], delay [10] [11], reliability [9] [10], and survivability [11]. The NLP in capacitated or uncapacitated case and with both single or multiple facilities is a special case of the well known Multicommodity Network Design Problem (MCND).…”
Section: Related Workmentioning
confidence: 99%
“…A tabu search heuristic algorithm with real costs on facilities is developed in [18]. A firefly algorithm is proposed by Ragheb et al [8], they combined facility location and network design problem with multi-type of capacitated link and limited budget on facilities. Contreras et al [19] presented a unified framework of general network design problems which combine location decision and network design decision.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…During the past few years, there have been increasing interests to determine a facility in competitive environment (Sridharan, 1995;Nauss, 1978;Küçükdeniz et al, 2012;Yang et al, 2012;Manzour-alAjdad et al, 2012;Rahmaniani & Ghaderi, 2013). Wu et al (2006) presented an extension of the capacitated facility location problem (CFLP) by considering the general setup cost functions and multiple facilities in one.…”
Section: Introductionmentioning
confidence: 99%