Using Tabu search for solving a dynamic multi-terminal truck dispatching problem
- 8 June 1995
- journal article
- Published by Elsevier BV in European Journal of Operational Research
- Vol. 83 (2), 411-429
- https://doi.org/10.1016/0377-2217(95)00016-j
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problemAnnals of Operations Research, 1993
- Robust taboo search for the quadratic assignment problemParallel Computing, 1991
- Tabu Search—Part IIINFORMS Journal on Computing, 1990
- Tabu Search—Part IINFORMS Journal on Computing, 1989
- Improving the Distribution of Industrial Gases with an On-Line Computerized Routing and Scheduling OptimizerInforms Journal on Applied Analytics, 1983
- Routing and scheduling of vehicles and crewsComputers & Operations Research, 1983
- PLANNING FOR TRUCK FLEET SIZE IN THE PRESENCE OF A COMMON‐CARRIER OPTIONDecision Sciences, 1983
- Classification in vehicle routing and schedulingNetworks, 1981
- The design and analysis of heuristicsNetworks, 1981
- Matching, Euler tours and the Chinese postmanMathematical Programming, 1973