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 the 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.
Author supplied keywords
Cite
CITATION STYLE
Bartók, T., & Imreh, C. (2011). Pickup and delivery vehicle routing with multidimensional loading constraints. In Acta Cybernetica (Vol. 20, pp. 17–33). University of Szeged, Institute of Informatics. https://doi.org/10.14232/actacyb.20.1.2011.3
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.