A LAGRANGEAN APPROACH TO THE FACILITY LOCATION PROBLEM WITH CONCAVE COSTS

スポンサーリンク

概要

• 論文の詳細を見る

• We consider the concave cost capacitated facility location problem, and develop a composite algorithm of lower and upper bounding procedures. Computational results for several instances with up to 100 customers and 25 candidate facility locations are also presented. Our numerical experiments show that the proposed algorithm generates good solutions. The gaps between upper and lower bounds a,re within 1 percent for all test problems.

• 社団法人日本オペレーションズ・リサーチ学会の論文

著者

• Kubo Mikio

  Waseda University

• Kasugai Hiroshi

  Waseda University

関連論文

• HEURISTIC ALGORITHMS FOR THE SINGLE VEHICLE DIAL-A-RIDE PROBLEM
• A LAGRANGEAN APPROACH TO THE FACILITY LOCATION PROBLEM WITH CONCAVE COSTS
• THE PRECEDENCE CONSTRAINED TRAVELING SALESMAN PROBLEM
• ON THE CORE OF THE NETWORK DESIGN GAME
• THE PROBABILISTIC NETWORK DESIGN PROBLEM
• RANDOMIZED DECISION STRATEGY FOR THE HIERARCHICAL OPTIMIZATION PROBLEMS

スポンサーリンク