BRANCH-AND-BOUND ALGORITHM FOR SEEKING P-MEDIAN

被引:48
|
作者
JARVINEN, P
SINERVO, H
RAJALA, J
机构
关键词
D O I
10.1287/opre.20.1.173
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
An algorithm is constructed and comparisons are made with the vertex- substitution method of M. B. Teitz and P. Bart. It is shown how the vertex- substitution method can lead to a local optimum, and give a heuristic method for finding a good initial solution for this method.
引用
收藏
页码:173 / &
相关论文
共 50 条
  • [31] An exact algorithm for the fuzzy p-median problem
    Canós, MJ
    Ivorra, C
    Liern, V
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1999, 116 (01) : 80 - 86
  • [32] Random Search Algorithm for the p-Median Problem
    Antamoshkin, Alexander N.
    Kazakovtsev, Lev A.
    INFORMATICA-JOURNAL OF COMPUTING AND INFORMATICS, 2013, 37 (03): : 267 - 278
  • [33] An efficient genetic algorithm for the p-median problem
    Alp, O
    Erkut, E
    Drezner, Z
    ANNALS OF OPERATIONS RESEARCH, 2003, 122 (1-4) : 21 - 42
  • [34] An Efficient Genetic Algorithm for the p-Median Problem
    Osman Alp
    Erhan Erkut
    Zvi Drezner
    Annals of Operations Research, 2003, 122 : 21 - 42
  • [35] AN EXTENSION TO THE P-MEDIAN GROUP TECHNOLOGY ALGORITHM
    BENARIEH, D
    CHANG, PT
    COMPUTERS & OPERATIONS RESEARCH, 1994, 21 (02) : 119 - 125
  • [36] A genetic algorithm for solving the P-median problem
    Abu Dalhoum, AL
    Moh'd, AZ
    de la Cruz, M
    Ortega, A
    Alfonseca, M
    MODELLING AND SIMULATION 2005, 2005, : 141 - 145
  • [37] An ant colony algorithm for P-median problem
    Chen, Ye
    Zheng, Houtian
    Li, Youmei
    Proceedings of the Third International Conference on Information and Management Sciences, 2004, 3 : 367 - 368
  • [38] A hybrid evolutionary algorithm for the p-median problem
    Borgulya, Istvan
    GECCO 2005: Genetic and Evolutionary Computation Conference, Vols 1 and 2, 2005, : 649 - 650
  • [39] A branch-and-price approach to p-median location problems
    Senne, ELF
    Lorena, LAN
    Pereira, MA
    COMPUTERS & OPERATIONS RESEARCH, 2005, 32 (06) : 1655 - 1664
  • [40] A branch-and-cut method for the obnoxious p-median problem
    Belotti, Pietro
    Labbe, Martine
    Maffioli, Francesco
    Ndiaye, Malick M.
    4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH, 2007, 5 (04): : 299 - 314