A biased-randomized algorithm for the two-dimensional vehicle routing problem with and without item rotations

International Transactions in Operational Research

Volumn 21, Issue 3, 2014, Pages 375-398

  Dominguez, Oscar ^a   Juan, Angel A ^b   Faulin, Javier ^c  

^a UNIVERSITY OF LAS PALMAS DE GRAN CANARIA   (Spain)

^b UNIVERSITAT OBERTA DE CATALUNYA   (Spain)

^c PUBLIC UNIVERSITY OF NAVARRE   (Spain)

Author keywords

Biased randomization; Heuristics; Multistart algorithms; Vehicle packing; Vehicle routing problem

Indexed keywords

ALGORITHMS; NETWORK ROUTING; RANDOM PROCESSES; ROUTING ALGORITHMS; TWO DIMENSIONAL;

BIASED RANDOMIZATION; COMPUTATIONAL TIME; HEURISTICS; LOCAL MINIMUMS; MULTISTART ALGORITHM; PACKING PROBLEMS; RECTANGULAR-SHAPED; VEHICLE ROUTING PROBLEMS;

LOADING;

EID: 84897379699     PISSN: 09696016     EISSN: 14753995     Source Type: Journal    
DOI: 10.1111/itor.12070     Document Type: Article

References (24)

1. Burke, E.K., Kendall, G., Whitwell G., 2004. A new placement heuristic for the orthogonal stock-cutting problem. Operations Research 52, 655-671.
2. Clarke, G., Wright, J.W., 1964. Scheduling of vehicles from a central depot to a number of delivery points. Operations Research 12, 568-581.
3. Cordeau, J.F., Gendreau, M., Hertz, A., Laporte, G., Sormany, J.S., 2005. New heuristics for the vehicle routing problem. In Langevin, A., Riopel, D. (eds) Logistics Systems: Design and Optimization. Kluwer, Boston, MA.
4. Duhamel, C., Lacomme, P., Quilliot, A., Toussaint, H., 2009. 2L-CVRP: a GRASP resolution scheme based on RCPSP. International Conference on Computers & Industrial Engineering, 2-9 July 2009, Conference Publications, pp. 1094-1099.
5. Duhamel, C., Lacomme, P., Quilliot, A., Toussaint, H., 2011. A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem. Computers & Operations Research 38, 3, 617-640.
6. Fuellerer, G., Doerner, K., Hartl, R., Iori, M., 2009. Ant colony optimization for the two-dimensional loading vehicle routing problem. Computers and Operations Research 36, 655-673.
7. Gendreau, M., Iori, M., Laporte, G., Martello, S., 2008. A tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints. Networks 51, 4-18.
8. Golden, B., Raghavan, S., Wasil, E. (eds), 2008. The Vehicle Routing Problem: Latest Advances and New Challenges. Springer, New York.
9. Iori, M., 2005. Metaheuristic algorithms for combinatorial optimization problems. 4OR 3, 163-166.
10. Iori, M., Martello, S., 2010. Routing problems with loading constraints. TOP 18, 4-27.
11. Iori, M., Salazar, J.J., Vigo, D. 2007. An exact approach for the vehicle routing problem with two-dimensional loading constraints. Transportation Science 41, 2, 253-264.
12. Juan, A., Faulin, J., Ferrer, A., Lourenço, H., Barrios, B., 2011a. MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems. TOP 21, 1, 109-132.
13. Juan, A., Faulin, J., Jorba, J., Riera, D., Masip, D., Barrios, B., 2011b. On the use of Monte Carlo simulation, cache and splitting techniques to improve the Clarke and Wright saving heuristics. Journal of the Operational Research Society 62, 6, 1085-1097.
14. Juan, A., Faulin, J., Ruiz, R., Barrios, B., Caballé, S., 2010. The SR-GCWS hybrid algorithm for solving the capacitated vehicle routing. Applied Soft Computing 10, 215-224.
15. Laporte, G., 1992. The vehicle routing problem: an overview of exact and approximate algorithms. European Journal of Operational Research 59, 345-358.
16. L'Ecuyer, P., Meliani, L., Vaucher, J., 2002. SSJ: a framework for stochastic simulation in Java. Proceedings of the 2002 Winter Simulation Conference, ACM, New York, pp. 234-242.
17. Leung, S.C.H., Zheng, J., Zhang, D., Zhou, X., 2010. Simulated annealing for the vehicle routing problem with two-dimensional loading constraints. Flexible Services and Manufacturing Journal 22, 1-2, 61-82.
18. Leung, S.C.H., Zhou, X., Zhang, D., Zheng, J., 2011. Extended guided tabu search and a new packing algorithm for the two-dimensional loading vehicle routing problem. Computers & Operations Research 38, 205-215.
19. Luke, S., 2011. Essential of Metaheuristics. Lulu, Raleigh, NC. Available at http://cs.gmu.edu/~sean/book/metaheuristics/ (accessed 7 January 2014).
20. Prins, C., 2009. A GRASP × Evolutionary local search hybrid for the vehicle routing problem. In Pereira, F.B., Tavares, J. (ed.) Bio-Inspired Algorithms for the Vehicle Routing Problem, Studies in Computational Intelligence, Vol. 161. Springer, Berlin, pp. 35-53.
21. Riff, M.C., Bonnaire, X., Neveu, B., 2009. A revision of recent approaches for two-dimensional strip-packing problems. Engineering Applications of Artificial Intelligence 198, 823-827.
22. Toth, P., Vigo, D., 2002. The Vehicle Routing Problem. SIAM Publishers, Philadelphia, PA.
23. Wang, F., Tao, Y., Shi, N., 2009. A survey on vehicle routing problem with loading constraints. International Joint Conference on Computational Sciences and Optimization 2, 602-606.
24. Zachariadis, E.E., Tarantilis, C.D., Kiranoudis, C.T., 2009. A guided tabu search for the vehicle routing problem with two-dimensional loading constraints. European Journal of Operational Research 195, 729-743.