Pickup and delivery vehicle routing with multidimensional loading constraints

Authors:
Tamás Bartók;Csanád Imreh
Affiliations:
Institute of Informatics, University of Szeged;Institute of Informatics, University of Szeged
Venue:
Acta Cybernetica
Year:
2011

Citing 9
Cited 0

The vehicle routing problem

The vehicle routing problem
The Three-Dimensional Bin Packing Problem

Operations Research
A Tabu Search Algorithm for a Routing and Container Loading Problem

Transportation Science
Metaheuristics for the vehicle routing problem with loading constraints

Networks
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
A Survey on Vehicle Routing Problem with Loading Constraints

CSO '09 Proceedings of the 2009 International Joint Conference on Computational Sciences and Optimization - Volume 02
A hybrid metaheuristic algorithm for the integrated vehicle routing and three-dimensional container-loading problem

IEEE Transactions on Intelligent Transportation Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we introduce a new, pickup and delivery vehicle routing model where weight, limits and also packing constraints are taken into account. In the model tim vehicles have to transport 3-dimensional boxes from their pickup points into, their delivery points. The boxes have weights and the vehicles has to satisfy a weight limit. We present a heuristic algorithm for the solution of the problem. The efficiency of the algorithm is evaluated by an experimental analysis.