A relaxation method for the three-dimensional loading capacitated vehicle routing problem

2011 IEEE/SICE International Symposium on System Integration, SII 2011

Volumn , Issue , 2011, Pages 750-755

  Ren, Jidong ^a   Tian, Yajie ^a   Sawaragi, Tetsuo ^a  

^a KYOTO UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

CAPACITATED VEHICLE ROUTING PROBLEM; COMPUTING TIME; CONTAINER-LOADING PROBLEMS; LOADING CONSTRAINTS; RELAXATION METHODS; STRONGLY NP-HARD; TEST CASE; VEHICLE ROUTING PROBLEMS; VOLUME RATIO;

COMPUTATIONAL COMPLEXITY; LARGE EDDY SIMULATION; NETWORK ROUTING; ROUTING ALGORITHMS; THREE DIMENSIONAL;

LOADING;

EID: 84857615706     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SII.2011.6147542     Document Type: Conference Paper

References (17)

1. J.A. George and D.F. Robinson, "A heuristic for packing boxes into a container", Computer and Operations Research, vol. 7, pp. 147-156, 1980.
2. E.E. Bischoff and M.S.W Ratcliff, "Issues in the development of approaches to container loading", Omega - International Journal of Management Science, vol. 23, pp. 377-390, 1995.
3. M. Eley, "Solving container loading problems by block arrangement", European Journal of Operational Research, vol. 141, pp. 393-409, 2002. (Pubitemid 34623945)
4. T. Fanslau and A. Bortfeldt, "A tree search method for solving the container loading problem", Informs Journal on Computing, vol. 22, pp. 222-235, 2010.
5. J. Ren, Y. Tian and T. Sawaragi, "A tree search method for the container loading problem with shipment priority", European Journal of Operational Research, vol. 214, pp. 526-535, 2011.
6. A.P. Davies and E.E. Bischoff, "Weight distribution considerations in container loading", European Journal of Operational Research, vol. 114, pp. 509-527, 1999.
7. G.B. Dantzig and J.H. Ramser, "The Truck Dispatching Problem", Management Science, vol. 6, pp. 80-91, 1959.
8. P. Toth and D. Vigo, The Vehicle Routing Problem, SIAM Monographs on Discrete Mathematics and Applications., Society for Industrial and Applied Mathematics, Philadelphia, 2002.
9. G. Laporte, "Fifty years of vehicle routing", Transportation Science, vol. 43, pp. 408-416, 2009.
10. M. Gendreau, M. Iori, G. Laporte and S. Martello, "A tabu search algorithm for a routing and container loading problem", Transportation Science, vol. 40, pp. 342-350, 2006. (Pubitemid 44147355)
11. C.D. Tarantilis, E.E. Zachariadis, and C.T. Kiranoudis. "A hybrid metaheuristic algorithm for the integrated vehicle routing and three-dimensional container-loading problem", IEEE Transactions on Intelligent Transportation Systems, vol. 101, pp. 255-271, 2009.
12. G. Fuellerer, K.F. Doerner, R.P. Hartl and M. Iori, "Metaheuristics for vehicle routing problems with three-dimensional loading constraints", European Journal of Operational Research, vol. 201, pp. 751-759, 2010.
13. A. Moura, "A multi-objective genetic algorithm for the vehicle routing with time windows and loading problem", Intelligent Decision Support, vol. 2, pp. 187-201, 2008.
14. A. Moura and J.F. Oliveira, "An integrated approach to the vehicle routing and container loading problems", OR Spectrum, vol. 31, pp. 775-800, 2009.
15. M. Iori and S. Martello, "Routing problems with loading constraints", TOP, vol. 18, pp. 4-27, 2010.
16. G. Clarke and J.W. Wright, "Scheduling of vehicles from a central depot to a number of delivery points", Operations Research, vol. 12, pp. 568-581, 1964.
17. D.J. Houck, J.-C. Picard, M. Queyranne and R.R. Vemuganti, "The traveling salesman problem as a constrained shortest path problem: Theory and computational experience." Opsearch, vol. 17, pp. 93-109, 1980.