Skip to main content
SpringerLink
Log in

Logistic Management Employing Tabu Search and Neural Network Algorithms: A Case Study

  • Conference paper
  • First Online:
Managing Complexity

Part of the book series: Lecture Notes in Management and Industrial Engineering ((LNMIE))

  • 1590 Accesses

Abstract

This paper presents a real case study of a routing problem in a Spanish firm leader in the fresh food industry. The main objective is to improve profits and competitiveness based on logistic operations, minimizing the transportation cost employing the tabu search and neural network meta-heuristics algorithms. The simplest case considered is the Traveling Salesman Problem (TSP). The real case study presented in this paper there are capacity restrictions and different demands at each node, therefore the problem is solved as a Capacitated Vehicle Routing Problem (CVRP).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Baldacci R, Toth P, Vigo D (2007) Recent advances in vehicle routing exact algorithms, 4OR. Q J Oper Res 5:269–298

    Article  MATH  MathSciNet  Google Scholar 

  2. Bektas T (2006) The multiple traveling salesman problem: an overview of formulations and solution procedures. Omega 34:209–219.

    Google Scholar 

  3. Brandão J (2011) A tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem. Comput Oper Res 38:140–151

    Article  MATH  MathSciNet  Google Scholar 

  4. Cordeau JF, Laporte G (2004) Tabu search heuristics for the vehicle routing problem. In: Rego C, Alidaee B (eds) Metaheuristic optimization via memory and evolution: Tabu search and scatter search. Kluwer, Boston, pp 145–163

    Google Scholar 

  5. Euchi J, Chabchoub H (2010) A hybrid Tabu Search to solve the heterogeneous fixed fleet vehicle routing problem. Logist Res 2:3–11

    Article  Google Scholar 

  6. Faulin J (2003) Applying MIXALG procedure in a routing problem to optimize food product delivery. Omega 31:387–395

    Article  Google Scholar 

  7. Faulin J, Juan A, Lera F, Grasman C (2011) Solving the capacitated vehicle routing problem with environmental criteria based on real estimations in road transportation: a case study. Proced-Soc Behav Sci 20:323–334

    Article  Google Scholar 

  8. Ganesh K, Nallathambi AS, Narendran TT (2007) Variants, solution approaches and applications for vehicle routing problems in supply chain: agile framework and comprehensive review. Int J Agil Syst Manage 2:50–75

    Google Scholar 

  9. Gendreau M, Hertz A, Laporte G (1994) A tabu search heuristic for the vehicle routing problem. Manage Sci 40:1276–1290

    Article  MATH  Google Scholar 

  10. Hsu CL, Feng S (2003) Vehicle routing problem for distributing refrigerated food. J East Asia Soc Transp Stud 5:2261–2272

    Google Scholar 

  11. Leung KS, Jin HD, Xu ZB (2004) An expanding self-organizing neural network for the traveling salesman problem. Neurocomputing 62:267–292

    Article  Google Scholar 

  12. Ma H, Cheang B, Lim A, Zhan L, Zhu Y (2012) An investigation into the vehicle routing problem with time windows and link capacity constraints. Omega 40:336–347

    Article  Google Scholar 

  13. Miller CE, Tucker AW, Zemlin RA (1960) Integer programming formulation of traveling salesman problems. J Assoc Comput Mach 7:326–329

    Article  MATH  MathSciNet  Google Scholar 

  14. Prindezis N, Kiranoudis CT, Kouris DM (2003) A business-to-business fleet management service provider for central food market enterprises. J Food Eng 60:203–210

    Article  Google Scholar 

  15. Sivanandam SN, Dumathi S, Deepa SN (2006) Introduction to neural networks using MATLAB 6.0. McGraw Hill, Delhi, pp 487–512

    Google Scholar 

  16. Tarantilis CD, Kiranoudis CT (2001) A meta-heuristic algorithm for the efficient distribution of perishable foods. J Food Eng 50:1–9

    Article  Google Scholar 

  17. Tarantilis CD, Kiranoudis CT (2002) Distribution of fresh meat. J Food Eng 51:85–91

    Article  Google Scholar 

  18. Toth P, Vigo D (2002) Models, relaxations and exact approaches for the capacitated vehicle routing problem. Discret Appl Math 123:487–512

    Article  MATH  MathSciNet  Google Scholar 

Download references

Acknowledgements

The work reported here with has been financially supported by the Spanish Ministerio de Economía y Competitividad, under Research Grant DPI2012-31579.

Author information

Authors and Affiliations

  1. Dpto. de Administración de Empresas, Facultad de Derecho y Ciencias Sociales, Universidad de Castilla-La Mancha, 13071, Ciudad Real, Spain

    Isidro Peña García-Pardo

  2. INGENIUM GROUP, ETSI Industriales, Universidad de Castilla-La Mancha, 13071, Ciudad Real, Spain

    Fausto Pedro García Márquez

Authors
  1. Isidro Peña García-Pardo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Fausto Pedro García Márquez
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Isidro Peña García-Pardo .

Editor information

Editors and Affiliations

  1. INSISOC, University of Valladolid, Valladolid, Spain

    Cesáreo Hernández

  2. INSISOC, University of Valladolid, Valladolid, Spain

    Adolfo López-Paredes

  3. INSISOC, University of Valladolid, Valladolid, Spain

    José M. Pérez-Ríos

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

García-Pardo, I., García Márquez, F. (2014). Logistic Management Employing Tabu Search and Neural Network Algorithms: A Case Study. In: Hernández, C., López-Paredes, A., Pérez-Ríos, J. (eds) Managing Complexity. Lecture Notes in Management and Industrial Engineering. Springer, Cham. https://doi.org/10.1007/978-3-319-04705-8_26

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-04705-8_26

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-04704-1

  • Online ISBN: 978-3-319-04705-8

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation