In vehicle routing problems with time windows, a fixed fleet of vehicles of limited capacity is available at a depot to serve a set of clients with given demands. Each client must be visited within a given time window. We describe a branch-and-bound method that minimizes the total route length, and present some computational results.
No takes yet. Share an insight, caveat, or question.
Kolen et al. (1987) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: