In the period vehicle routing problem, each customer requires a certain number of deliveries per week. Given these frequency requirements, customers must be allocated to days. A vehicle routing problem is solved over each day. We have improved upon best-known solutions to problems from the literature using a new heuristic procedure. The heuristic also works well on 19 newly generated test problems.
An improved heuristic for the period vehicle routing problem
Eine verbesserte Heuristik für das Problem periodischer Fahrzeugrouten
Networks ; 26 , 1 ; 25-44
1995
20 Seiten, 17 Quellen
Aufsatz (Zeitschrift)
Englisch
An adaptive large-neighborhood search heuristic for a multi-period vehicle routing problem
Online Contents | 2016
|A tabu search heuristic for the vehicle routing problem
TIBKAT | 1992
|