RANDOMIZED DECISION STRATEGY FOR THE HIERARCHICAL OPTIMIZATION PROBLEMS

スポンサーリンク

概要

• 論文の詳細を見る

• The hierarchical decision problem is a generic name of the problems whose common characteristics are: 1. They contain two or more levels of decision making, 2. Precise information about what will happen is not known a priori, 3. As the level is increased, more information can be available. We introduce a new solution method refereed to as the randomized decision strategy for the hierarchical decision problems. Two well-known and practical situations, which are the hierarchical scheduling problem and the hierarchical vehicle routing problem, are considered to illustrate this strategy.

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

著者

• Kubo M

  Tokyo Univ. Marine Sci. And Technol.

• Kubo Mikio

  Department Of Information Engineering And Logistics Tokyo University Of Mercantile Marine

• Kasugai H

  Waseda Univ.

• Kasugai Hiroshi

  Waseda University

関連論文

• HEURISTIC ALGORITHMS FOR THE SINGLE VEHICLE DIAL-A-RIDE PROBLEM
• 1A2 SHIP SCHEDULING IN THE STEEL INDUSTRY : A ROSSING-HORIZON AND APPROXIMATE DYNAMIC PROGRAMMING APPROACH
• 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
• The Life Span Method : A New Variant of Local Search
• Optimization of oil tanker schedules by decomposition, column generation, and time-space network techniques
• Algorithms for the Item Assortment Problem : An Application to Vending Machine Products

スポンサーリンク