haku: @author Gavish, B. / yhteensä: 16
viite: 5 / 16
| Tekijä: | Altinkemer, K. Gavish, B. |
| Otsikko: | Parallel savings based heuristic for the delivery problem. |
| Lehti: | Operations Research
1991 : MAY-JUN, VOL. 39:3, p. 456-469 |
| Asiasana: | INTEGER PROGRAMMING VEHICLE SCHEDULING HEURISTIC METHODS |
| Kieli: | eng |
| Tiivistelmä: | The delivery problem is one of a group of closely related problems called the vehicle routing problem /VRP/. It looks for the most economical way to fulfil the deterministic transportation requirements of costumers by a fleet of vehicles. Each vehicle starts from a centralized depot, visits the set of customers assigned to it in an order that minimizes the trip cost and returns to the depot. Parallel savings algorithms /PSAs/ are presented to generate solutions to this problem. The new solutions combine the savings approach, with matching based procedures. The quality of solutions generated by PSAs is shown to be superior to other methods on large set of test problems. |
SCIMA