Name
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. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1007/978-3-642-41019-2_19 | COMPUTATIONAL LOGISTICS, ICCL 2013 |
Keywords | Field | DocType |
Three-dimensional vehicle loading problem, Column Generation, Heuristics | Integer,Mathematical optimization,Column generation,Heuristic,Computer science,Greedy algorithm,Theoretical computer science,Heuristics,Speedup,Branching (version control) | Conference |
Volume | ISSN | Citations |
8197 | 0302-9743 | 1 |
PageRank | References | Authors |
0.35 | 10 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Batoul Mahvash | 1 | 1 | 0.69 |
| Anjali Awasthi | 2 | 130 | 7.92 |
| Satyaveer Singh Chauhan | 3 | 45 | 6.57 |