Abstract
In this work we present a vehicle loading problem that consists of packing a given set of items into a minimum number of vehicles for delivery. A heuristic approach based on Dantzig-Wolfe decomposition is developed and tested on a widely available data set. A greedy search procedure is developed to speed up the column generation approach. A problem specific branching technique is used to generate integer solutions in a reasonable time. Numerical experimentation is done to compare the performance of the developed approach with the available results in the literature. © 2013 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
Mahvash, B., Awasthi, A., & Chauhan, S. (2013). Column generation based heuristic for the three dimensional vehicle loading problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8197 LNCS, pp. 257–268). Springer Verlag. https://doi.org/10.1007/978-3-642-41019-2_19
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
