A Method of Filtered Beam Search Based Delivery Scheduling.

DOI Web Site Web Site

書誌事項

タイトル別名
  • Method of Filtered Beam Search Based De

この論文をさがす

抄録

In this paper we propose a heuristic procedure to solve the routing phase of delivery scheduling problem. Aiming at fast response, a beam search based decision procedure is utilized. In this research, a new evaluation rule named as “the most willing neighbor” is applied. The new rule retains the simplicity of the nearest neighbor rule, and overcomes its weak points. Three applications are presented and compared with the results obtained in 20 runs of the well-known 3-opt procedure. The proposed system offers flexibility and high quality solutions with very fast response.

収録刊行物

キーワード

詳細情報 詳細情報について

問題の指摘

ページトップへ