题名: |
A heuristic approach based on the string model to solve the vehicle routing problem with various conditions. |
作者: |
HASAMA-T (Keio Univ, Yokohama, Japan); KOKUBUGATA-H (Keio Girls High School, Tokyo, Japan); KAWASHIMA-H (Keio Univ, Yokohama, Japan) |
关键词: |
CONFERENCE-; 8525-; INTELLIGENT-TRANSPORT-SYSTEM; 8735-; ROUTE-GUIDANCE; 8771-; DELIVERY-VEHICLE; 1234-; COST-; 0176- |
摘要: |
In this paper, a data model is proposed which takes the form of a string which represents the vehicle routing problems (VRP) with various conditions including time windows, the pickup and delivery, the repeated delivery and the multiple depots. The simulated annealing is adopted as an optimization technique to solve VRP. The objective of the proposed model is to minimize the total cost that consists of the vehicle operation cost, the depot operation cost and the working cost of drivers. The scheme deals with the VRP with complicated constraints by an extremely simple procedure compared to other methods, but also generates good quality solutions. (A*) For the covering abstract see ITRD E110327. |
总页数: |
PROCEEDINGS OF 6TH WORLD CONGRESS ON INTELLIGENT TRANSPORT SYSTEMS (ITS), HELD TORONTO, CANADA, NOVEMBER 8-12, 1999. 1999. pp- |
报告类型: |
科技报告 |