A farthest insertion heuristic algorithm for the distance-constrained capacitated vehicle routing problem

The vehicle routing problem (YRP) under distance and capacity constraints involves the design of a set of delivery routes which originate and terminate at a central depot after satisfying the customer demands . Each customer must be served exactly once and by one vehicle, where vehicle capacity and...

詳細記述

保存先:
書誌詳細
主要な著者: Chai, Jin Sian, Johar, Farhana
フォーマット: Conference or Workshop Item
言語:English
出版事項: 2015
主題:
オンライン・アクセス:http://eprints.utm.my/id/eprint/61596/1/FarhanaJohar2015_AFarthestInsertionHeuristicAlgorithmfortheDistance-Constrained.pdf
http://eprints.utm.my/id/eprint/61596/
タグ: タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!

類似資料