HEURISTIC ALGORITHMS FOR THE SINGLE VEHICLE DIAL-A-RIDE PROBLEM

スポンサーリンク

概要

• 論文の詳細を見る

• A number of papers have been proposed for the approximate solution of the dial-a-ride routing problem. The object of this paper is to examine some of these heuristics, to introduce some new heuristics, and to compare these approximate algorithms.

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

著者

• 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

スポンサーリンク