On index structures in hybrid metaheuristics for routing problems with hard feasibility checks: an application to the 2-dimensional loading vehicle routing problem

Authors:
Johannes Strodl;Karl F. Doerner;Fabien Tricoire;Richard F. Hartl
Affiliations:
Department of Business Administration, University of Vienna, Vienna, Austria;Department of Business Administration, University of Vienna, Vienna, Austria;Department of Business Administration, University of Vienna, Vienna, Austria;Department of Business Administration, University of Vienna, Vienna, Austria
Venue:
HM'10 Proceedings of the 7th international conference on Hybrid metaheuristics
Year:
2010

Citing 11
Cited 2

S-tree: a dynamic balanced signature index for office retrieval

Proceedings of the 9th annual international ACM SIGIR conference on Research and development in information retrieval
Variable neighborhood search

Computers and Operations Research
Exact Solution of the Two-Dimensional Finite Bon Packing Problem

Management Science
A lower bound for the non-oriented two-dimensional bin packing problem

Discrete Applied Mathematics - Special issue: Third ALIO-EURO meeting on applied combinatorial optimization
Signature-based structures for objects with set-valued attributes

Information Systems - Databases: Creation, management and utilization
Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems

INFORMS Journal on Computing
A Tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints

Networks - Special Issue In Memory of Stefano Pallottino
On the SD-tree construction for optimal signature operations

COMPUTE '08 Proceedings of the 1st Bangalore Annual Compute Conference
Ant colony optimization for the two-dimensional loading vehicle routing problem

Computers and Operations Research
An Exact Approach for the Vehicle Routing Problem with Two-Dimensional Loading Constraints

Transportation Science
Heuristic and exact algorithms for the multi-pile vehicle routing problem

OR Spectrum

Survey: matheuristics for rich vehicle routing problems

HM'10 Proceedings of the 7th international conference on Hybrid metaheuristics
Pheromone-Based heuristic column generation for vehicle routing problems with black box feasibility

CPAIOR'12 Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

Quantified Score

Hi-index	0.00

Visualization

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.