![](bg6.png)
solution to generate a set of routes that optimize the
objective function model, through successive
neighborhood generation. The flexibility of Tabu
Search, allowed three neighborhood generations
mechanisms, intending to diversify the process of
generating routes for the model. The experiments
indicate as better results the ones where all politics
were used in association. The robustness and
flexibility of Tabu Search makes possible to
diversify and improve the process of search in space.
The usage of varied neighborhood generation
politics and the refinement of these politics,
according to the objective model, make possible to
expect that quality solutions can be found.
REFERENCES
Ballou, R.H. 2001 Gerenciamento da cadeia de
Suprimentos – Planejamento, Organização e Logística
Empresarial, 4Ed, Porto Alegre: Bookman
Barbarasogju,G., Ozgur, D. 1999. “A tabu search
algorithm for the vehicle routing problem”, Computers
& Operations Research 26, 255-270
Bodin, L.D, Golden, B.L., Assad, A.A., Ball, M.O. 1983
“Routing and Scheduling of vehicles and crews: The
State of the Art”. Computers and Operations Research
10, 69-211
Clarke, G, Wright, J.W. 1964 “Scheduling of vehicles
from a central depot to a number of delivery points”.
Operations Research 12: 568-581
Christofides, N.; Mingozzi, A.; Toth, P.1979. The Vehicle
Routing Problem.In: Christofides, Nicos.
Combinatorial Optimization UMI, 1979
Christofides, N.,Eilon, S. 1969 “An Algorithm for the
vehicle Dispatching Problem”. Operational Research
Quartely, Vol. 20, N.3
Cook,W.J, Cunningham, W.H, Pulleyblank, W.R,
Schrijver, A.1998. Combinatorial Optimization.
Willey
Cordeau, J-F., Gendreau, M., Laporte, G., Potvin, J.-Y., &
Semet, F. 2002. A guide to vehicle routing heuristics.
Journal of the Operational Research Society, 53,512-
522
Desrochers, M., Verhoog, T.W. 1989. “A Matching Based
savings Algorithm for the Vehicle Routing Problem”
Cahier du GERAD G-89-04. École des Haustes Études
Commerciales de Montréal
Gillet, B.E, Miller, L.R.1974 “A heuristic algorithm for
the vehicle dispatch problem” Operations Research 22,
240-349.
Gendreau, M.; Laporte, G., Potvin, J.-Y. XXXX
“Metaheuristics for te Vehicle Routing Problem” Les
Cashiers du GERAD
Glover,F.1989 “Tabu Search – parte 1”. ORSA Journal on
Computing v.1, n.3.
Glover,F., Laguna,M..1997 Tabu Search. Kluwer
Academic Publishers.
Ho, S.C.,Haugland, D. 2004 “A tabu search heuristic for
the vehicle routing problem with time windows and
split deliveries” Computers & Operations Research
31, 1947-1964
Laporte, G. 1992. “The Vehicle Routing Problem: An
overview of exact and approximate algorithms”.
European Journal of operational Research 59,345-458
Laporte, G., Semet, F. 1998 "Classical Heuristics for the
Vehicle Routing Problem". Les Cahiers du GERAD,
G98-54, Group for Research in Decision Analysis,
Montreal, Canada. 1998
Laporte,G., Gendreau,M., Potvin,J., Semet, F.2000
“Classical and modern heuristics for the vehicle
routing problem” Intl.Trans. in Op. Res 7,285-300
Lentra,J.K, Rinnoy K., G. 1981 “Complexity of Vehicle
Routing and Scheduling Problems” Networks 11,221-
227
Mole,R.H, Jamenson, S.R. 1976 “A sequential route-
building algorithm employing a generalized savings
criterion” Operations Research Quarterly 27,503-511
Nelson, M.D, Nygard, K.E., Griffin, J.H.,Shreve, W.E.
1985 “Implementing Techniques for the vehicle
routing problem” Computers & Operations Research
12,273-283
Osman, I; Laporte,G.1996 Metaheuristics: A bibliography.
Annals of Operations Research 63, 513-628.
Tarantilis, C.D; Ioannou, G; Prastacos, G. 2005
“Advanced vehicle routing algorithms for complex
operations management problems” Journal of Food
Engineerig, 70:455-471.
Thangiah, S.R., Petrovik, P. 1997 Introduction to Genetic
Heuristics and vehicle Routing Problems with
Complex Constraints.In: Woodruff, David, L.
Advances in Computacional and Stochastic
Optimization, Logic programming , and Heuristic
search: Interfaces in Computer Science and Operations
research. Kluwer Academic Publishers.
Toth, P., Vigo, D. 2002 “Models, relaxations and exact
approachs for the capacitated vehicle routing problem”
Discrete Applied Mathematics 123, 487-512
Tyagi, M. 1968 “A Pratical Method for the Truck
Dispatching Problem”. J. of the Operations Research
Society of Japan, 10,76-92
Viana, Valdisio. 1998 Meta-heurísticas e Programação
Paralela em Otimização Combinatória. Fortaleza:
EUFC
Xu, J., Kelly, James P. 1996 “A Network Flow-Based
Tabu Search Heuristic for the Vehicle Routing
Problem” Transportation Science 30, 379-393.
A SOLUTION TO THE VEHICLE ROUTING PROBLEM USING TABU SEARCH
81