A particle swarm optimization method for semi-obnoxious line location problem with rectilinear norm
Tài liệu tham khảo
Beasley, 1990, OR-Library: Distributing test problems by electronic mail, Journal of the Operational Research Society, 41, 1069, 10.1057/jors.1990.166
Chen, 2009, 740
Díaz-Báñez, 2004, Continuous location of dimensional structures, European Journal of Operational Research, 152, 22, 10.1016/S0377-2217(02)00647-1
Eberhart, 1995, A new optimizer using particle swarm theory, 9
Edelsbrunner, 1985, Finding traversals for sets of simple geometric figures, Theoretical Computer Science, 35, 55, 10.1016/0304-3975(85)90005-2
Fathali, 2007, A genetic algorithm for the p-median problem with pos/neg weights, Applied Mathematics and Computation, 183, 1071, 10.1016/j.amc.2006.05.143
Fernandes, 2014, A simple and effective genetic algorithm for the two-stage capacitated facility location problem, Computers & Industrial Engineering, 75, 200, 10.1016/j.cie.2014.05.023
Goldberg, 1989
Korneenko, 1993, Hyperplane approximation and related topics, 135
Melachrinoudis, 1999, Bicriteria location of a semi-obnoxious facility, Computers & Industrial Engineering, 37, 581, 10.1016/S0360-8352(00)00022-X
Morris, 1983, Linear facility location-solving extensions on the basic problems, European Journal of Operational Research, 12, 90, 10.1016/0377-2217(83)90183-2
Schöbel, 1999
Singh, 2016, A quantum behaved particle swarm optimization for flexible job shop scheduling, Computers & Industrial Engineering, 93, 36, 10.1016/j.cie.2015.12.004
Stanimirovic, 2007, Genetic algorithms for solving the discrete ordered median problem, European Journal of Operational Research, 182, 983, 10.1016/j.ejor.2006.09.069
Wesolowsky, 1975, Location of the median line for weighted points, Environment and Planning A, 7, 163, 10.1068/a070163