SIMULATED ANNEALING ALGORITHM FOR VEHICLE ROUTING IN A OUTSOURCING COMPANY

SA FOR PRV IN A OUTSOURCING COMPANY

Authors

  • Cindy Cristina Pinheiro UFSC
  • Christiane Wenck Nogueira Fernandes UFSC
  • Silvia Lopes de Sena Taglialenha Universidade Federal de Santa Catarina

Keywords:

outsourcing, Vehicle routing problem, Simulated annealing algorithm

Abstract

In an increasingly competitive economic environment companies have been invested in innovation and cost reduction. The use of logistics solutions has shown a good alternative to reduce maintenance costs and improving service levels. The use of vehicle routing methods can be considered as one such instrument. In this paper was presented a maximum time-constrained vehicle routing problem, which identifying and implementing in C/C++ an algorithm that uses mathematic programming, heuristic and metaheuristic techniques. The adopted method obtains a solution that reduces eight to six steps performed by the company. In addition, a Simulated Annealing simulation improves 10.71% over an initial solution considered with the next closest item heuristic and 13.80% over an initial solution used in the exact method.

Downloads

Download data is not yet available.

Author Biography

  • Silvia Lopes de Sena Taglialenha, Universidade Federal de Santa Catarina

    As a graduate at UNESP (Presidente Prudente) - University of State São Paulo she ranked first in her class of over 40 students.  Upon her graduation with a B.S. degree in Mathematical, she was awarded fellowships the CNPq for study at USP with specialization in harmonic analysis, and for obtain her PhD degree at UNESP  (Ilha Solteria). Upon receive their PhD degree, she joined the Federal University of Santa Catarina, where Dr. Taglialenha’s research has extended into a variety of areas, including integer programming, applications of operations research in economic theory, logistics and management science and skilled in Mathematical Modeling, Metaheuristics and Operations Research.

References

AVCI, M.; TOPALOGLU, S. An adaptive local search algorithm for vehicle routing problem with simultaneous and mixed pickups and deliveries. Computers & Industrial Engineering, 83, p. 15-29, 2015.
BALDACCI, R.; BATTARRA, M.; VIGO, D. Routing a heterogeneous fleet of vehicles. B.L. Golden, S. Raghavan, E.A. Wasil (Eds.), The Vehicle Routing Problem: Latest Advances and New Challenges, Springer, New York, p. 3-27, 2008.
BALLOU, R. H. Business Logistics Management. Prentice Hall, 5th Edition, New Jersey, 2003.
BENOIT, A. A.; RIVARD, S.; PATRY, M. A transaction cost model of IT outsourcing. Information & Management, v. 41 (7), 2004, Pages 921-932, ISSN 0378-7206, https://doi.org/10.1016/j.im.2003.09.001.
BOWERSOX, D. J.; CLOSS, D. J. Logística empresarial: o processo de integração da cadeia de suprimento. São Paulo: Atlas, 2011. 594 p.
BRAEKERS, K.; RAMAEKERS, K.; NIEUWENHUYSE, I.V. The vehicle routing problem: State of the art classification and review. Computers & Industrial Engineering, v. 99, p. 300-313, 2016.
CORDEAU, J. F. et al. Vehicle routing handbooks in operations research and management science. Amsterdam, Elsevier, v. 14, p. 367-428, 2007.
DANTZIG, G. B.; RAMSER, J. H. The truck dispatching problem. Management Science. v. 6, p. 80-91, out. 1959.
EGLESE. R.W. Simulated annealing: A tool for operational research. European Journal of Operational Research, v. 46, n. 3, p. 271-281, 1990.
FISHER, M. L.; JAIKUMAR, R. A generalized assignment heuristic for vehicle routing. Networks, v. 11, n. 2, p. 109-124, 1981.
GENDREAU, M; POTVIN, J. Y. Handbook of metaheuristics. 2 ed. New York: Springer, 2010.
GEODESIX, Travel function. Disponível em: http://www.calvert.ch/geodesix/help/functions/travel-function/. Acesso em: 11 mar. 2019.
GIL, A. C. Métodos e técnicas de pesquisa social. 6 ed. São Paulo: Atlas, 2008. 200 p.
GOLDBARG, M. C.; LUNA, H. P. L. Otimização Combinatória e Programação Linear: modelos e algoritmos. 2 ed. Rio de Janeiro: Elsevier, 2005.
GOLDEN, B. L.; ASSAD, A. A. Perspectives on vehicle routing: exciting new developments. Operations Research, v. 34, n. 5, p. 803-810, 1986.
GOLDEN, B. L. et al. The Vehicle Routing Problem: Latest Advances and New Challenges. New York: Springer Science & Business Media, 2008. 591 p.
KIRKPATRICK, C. D.; GELATT, C. D.; VECCHI, M. P. Optimization by Simulated Annealing. Science, v. 220, n. 4598, p. 671-680, 1983.
LACITY, M.C.; KHAN, S.A.; WILLCOCKS, L.P. A review of the IT outsourcing literature: insights for practice. J. Strateg. Inf. Syst., 18 (3), p. 130-146, 2009.
LAPORTE, G. et al. Classical and modern heuristics for the vehicle routing problem. International transactions in operational research, 7, (4), p. 285-300, 2000.
OSMAN, I. H. Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Annals of Operations Research, v. 41(4), pp 421–451, 1993.
OSMAN, I.H.; LAPORTE, G. Metaheuristics: A bibliography. Annals of Operations Research, v. 63, p. 511-623, 1996.
PILLAC, V. et al. A review of dynamic vehicle routing problems. European Journal of Operational Research, v. 225, n. 1, p. 1-11, 2013.
TABOADA, C. Logística: o diferencial da empresa competitiva. Revista FAE Bussiness, Curitiba, n. 2, jun. 2002.
TOTH, P.; VIGO, D. Vehicle routing: problems, methods, and applications. 2 ed. Philadelphia: Society for Industrial and Applied Mathematics, 2014. 481 p.
WOLSEY, L. Interger programming. New York: Wiley-Interscience, 1998. 264 p.

Published

2019-10-29

How to Cite

SIMULATED ANNEALING ALGORITHM FOR VEHICLE ROUTING IN A OUTSOURCING COMPANY: SA FOR PRV IN A OUTSOURCING COMPANY. (2019). Colloquium Exactarum. ISSN: 2178-8332, 11(3), 1-16. https://journal.unoeste.br/index.php/ce/article/view/3217

Similar Articles

1-10 of 29

You may also start an advanced similarity search for this article.