A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem

Authors:
Christophe Duhamel;Philippe Lacomme;Alain Quilliot;Hélène Toussaint
Affiliations:
Laboratoire d'Informatique (LIMOS, UMR CNRS 6158), Campus des Cézeaux, 63177 Aubière Cedex, France;Laboratoire d'Informatique (LIMOS, UMR CNRS 6158), Campus des Cézeaux, 63177 Aubière Cedex, France;Laboratoire d'Informatique (LIMOS, UMR CNRS 6158), Campus des Cézeaux, 63177 Aubière Cedex, France;Laboratoire d'Informatique (LIMOS, UMR CNRS 6158), Campus des Cézeaux, 63177 Aubière Cedex, France
Venue:
Computers and Operations Research
Year:
2011

Citing 15
Cited 4

Exact Solution of the Two-Dimensional Finite Bon Packing Problem

Management Science
Resource-constrained project scheduling: a survey of recent developments

Computers and Operations Research
A genetic algorithm for a 2D industrial packing problem

Computers and Industrial Engineering
An overview of vehicle routing problems

The vehicle routing problem
Sweep as a Generic Pruning Technique Applied to the Non-overlapping Rectangles Constraint

CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
The Three-Dimensional Bin Packing Problem

Operations Research
A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing

Mathematics of Operations Research
Algorithm 864: General and robot-packable variants of the three-dimensional bin packing problem

ACM Transactions on Mathematical Software (TOMS)
A Tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints

Networks - Special Issue In Memory of Stefano Pallottino
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
An Exact Algorithm for Higher-Dimensional Orthogonal Packing

Operations Research
Two memetic algorithms for heterogeneous fleet vehicle routing problems

Engineering Applications of Artificial Intelligence
Survey: The vehicle routing problem: A taxonomic review

Computers and Industrial Engineering
A GRASP×ELS approach for the capacitated location-routing problem

Computers and Operations Research

Efficient frameworks for greedy split and new depth first search split procedures for routing problems

Computers and Operations Research
A GRASP×ELS for the vehicle routing problem with basic three-dimensional loading constraints

Engineering Applications of Artificial Intelligence
Survey of Green Vehicle Routing Problem: Past and future trends

Expert Systems with Applications: An International Journal
A decision support system for public logistics information service management and optimization

Decision Support Systems

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper addresses an extension of the capacitated vehicle routing problem where customer demand is composed of two-dimensional weighted items (2L-CVRP). The objective consists in designing a set of trips minimizing the total transportation cost with a homogenous fleet of vehicles based on a depot node. Items in each vehicle trip must satisfy the two-dimensional orthogonal packing constraints. A GRASPxELS algorithm is proposed to compute solutions of a simpler problem in which the loading constraints are transformed into resource constrained project scheduling problem (RCPSP) constraints. We denote this relaxed problem RCPSP-CVRP. The optimization framework deals with RCPSP-CVRP and lastly RCPSP-CVRP solutions are transformed into 2L-CVRP solutions by solving a dedicated packing problem. The effectiveness of our approach is demonstrated through computational experiments including both classical CVRP and 2L-CVRP instances. Numerical experiments show that the GRASPxELS approach outperforms all previously published methods.