1
|
Pirkul & Jayaraman (1996)Pirkul, H., & Jayaraman, V. (1996). Distribution planning in a multi-Commodity tri-echelon system. Transportation Science, 30(4), 291-302. http://dx.doi.org/10.1287/trsc.30.4.291. http://dx.doi.org/10.1287/trsc.30.4.291...
|
Minimizing the costs of a multi-commodity single-source network |
Lagrangian relaxation |
2
|
Holmberg & Hellstrand (1998)Holmberg, K. A. J., & Hellstrand, J. (1998). Solving the uncapacitated network design problem by a Lagrangean heuristic and branch-and-bound. Operations Research, 46(2), 247-259. http://dx.doi.org/10.1287/opre.46.2.247. http://dx.doi.org/10.1287/opre.46.2.247...
|
Global optimum resolution of a multimodal supply chain network design with non capacitaded facilities |
Lagrange in a branch-and-bound structure |
3
|
Jayaraman & Pirkul (2001)Jayaraman, V., & Pirkul, H. (2001). Planning and coordination of production and distribution facilities for multiple commodities. European Journal of Operational Research, 133(2), 394-408. http://dx.doi.org/10.1016/S0377-2217(00)00033-3. http://dx.doi.org/10.1016/S0377-2217(00)...
|
Minimizing the costs of a single-source network with several stages |
Lagrangian relaxation |
4
|
Altiparmak et al. (2006)Altiparmak, F., Gen, M., Lin, L., & Paksoy, T. (2006). A genetic algorithm approach for multi-objective optimization of supply chain networks. Computers & Industrial Engineering, 51(1), 196-215. http://dx.doi.org/10.1016/j.cie.2006.07.011. http://dx.doi.org/10.1016/j.cie.2006.07....
|
Find a set of best possible solutions for optimization of a network design of a multi-objective supply chain |
Genetic Algorithms and Simulated Annealing |
5
|
Cordeau et al. (2006)Cordeau, J.-F., Pasin, F., & Solomon, M. M. (2006). An integrated model for logistics network design. Annals of Operations Research, 144(1), 59-82. http://dx.doi.org/10.1007/s10479-006-0001-3. http://dx.doi.org/10.1007/s10479-006-000...
|
Solving a problem of supplier selection, location of factories and warehouses and the flow of goods across the network |
Branch-and-bound method and Bender's decomposition |
6
|
Lee et al. (2008)Lee, B., Kang, K., & Lee, Y. (2008). Decomposition heuristic to minimize total cost in a multi-level supply chain network. Computers & Industrial Engineering, 54(4), 945-959. http://dx.doi.org/10.1016/j.cie.2007.11.005. http://dx.doi.org/10.1016/j.cie.2007.11....
|
Resolving a distribution planning problem for a multi-level supply chain network |
Tabu Search |
7
|
Li et al. (2009)Li, J., Chu, F., & Prins, C. (2009). Lower and upper bounds for a capacitated plan location problem with multicommodity flow. Computers & Operations Research, 36(11), 3019-3030. http://dx.doi.org/10.1016/j.cor.2009.01.012. http://dx.doi.org/10.1016/j.cor.2009.01....
|
Determining the location of capacitated plants incorporated into a problem of multi-commodity flow |
Lagrange, subgradient optimization and Tabu Search |
8
|
Amrani et al. (2009)Amrani, H., Martel, A., Zufferey, N., & Makeeva, P. (2009). A variable neighborhood search heuristic for the design of multicommodity production–distribution networks with alternative facility configurations. OR-Spektrum, 33(4), 989-1007. http://dx.doi.org/10.1007/s00291-009-0182-7. http://dx.doi.org/10.1007/s00291-009-018...
|
Multi-commodity extension in two stages to the single-source capacitated facility location problem |
Search method in the neighborhood integrated with a tabu procedure |
9
|
Bidhandi et al. (2009)Bidhandi, H. M., Mohd Yusuff, R., Megat Ahmad, M. M. H., & Abu Bakar, M. R. (2009). Development of a new approach for deterministic supply chain network design. European Journal of Operational Research, 198(1), 121-128. http://dx.doi.org/10.1016/j.ejor.2008.07.034. http://dx.doi.org/10.1016/j.ejor.2008.07...
|
Network design of a network of multi-commodity supplies in a single period |
Bender's decomposition |
10
|
Hsu & Li (2009)Hsu, C. I., & Li, H. C. (2009). An integrated plant capacity and production planning model for high-tech manufacturing firms with economies of scale. International Journal of Production Economics, 118(2), 486-500. http://dx.doi.org/10.1016/j.ijpe.2008.09.015. http://dx.doi.org/10.1016/j.ijpe.2008.09...
|
Design a company's supply network, seeking to exploit the economies of scale of impacts arising from the use of optimal capacity and the amount of production of each facility |
Heuristic based in Simulated Annealing |
11
|
Javid & Azad (2010)Javid, A. A., & Azad, N. (2010). Incorporating location, routing and inventory decisions in supply chain network design. Transportation Research Part E, Logistics and Transportation Review, 46(5), 582-597. http://dx.doi.org/10.1016/j.tre.2009.06.005. http://dx.doi.org/10.1016/j.tre.2009.06....
|
Simultaneous optimization of location, allocation, capacities, inventory and routing in a chain of stochastic supplies, where each client has an uncertain demand, and each CD has certain amount of safety stock |
Tabu Search and Simulated Annealing |
12
|
Yao et al. (2010)Yao, Z., Lee, L. H., Jaruphongsa, W., Tan, V., & Hui, C. F. (2010). Multi-source facility location-allocation and inventory problem. European Journal of Operational Research, 207(2), 750-762. http://dx.doi.org/10.1016/j.ejor.2010.06.006. http://dx.doi.org/10.1016/j.ejor.2010.06...
|
Location-allocation problem of facilities and stocks, allowing the use of multiple sources of warehouses |
Iterative heuristic method using approach and transformation techniques |
13
|
Shimizu & Fujikura (2010)Shimizu, Y., & Fujikura, T. (2010). A hybrid meta-heuristic approach for integrated capacitated multi-commodity logistics optimization over planning horizon. Journal of Advanced Mechanical Design, Systems and Manufacturing, 4(3), 716-727. http://dx.doi.org/10.1299/jamdsm.4.716. http://dx.doi.org/10.1299/jamdsm.4.716...
|
Strategic optimization of a logistics network design to improve the efficiency of a supply chain |
Hibrid Tabu Search |
14
|
Lee & Kwon (2010)Lee, Y. H., & Kwon, S. G. (2010). The hybrid planning algorithm for the distribution center operation using tabu search and decomposed optimization. Expert Systems with Applications, 37(4), 3094-3103. http://dx.doi.org/10.1016/j.eswa.2009.09.020. http://dx.doi.org/10.1016/j.eswa.2009.09...
|
Facilities location problem and a distribution plan in a single-source network |
Tabu Search |
15
|
Kim & Kim (2010)Kim, D., & Kim, Y. (2010). A branch and bound algorithm for determining locations of long-term care facilities. European Journal of Operational Research, 206(1), 168-177. http://dx.doi.org/10.1016/j.ejor.2010.02.001. http://dx.doi.org/10.1016/j.ejor.2010.02...
|
Determining the location of patient care facilities with the aiming to balance the number of patients assigned to facilities |
Branch and bound |
16
|
Asken & Aras (2012)Asken, D., & Aras, N. (2012). A bilevel fixed charge location model for facilities under imminent attack. Computers & Operations, 39(7), 1364-1381. http://dx.doi.org/10.1016/j.cor.2011.08.006. http://dx.doi.org/10.1016/j.cor.2011.08....
|
Location of facilities with fixed charges for planning a system to provide public services to consumers. |
Tabu Search |
17
|
Sun (2012)Sun, M. (2012). A tabu search heuristic procedure for the capacitated facility location problem. Journal of Heuristics, 18(1), 97-118. http://dx.doi.org/10.1007/s10732-011-9157-3. http://dx.doi.org/10.1007/s10732-011-915...
|
Capacited facility location |
Tabu Search |
18
|
Badri et al. (2013)Badri, H., Bashiri, M., & Hejazi, T. (2013). Integrated strategic and tactical planning in a supply chain network design with a heuristc solution method. Computers & Operations Research, 40(4), 1143-1154. http://dx.doi.org/10.1016/j.cor.2012.11.005. http://dx.doi.org/10.1016/j.cor.2012.11....
|
Design and strategic and tactical planning of a network of supply chains |
Lagrangean relaxation |
19
|
Addis et al. (2013)Addis, B., Carello, G., & Ceselli, A. (2013). Combining very large scale and ILP based neighborhoods for a two-level location problem. European Journal of Operational Research, 231(3), 535-546. http://dx.doi.org/10.1016/j.ejor.2013.06.010. http://dx.doi.org/10.1016/j.ejor.2013.06...
|
Solve a generalization of the facility location problem in which two levels of facilities should be located |
Neighborhood search |
20
|
Rahmani & Mirhassani (2014)Rahmani, A., & Mirhassani, S. A. (2014). A hybrid firefly-genetic Algotithm for the capacitated facility location problem. Information Sciences, 283, 70-78. http://dx.doi.org/10.1016/j.ins.2014.06.002. http://dx.doi.org/10.1016/j.ins.2014.06....
|
Where to locate the facilities and how to move commodities to minimize costs |
Genetic algorithm |
21
|
Li et al. (2014)Li, J., Chu, F., Prins, C., & Zhu, Z. (2014). Lower and upper bounds for a two-stage capacitated facility location problem with handling costs. European Journal of Operational Research, 236(3), 957-967. http://dx.doi.org/10.1016/j.ejor.2013.10.047. http://dx.doi.org/10.1016/j.ejor.2013.10...
|
Location of multi-product facilities. Minimize costs, allocating deposits, determining the flow of products in plants, opening distribution centers to other customers. |
Lagrangian Relaxation and Dantzig-Wolfe |
22
|
Arrondo et al. (2015)Arrondo, A., Redondo, J. L., Fernández, J., & Ortigosa, P. M. (2015). Parallelization of a non-linear multi-objective optimization algorithm: application to a location problem. Applied Mathematics and Computation, 255, 114-124. http://dx.doi.org/10.1016/j.amc.2014.08.036. http://dx.doi.org/10.1016/j.amc.2014.08....
|
Bi-objective facilities location. |
FEMOEA, Evolutionary algorithm |
23
|
Ho (2015)Ho, S. (2015). An iterated tabu search heuristic for the single source capacitated facility location problem. Applied Soft Computing, 27, 169-178. http://dx.doi.org/10.1016/j.asoc.2014.11.004. http://dx.doi.org/10.1016/j.asoc.2014.11...
|
Determine a subset of enabled facilities to be opened in order to meet the demands of customers so that the costs are minimized. |
Tabu Search |