Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
SpringerLink
Log in

Designing routes for WEEE collection: the vehicle routing problem with split loads and date windows

  • Published:
Journal of Heuristics Aims and scope Submit manuscript

Abstract

This paper presents an integer programming model and describes a GRASP based algorithm to solve a vehicle routing and scheduling problem for the collection of Waste of Electric and Electronic Equipment (WEEE). The difficulty of this problem arises from the fact that it is characterized by four variants of the vehicle routing problem that have been studied independently in the literature, but not together. The experimental analysis on a large set of randomly-generated instances shows the good performance of the proposed algorithm. Moreover, computational results using real data show that the method outperforms real existing approaches to reverse logistics.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Aleman, R.A., Zhang, X., Hill, R.R.: An adaptive memory algorithm for the split delivery vehicle routing problem. J. Heuristics 16, 441–473 (2010)

    Article  MATH  Google Scholar 

  • Alonso, F., Alvarez, M.J., Beasley, J.E.: A tabu search algorithm for the periodic vehicle routing problem with multiple vehicle trips and accessibility restrictions. J. Oper. Res. Soc. 59, 963–976 (2007)

    Article  Google Scholar 

  • Álvarez, A., Pacheco, J., Angel-Bello, F., Garcia, I.: Un problema de distribución de productos alimenticios con flexibilidad en la fecha de entrega. In: VI Congreso de Metaheuristicos, Algoritmos Evolutivos y Bioinspirados, Spain (2009)

    Google Scholar 

  • Battarra, M., Monaci, M., Vigo, D.: An adaptive guidance approach for the heuristic solution of a minimum multiple trip vehicle routing problem. Comput. Oper. Res. 36, 3041–3050 (2009)

    Article  MATH  Google Scholar 

  • Belfiore, P., Yoshida-Yoshizaki, H.T.: Scatter search for a real-life heterogeneous fleet vehicle routing problem with time windows and split deliveries in Brazil. Eur. J. Oper. Res. 199, 750–758 (2008)

    Article  Google Scholar 

  • Beullens, P., Van Wassenhove, L., Van Oudheusden, D.: Collection and vehicle routing issues in reverse logistics. In: Dekker, Fleischmann, Inderfurth, Van Wassenhove (eds.) Reverse Logistics, Quantitative Models for Closed-Loop Supply Chains 2004, pp. 275–291. Springer, Dordrecht (2004)

    Google Scholar 

  • Blanc, I., Van Krieken, M., Krikke, H., Fleuren, H.: Vehicle routing concepts in the closed-loop container network of ARN—a case study. OR Spektrum 28, 53–71 (2006)

    Article  MATH  Google Scholar 

  • Brandão, J., Mercer, A.: The multi-trip vehicle routing problem. J. Oper. Res. Soc. 49, 799–805 (1998)

    MATH  Google Scholar 

  • Dror, M., Trudeau, P.: Savings by split delivery routing. Transp. Sci. 23, 141–145 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  • Eksioglu, B., Volkan-Vural, A., Reisman, A.: The vehicle routing problem: a taxonomic review. Comput. Ind. Eng. 57, 1472–1483 (2009)

    Article  Google Scholar 

  • European Parliament the Council and the Commission: Directive 2002/96/EC of 27 January 2003 on waste electrical and electronic equipment (WEEE). Off. J. Eur. Union L37, 24–39 (2003). http://www2.uca.es/grup-invest/cit/Union%20Europea_archivos/WEEE_ingles.pdf. Accessed 15 January 2009

    Google Scholar 

  • Feo, T.A., Resende, M.G.C.: A probabilistic heuristic for a computationally difficult set covering problem. Oper. Res. Lett. 8, 67–71 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  • Feo, T.A., Resende, M.G.C.: Greedy randomized adaptive search procedures. J. Glob. Optim. 6, 109–133 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  • Golden, B.L., Assad, A., Levy, L., Gheysens, F.: The fleet size and mix vehicle routing problem. Comput. Oper. Res. 11, 49–65 (1984)

    Article  MATH  Google Scholar 

  • González, B., Adenso-Díaz, B.: A scatter search approach to the optimum disassembly sequence problem. Comput. Oper. Res. 33, 1776–1793 (2006)

    Article  MATH  Google Scholar 

  • Imran, A., Salhi, S., Wassan, N.: A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem. Eur. J. Oper. Res. 197, 509–518 (2009)

    Article  MATH  Google Scholar 

  • Kim, H., Jaehwan, J., Lee, K.D.: Vehicle routing in reverse logistics for recycling end-of-life consumer electronic goods in South Korea. Transp. Res. D 14, 291–299 (2009)

    Article  Google Scholar 

  • Mar-Ortiz, J., Adenso-Díaz, B., González-Velarde, J.L.: Design of a recovery network for WEEE collection: the case of Galicia, Spain. J. Oper. Res. Soc. (2010). doi:10.1057/jors.2010.114

    Google Scholar 

  • Mitra, S.: A parallel clustering technique for the vehicle routing problem with split deliveries and pickups. J. Oper. Res. Soc. 59, 1532–1546 (2008)

    Article  MATH  Google Scholar 

  • Nag, B., Golden, B.L., Assad, A.: Vehicle routing with site dependencies. In: Golden, B.L., Assad, A. (eds.) Vehicle Routing: Methods and Studies. Studies in Management Science and Systems, vol. 16, pp. 149–159. North-Holland, Amsterdam (1988)

    Google Scholar 

  • Schultmann, F., Zumkeller, M., Rentz, O.: Modeling reverse logistic tasks within closed-loop supply chains: An example from the automotive industry. Eur. J. Oper. Res. 171, 1033–1050 (2006)

    Article  MATH  Google Scholar 

  • Taillard, E.: Parallel iterative search methods for vehicle routing problems. Networks 23, 661–673 (1993)

    Article  MATH  Google Scholar 

  • Taillard, E., Laporte, G., Gendreau, M.: Vehicle routing problem with multiple use of vehicles. J. Oper. Res. Soc. 47, 1065–1070 (1996)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Engineering, Universidad Autónoma de Tamaulipas, 89140, Tampico, Mexico

    Julio Mar-Ortiz

  2. Tecnológico de Monterrey, 64849, Monterrey, Nuevo León, Mexico

    Julio Mar-Ortiz & José Luis González-Velarde

  3. Engineering School, Universidad de Oviedo, 33203, Gijón, Spain

    Belarmino Adenso-Díaz

Authors
  1. Julio Mar-Ortiz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. José Luis González-Velarde
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Belarmino Adenso-Díaz
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to José Luis González-Velarde.

Electronic Supplementary Material

Below is the link to the electronic supplementary material.

(PDF 454 KB)

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mar-Ortiz, J., González-Velarde, J.L. & Adenso-Díaz, B. Designing routes for WEEE collection: the vehicle routing problem with split loads and date windows. J Heuristics 19, 103–127 (2013). https://doi.org/10.1007/s10732-011-9159-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10732-011-9159-1

Keywords

Search

Navigation