Abstract
In this paper we discuss a real-life case study to optimize the logistics network for the collection of containers from end-of-life vehicle dismantlers in the Netherlands. Advanced planning concepts, such as dynamic assignment of dismantlers to logistic service providers, are analyzed using a simulation model. Based on this model, we periodically solve a vehicle routing problem to gain insight into the long-term performance of the system. The vehicle routing problem considered is a multi-depot pickup and delivery problem with alternative delivery locations. A special characteristic of the problem is the limited vehicle capacity of two containers. We solve this problem with a heuristic based on route generation and set partitioning.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Agarwal Y, Mathur K, Salkin HM (1989) A set-partitioning-based exact algorithm for the vehicle routing problem. Networks 19:731–749
Archetti C, Speranza MG (2004) Vehicle routing in the 1-skip collection problem. J Oper Res Soc 55:717–727
ACEA, Association des Constructeurs Européens d' Automobiles (2004) Country report charts on end-of-life vehicle treatment status, February 2004. Downloadable from: http://www.acea.be/
Beullens P (2001) Location, process selection and vehicle routing models for reverse logistics. PhD thesis, University of Leuven, Belgium
Bodin L, Golden B, Assad A, Ball M (1983) Routing and scheduling of vehicles and crews: the state of the art. Comput Oper Res 10:63–211
Bodin L, Mingozzi A, Baldacci R (2000) The rollon-rolloff vehicle routing problem. Transp Sci 43(3):271–288
Bumstead J, Cannons K (2002) From 4PL to Managed Supply Chain Operations. Logist Transp Focus 4(4):19–25
Cruijssen F, Salomon M (2004) Empirical study: order sharing between transportation companies may result in cost reductions between 5 to 15 percent. Center Discussion Paper 80–2004
De Meulemeester L, Laporte G, Louveaux FV, Semet F (1997) Optimal sequencing of skip collections and deliveries. Journal of Operational Research Society 48:57–64
Dethloff J (2001) Vehicle routing and reverse logistics: the vehicle routing problem with simultaneous delivery and pick-up. OR Spectrum 23:79–96
Directive 2000/53/EC of the European parliament and of the council of 18 September 2000 on end-of-life vehicles. Official Journal of the European Communities, L 269/34
Fleuren HA (1988) A computational study of the set partitioning approach for vehicle routing and scheduling problems. Dissertation, University of Twente, The Netherlands
Krikke HR, Le Blanc HM, Van de Velde SL (2004) Product modularity and the design of closed-loop supply chains. Calif Manage Rev 46(2):23–39
Laporte G, Gendreau M, Potvin JY, Semet F (2000) Classical and modern heuristics for vehicle routing problem. Int Trans Oper Res 7:285–300
Le Blanc HM, Fleuren HA, Krikke HR (2004) Redesign of a recycling system for LPG-tanks. OR Spectrum 26:283–304
NEA (2004) Kostencalculaties in het beroepsgoederenvervoer over de weg, prijspeil 1-1-2004. Rijswijk, The Netherlands
Püchert H, Walter A, Conradt P, Rentz O (1994) Autorecycling, Demontage und Verwertung, Wirtschaftliche Aspekte, Logistik und Organisation. Economica Verlag, Bonn, Germany
Schreurs RP (2004) Voorspelbaarheid van de inzameling van materialen afkomstig van autowrakken en de impact op de distributieplanning. Master thesis, Tilburg University, The Netherlands
Spicer AJ, Johnson MR (2004) Third-party demanufacturing as a solution for extended producer responsibility. J Clean Prod 12:37–45
Toth P, Vigo D (2002) The vehicle routing problem. Society for Industrial and Applied Mathematics. SIAM monographs on discrete mathematics and applications
Van Burik AMC (1998) Retourstroomproblematiek van materialen afkomstig uit autowrakken. In: Van Goor AR, Flapper SDP, Clement C (eds) Handboek reverse logistics. Samson Bedrijfsinformatie, Alphen aan den Rijn, The Netherlands, F3600 pp 1–12
Van Krieken MGC, Fleuren HA, Peeters MJP (2003) Problem reduction in set partitioning problems. Center Discussion Papers 2003–80
Van Krieken MGC, Fleuren HA, Peeters MJP (2004) A Lagrangean relaxation based algorithm for solving set partitioning problems. Center Discussion Papers 2004–44
Acknowledgements
The authors would like to thank Roelof Reinsma and Annemieke van Burik of Auto Recycling Nederland for their assistance and support during the project. Furthermore, we thank the two anonymous referees for their valuable comments on the manuscript.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
le Blanc, I., van Krieken, M., Krikke, H. et al. Vehicle routing concepts in the closed-loop container network of ARN—a case study. OR Spectrum 28, 53–71 (2006). https://doi.org/10.1007/s00291-005-0003-6
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00291-005-0003-6