Abstract
In this paper we study the impact of different index structures used within hybrid solution approaches for vehicle routing problems with hard feasibility checks. We examine the case of the vehicle routing problem with two-dimensional loading constraints, which combines the loading of freight into the vehicles and the routing of the vehicles to satisfy the demands of the customers. The problem is solved by a variable neighborhood search for the routing part, in which we embed an exact procedure for the loading subproblem. The contribution of the paper is threefold: i) Four different index mechanisms for managing the subproblems are implemented and tested. It is shown that simple index structures tend to lead to better solutions than more powerful albeit complex ones, when using the same runtime limits. ii) The problem of balancing the CPU budget between exploration of different solutions and exact solution of the loading subproblem is investigated; experiments show that solving exactly hard subproblems can lead to better solution quality over the whole solution process. iii) New best results are presented on existing benchmark instances.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Dell’Amico, M., Martello, S., Vigo, D.: A lower bound for the non-oriented two-dimensional bin packing problem. Discrete Applied Mathematics 118 (2002)
Clarke, G., Wright, J.: Scheduling of vehicles from a central depot to a number of delivery points. Operations Research 12, 568–581 (1964)
Deppisch, U.: S-tree: a dynamic balanced signature index for office retrieval. In: SIGIR 1986: Proceedings of the 9th annual international ACM SIGIR conference on Research and development in information retrieval, New York, pp. 77–87 (1986)
Fuellerer, G., Doerner, K., Hartl, F., Iori, M.: Ant colony optimization for the two-dimensional loading vehicle routing problem. Computer and Operations Research (2007)
Gendreau, M., Iori, M., Laporte, G., Martello, S.: A tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints. Networks 51(1), 4–18 (2008)
Hansen, P., Mladenović, N.: Variable neighborhood search: Principles and applications. European Journal of Operational Research 130, 449–467 (2001)
Helmer, S., Neumann, T., Moerkotte, G.: A robust scheme for multilevel extendible hashing. Technical Report 19/01, University of Mannheim (2001)
Helmer, S., Neumann, T., Moerkotte, G.: A robust scheme for multilevel extendible hashing. In: Proceedings of the 18th International Symposium on Computer and Information Sciences (IS-CIS 2003), Antalya, pp. 220–227 (2003)
Helmer, S., Aly, R., Neumann, T., Moerkotte, G.: Indexing Set-Valued Attributes with a Multi-Level-Extendible Hashing Scheme (2007)
Iori, M., Salazar, G., Vigo, D.: An exact approach for the vehicle routing problem with two-dimensional loading constraints. Transportation Science 41(2), 253–264 (2007)
Lodi, A., Martello, S., Vigo, D.: Heuristic and Metaheuristic Approches for a Class of Two-Dimensional Bin Packing Problems. INFORMS Journal on Computing 11(4) (Fall 1999)
Martello, S., Vigo, D.: Exact Solution of the Two-Dimensional Finite Bin Packing Problem. Management Science 44(3), 388–399 (1998)
Mladenović, N., Hansen, P.: Variable neighborhood search. Computer and Operations Research 24, 1097 (1997)
Elizabeth, S.I., Izaaz, Y., Nadarajan, R.: On the SD-tree construction for optimal signature operations. In: In Proceedings of the 1st Bangalore Annual Compute Conference, COMPUTE 2008, Bangalore, India, January 18-20. ACM, New York (2008)
SGI: Sandard Template Library Programmer’s Guide, http://www.sgi.com/tech/stl/index.html
Taillard, E., Badeau, P., Gendreau, M., Guertin, F., Potvin, J.: A tabu search heuristic for the vehicle routing problem with soft time windows. Transportation Science 31, 170–186 (1997)
Tousidou, E., Bozanis, P., Manolopoulos, Y.: Signature-based structures for objects with set-valued attributes. Inf. Syst. 27(2), 93–121 (2002)
Tricoire, F., Doerner, K.F., Hartl, R.F., Iori, M.: Heuristic and Exact Algorithms for the Multi-Pile Vehicle Routing Problem. OR Spectrum (2010) (available online)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Strodl, J., Doerner, K.F., Tricoire, F., Hartl, R.F. (2010). On Index Structures in Hybrid Metaheuristics for Routing Problems with Hard Feasibility Checks: An Application to the 2-Dimensional Loading Vehicle Routing Problem. In: Blesa, M.J., Blum, C., Raidl, G., Roli, A., Sampels, M. (eds) Hybrid Metaheuristics. HM 2010. Lecture Notes in Computer Science, vol 6373. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16054-7_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-16054-7_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-16053-0
Online ISBN: 978-3-642-16054-7
eBook Packages: Computer ScienceComputer Science (R0)