EngineeringComputer ScienceMathematics
DOI: 10.1007/bf02023004

Resumen de tlooto

Approximate methods based on descent, hybrid simulated annealing/tabu search, and tabu search algorithms are developed and different search strategies are investigated and an estimate for the tabu list size is statistically derived.

Resumen

El resumen no está disponible.

Formato de cita

OSMAN, I. Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. ANNALS OF OPERATIONS RESEARCH, 1993, 41: 421–451.