Scheduling of Container Storage and Retrieval
Operations Research
An Efficient Algorithm for the Shortest Path Problem with Forbidden Paths
ICA3PP '09 Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing
Computers and Operations Research
Fuzzy measure on vehicle routing problem of hospital materials
Expert Systems with Applications: An International Journal
An efficient column-generation-based algorithm for solving a pickup-and-delivery problem
Computers and Operations Research
INFORMS Journal on Computing
The time-dependent prize-collecting arc routing problem
Computers and Operations Research
Optimizing local pickup and delivery with uncertain loads
Proceedings of the Winter Simulation Conference
| Hi-index | 0.00 |
Truckload carriers are constantly faced with the problem of shipping full truckloads of goods at minimum cost between pairs of cities or customers, using a fleet of trucks located at one or more depots. In this paper, a new branch-and-bound algorithm for solving an integer-programming formulation of this vehicle-routing problem (VRP) with full truckloads is developed. The algorithm also takes into consideration the time-window constraints and waiting costs. The resulting efficiency, validated by computational tests on random problems, is due to a column-generation scheme that exploits the special structure of the problem to solve the linear-programming relaxation problems that arise at the nodes.