Metaheuristic approaches to a vehicle scheduling problem in sugar beet transportation

  • Ana Anokić
  • Zorica StanimirovićEmail author
  • Đorđe Stakić
  • Tatjana Davidović
Original paper


A variant of vehicle scheduling problem (VSP) arising from the sugar beet transportation in a sugar factory in Serbia is introduced. The objective of the considered VSP is to minimize the required transportation time under problem-specific constraints. The problem is formulated as a mixed integer linear program (MILP). Within the framework of commercial CPLEX solver the proposed MILP model was able to produce optimal solutions for small size problem instances. Therefore, two metaheuristic methods, variable neighborhood search (VNS) and greedy randomized adaptive search procedure (GRASP), are designed to solve problem instances of larger dimensions. The proposed GRASP and VNS are evaluated and compared against CPLEX and each other on the set of real-life and generated problem instances. Computational results show that VNS is superior method with respect to the solution quality, while GRASP is able to find high quality solutions within very short running times.


Optimization in transport Vehicle scheduling problem Mixed integer linear programming Variable neighborhood search Greedy Randomized Adaptive Search Procedure 

Mathematics Subject Classification

90B06 68T20 90C11 



The authors also state that the research conducted in this paper was partially supported by Serbian Ministry of Education, Science and Technological Development under the Grants Nos. 174010 and 174033.


  1. Atkinson J (1998) A greedy randomised search heuristic for time-constrained vehicle scheduling and the incorporation of a learning strategy. J Oper Res Soc 49:700–708CrossRefGoogle Scholar
  2. Bodin L, Golden B (1981) Classification in vehicle routing and scheduling. Networks 11(2):97–108CrossRefGoogle Scholar
  3. Bula G, Prodhon C, Gonzalez FA, Afsar H, Velasco N (2016) Variable neighborhood search to solve the vehicle routing problem for hazardous materials transportation. J Hazard Mater 324(part B):472–480Google Scholar
  4. Bunte S, Kliewer N (2009) An overview on vehicle scheduling models. Public Transp 1(4):299–317CrossRefGoogle Scholar
  5. Carreto C, Baker B (2002) A GRASP interactive approach to the vehicle routing problem with backhauls. In: Ribeiro C, Hasen P (eds) Essays Surv Metaheur. Springer, New York, pp 185–199CrossRefGoogle Scholar
  6. Cheikh M, Ratli M, Mkaouar O, Jarboui B (2015) A variable neighborhood search algorithm for the vehicle routing problem with multiple trips. Electron Notes Discrete Math 47:277–284CrossRefGoogle Scholar
  7. Dantzig G, Fulkerson D (1954) Minimizing the number of tankers to meet a fixed schedule. Nav Res Logist Q 1(3):217–222CrossRefGoogle Scholar
  8. de Armas J, Melián-Batista B (2015) Variable neighborhood search for a dynamic rich vehicle routing problem with time windows. Comput Ind Eng 85:120–131CrossRefGoogle Scholar
  9. Duarte A, Laguna M, Martí R (2018) Greedy randomized adaptive search procedures. In: Metaheuristics for business analytics. Springer, Cham, pp 57–83Google Scholar
  10. Duhamel C, Lacomme P, Prins C, Prodhon C (2010) A GRASP × ELS approach for the capacitated location-routing problem. Comput Oper Res 37(11):1912–1923CrossRefGoogle Scholar
  11. Feo S, Resende M (1989) A probabilistic heuristic for a computationally diffcult set covering problem. Oper Res Lett 8:67–71CrossRefGoogle Scholar
  12. Feo S, Resende M (1995) Greedy randomized adaptive search procedures. J Global Optim 6:109–133CrossRefGoogle Scholar
  13. Hansen P, Mladenović N (2001) Variable neighborhood search: principles and applications. Eur J Oper Res 130(3):449–467CrossRefGoogle Scholar
  14. Hansen P, Mladenović N (2014) Variable neighborhood search. In: Burke EK, Graham RD (eds) Search methodologies: introductory tutorials in optimization and decision support techniques. Springer, New York, pp 313–337CrossRefGoogle Scholar
  15. Hansen P, Mladenović N, Pérez JA (2010) Variable neighbourhood search: methods and applications. Ann Oper Res 175(1):367–407CrossRefGoogle Scholar
  16. Higgins A (2006) Scheduling of road vehicles in sugarcane transport: a case study at an Australian sugar mill. Eur J Oper Res 170(3):987–1000CrossRefGoogle Scholar
  17. Ho S, Szeto W (2016) GRASP with path relinking for the selective pickup and delivery problem. Expert Syst Appl 51:14–25CrossRefGoogle Scholar
  18. Kontoravdis G, Bard J (1995) A GRASP for the vehicle routing problem with time windows. ORSA J Comput 7:10–23CrossRefGoogle Scholar
  19. Liu S, Chen A (2012) Variable neighborhood search for the inventory routing and scheduling problem in a supply chain. Expert Syst Appl 39(4):4149–4159CrossRefGoogle Scholar
  20. Macedo R, Alves C, Hanafi S, Jarboui B, Mladenović N, Ramos B, de Carvalho J (2015) Skewed general variable neighborhood search for the location routing scheduling problem. Comput Oper Res 61:143–152CrossRefGoogle Scholar
  21. Marinakis Y (2012) Multiple phase neighborhood search-GRASP for the capacitated vehicle routing problem. Expert Syst Appl 39(8):6807–6815CrossRefGoogle Scholar
  22. Milan E, Fernandez S, Aragones L (2006) Sugar cane transportation in Cuba, a case study. Eur J Oper Res 174(1):374–386CrossRefGoogle Scholar
  23. Mladenović N, Hansen P (1997) Variable neighborhood search. Comput Oper Res 24(11):1097–1100CrossRefGoogle Scholar
  24. Park C, Seo J (2012) A GRASP approach to transporter scheduling and routing at a shipyard. Comput Ind Eng 63(2):390–399CrossRefGoogle Scholar
  25. Pinedo M (2012) Scheduling theory, algorithms and systems, 4th edn. Springer, BerlinGoogle Scholar
  26. Prais M, Ribeiro C (2000) Reactive GRASP: an application to a matrix decomposition problem in TDMA traffic assignment. INFORMS J Comput 12(3):164–176CrossRefGoogle Scholar
  27. Prins C (2009) A GRASP × evolutionary local search hybrid for the vehicle routing problem. In: Francisco B, Tavares J (eds) Bio-inspired algorithms for the vehicle routing problem. Springer, Berlin, pp 35–53CrossRefGoogle Scholar
  28. Raff S (1983) Routing and scheduling of vehicles and crews: the state of the art. Comput Oper Res 10(2):63–211CrossRefGoogle Scholar
  29. Resende M, Ribeiro C (2014) GRASP: Greedy randomized adaptive search procedures. In: Burke E, Kendall G (eds) Search methodologies—introductory tutorials in optimization and decision support systems. Springer, Berlin, pp 287–312Google Scholar
  30. Resende M, Ribeiro C (2019) Greedy randomized adaptive search procedures: advances and extensions. In: Gendreau M, Potvin JY (eds) Handbook of metaheuristics. Springer, Berlin, pp 169–220CrossRefGoogle Scholar
  31. Thuankaewsing S, Khamjan S, Piewthongngam K, Pathumnakul S (2015) Harvest scheduling algorithm to equalize supplier benefits: a case study from the Thai sugar cane industry. Comput Electron Agric 110:42–55CrossRefGoogle Scholar
  32. Wassan N, Wassan N, Nagy G, Salhi S (2017) The multiple trip vehicle routing problem with backhauls: formulation and a two-level variable neighbourhood search. Comput Oper Res 78:454–467CrossRefGoogle Scholar

Copyright information

© Springer-Verlag GmbH Germany, part of Springer Nature 2019

Authors and Affiliations

  1. 1.ZemunSerbia
  2. 2.Faculty of MathematicsUniversity of BelgradeBelgradeSerbia
  3. 3.Faculty of EconomicsUniversity of BelgradeBelgradeSerbia
  4. 4.Mathematical Institute of the Serbian Academy of Science and ArtsBelgradeSerbia

Personalised recommendations