Skip to main content
SpringerLink
Log in

An optimization approach for designing routes in metrological control services: a case study

  • Published:
Flexible Services and Manufacturing Journal Aims and scope Submit manuscript

Abstract

This paper is the first to tackle the problem of designing routes in service companies that are responsible for the metrological control of measuring equipments at customer sites. This real-world problem belongs to the well-known Rich Vehicle Routing Problems which combine multiple attributes that distinguish them from traditional vehicle routing problems. The attributes include fixed heterogeneous fleet of vehicles, time windows for customers and depot, resource synchronization between tours, driver-customer and vehicle-customer constraints, customer priorities and unserved customers. This routing and scheduling problem is modeled with linear programming techniques and solved by a variable neighborhood descent metaheuristic based on a tabu search algorithm with a holding list. A real-life case study faced by a company in the region of Andalusia (Spain) is also presented in this work. The performance of the metaheuristic is compared with the literature for the standard fixed heterogeneous vehicle routing problem. Results obtained on a real case instance improve the solutions implemented by the company.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1

Similar content being viewed by others

References

  • Baldacci R, Battarra M, Vigo D (2008) Routing a heterogeneous fleet of vehicles. In: The vehicle routing problem: latest advances and new challenges. Springer, New York, pp 3–27

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

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  • Caceres-Cruz J, Arias P, Guimarans D, Riera D, Juan AA (2015) Rich vehicle routing problem: survey. ACM Comput Surv 47(2):32

    Google Scholar 

  • Cappanera P, Gouveia L, Scutellà MG (2011) The skill vehicle routing problem. In: Network optimization. Springer, Berlin, pp 354–364

    Google Scholar 

  • Cornillier F, Boctor FF, Laporte G, Renaud J (2009) The petrol station replenishment problem with time windows. Comput Oper Res 36(3):919–935

    Article  Google Scholar 

  • Croes GA (1958) A method for solving traveling-salesman problems. Oper Res 6(6):791–812

    Article  MathSciNet  Google Scholar 

  • De Armas J, Melián-Batista B, Moreno-Pérez JA, Brito J (2015) GVNS for a real-world rich vehicle routing problem with time windows. Eng Appl Artif Intell 42:45–56

    Article  Google Scholar 

  • Drexl M (2012) Synchronization in vehicle routing: a survey of VRPs with multiple synchronization constraints. Transp Sci 46(3):297–316

    Article  Google Scholar 

  • Hansen P, Mladenovic N (2003) A tutorial on variable neighborhood search. Groupe d’études et de recherche en analyse des décisions, HEC Montréal

  • Hansen P, Mladenović N, Pérez JAM (2010) Variable neighborhood search: methods and applications. Ann Oper Res 175(1):367–407

    Article  MathSciNet  Google Scholar 

  • Irnich S, Schneider M, Vigo D (2014) Four variants of the vehicle routing problem. In: Vehicle routing: problems, methods, and applications, vol 18, pp 241–271

    Chapter  Google Scholar 

  • Jiang J, Ng KM, Poh KL, Teo KM (2014) Vehicle routing problem with a heterogeneous fleet and time windows. Expert Syst Appl 41(8):3748–3760

    Article  Google Scholar 

  • Kindervater GAP, Savelsbergh MWP (1997) Vehicle routing: handling edge exchanges. In: Local search in combinatorial optimization Wiley, Chichester, pp. 337–360

  • Koç Ç, Bektaş T, Jabali O, Laporte G (2015) A hybrid evolutionary algorithm for heterogeneous fleet vehicle routing problems with time windows. Comput Oper Res 64:11–27

    Article  MathSciNet  Google Scholar 

  • Koç Ç, Bektaş T, Jabali O, Laporte G (2016) Thirty years of heterogeneous vehicle routing. Eur J Oper Res 249(1):1–21

    Article  MathSciNet  Google Scholar 

  • Lahyani R, Khemakhem M, Semet F (2015) Rich vehicle routing problems: from a taxonomy to a definition. Eur J Oper Res 241(1):1–14

    Article  MathSciNet  Google Scholar 

  • Lau HC, Sim M, Teo KM (2003) Vehicle routing problem with time windows and a limited number of vehicles. Eur J Oper Res 148:559–569

    Article  MathSciNet  Google Scholar 

  • Lim A, Zhang X (2007) A two-stage heuristic with ejection pools and generalized ejection chains for the vehicle routing problem with time windows. INFORMS J Comput 19(3):443–457

    Article  MathSciNet  Google Scholar 

  • Lin S (1965) Computer solutions of the traveling salesman problem. Bell Syst Tech J 44(10):2245–2269

    Article  MathSciNet  Google Scholar 

  • Liu FH, Shen SY (1999) The fleet size and mix vehicle routing problem with time windows. J Oper Res Soc 50(7):721–732

    Article  Google Scholar 

  • Mladenović N, Hansen P (1997) Variable neighborhood search. Comput Oper Res 24(11):1097–1100

    Article  MathSciNet  Google Scholar 

  • Mole RH, Jameson SR (1976) A sequential route-building algorithm employing a generalised savings criterion. J Oper Res Soc 27(2):503–511

    Article  Google Scholar 

  • Oppen J, Løkketangen A (2008) A tabu search approach for the livestock collection problem. Comput Oper Res 35(10):3213–3229

    Article  Google Scholar 

  • Paraskevopoulos DC, Repoussis PP, Tarantilis CD, Ioannou G, Prastacos GP (2008) A reactive variable neighborhood tabu search for the heterogeneous fleet vehicle routing problem with time windows. J Heuristics 14(5):425–455

    Article  Google Scholar 

  • Rieck J, Zimmermann J (2010) A new mixed integer linear model for a rich vehicle routing problem with docking constraints. Ann Oper Res 181(1):337–358

    Article  MathSciNet  Google Scholar 

  • Savelsbergh MW (1992) The vehicle routing problem with time windows: minimizing route duration. ORSA journal on computing 4(2):146–154

    Article  Google Scholar 

  • Solomon MM (1987) Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper Res 35(2):254–265

    Article  MathSciNet  Google Scholar 

  • Taillard ED (1999) A heuristic column generation method for the heterogeneous fleet VRP. RAIRO Oper Res 33(1):1–14

    Article  MathSciNet  Google Scholar 

  • Taillard É, Badeau P, Gendreau M, Guertin F, Potvin JY (1997) A tabu search heuristic for the vehicle routing problem with soft time windows. Transp Sci 31(2):170–186

    Article  Google Scholar 

  • Toth P, Vigo D (eds) (2014) Vehicle routing: problems, methods, and applications, vol 18. SIAM, Philadelphia

    MATH  Google Scholar 

  • Vidal T, Crainic TG, Gendreau M, Prins C (2013) Heuristics for multi-attribute vehicle routing problems: a survey and synthesis. Eur J Oper Res 231(1):1–21

    Article  MathSciNet  Google Scholar 

  • Yuan S, Skinner B, Huang S, Liu D (2013) A new crossover approach for solving the multiple travelling salesmen problem using genetic algorithms. Eur J Oper Res 228(1):72–82

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

This research has been fully funded by the Andalusia Government through Grants P10-TEP-6332.

Author information

Authors and Affiliations

  1. Escuela Superior de Ingeniería, Universidad de Sevilla, Camino de los Descubrimientos s/n., 41092, Seville, Spain

    Jose Carlos Molina, Ignacio Eguia & Jesus Racero

Authors
  1. Jose Carlos Molina
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ignacio Eguia
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jesus Racero
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jose Carlos Molina.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Molina, J.C., Eguia, I. & Racero, J. An optimization approach for designing routes in metrological control services: a case study. Flex Serv Manuf J 30, 924–952 (2018). https://doi.org/10.1007/s10696-016-9265-3

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10696-016-9265-3

Keywords

Search

Navigation