Computational experience with simulated trading algorithms solving vehicle routing and other combinatorial optimization problems
We present a new heuristic for solving vehicle routing problems. The heuristic uses complex customer interchanges to improve the initial solutions. Simulated trading as a general improvement procedure for a wide class of combinatorial optimization problem is able to handle many different side constraints like time windows, backhauls and a heterogeneous vehicle fleet. The algorithm is well suited for parallelization. A parallel version of Simulated trading was implemented on a cluster of workstations using PVM. The computational results we have obtained with sequential and parallel simulated trading show the quality of our solutions is superior to all heuristics for which solution values were published.
- OSTI ID:
- 35796
- Report Number(s):
- CONF-9408161--
- Country of Publication:
- United States
- Language:
- English
Similar Records
New exact algorithms for the vehicle routing problem
A Library of Local Search Heuristics for the Vehicle Routing Problem