Memetic Algorithm with Population Management for the Two-dimensional Loading Vehicle Routing Problem with Partial Conflicts

Khaoula Dhaoui, Nacima Labadie, Alice Yalaoui

2012

Abstract

The two-dimensional loading vehicle routing problem with partial conflicts combines two NP-hard problems: the capacitated vehicle routing problem (CVRP) and the two-dimensional bin-packing problem with partial conflicts (2BPPC). This problem arises for example in hazardous waste collection, where some materials can be partially conflicting. In this paper, we propose a memetic algorithm with population management to resolve this new problem. A modified SHF-D heuristic is used to obtain feasible packing in each vehicle. The proposed approach is tested on a new benchmark, created by adding partial conflicts to instances from the literature.

References

  1. Beaumont, O., Bonichon, N., and Larcheveˆque, H. (2010). Bin packing under distance constraint. Technical report, Université de Bordeaux, Laboratoire Bordelais de Recherche en Informatique, INRIA Bordeaux SudOuest.
  2. BenMessaoud, S., Chu, C., and Espinouse, M. (2004). An approach to solve cutting stock sheets. Scottish Mathematical Council, 6:5109-5113.
  3. Clarke, G. and Wright, J. (1964). Scheduling of vehicles from a central depot to a number of delivery points. Operations Research, 12:568-581.
  4. Dhaoui, K., Labadie, N., and Yalaoui, A. (2012). Algorithms for the two dimensional bin packing problem with partial conflicts. RAIRO - Operations Reseach, accepted.
  5. Duhamel, C., Lacomme, P., Quilliot, A., and 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. Environment Canada (2002). Compliance promotion bulletin (compro no. 12) - regulations for the management of hazardous waste.
  7. Fuellerer, G., Doerner, K., Hartl, R., and Iori, M. (2009). Ant colony optimization for the two-dimensional loading vehicle routing. Computer & Operations Research, 36(3):655-673.
  8. Gendreau, M., Iori, M., Laporte, G., and Martello, S. (2008). A tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints. Networks - Special Issue In Memory of Stefano Pallottino, 51:4-18.
  9. Goldberg, D. (1989). Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, Reading, Massachussett, USA.
  10. Iori, M. (2004). Metaheuristic algorithms for combinatorial optimization problems. PhD thesis, University of Bologna, Italy.
  11. Iori, M., Salazar-Gonzalez, J. J., and Vigo, D. (2007). An exact approach for vehicle routing problem with twodimensional loading constraints. Transportation Science, 41(2):253-264.
  12. Khebbache, S., Prins, C., Yalaoui, A., and Reghioui, M. (2011). Heuristics and memetic algorithm for the twodimensional loading capacitated vehicle routing problem with time windows. Central European Journal of Operations Research, pages DOI: 10.1007/s10100- 011-0204-9.
  13. Leung, S., Zhou, X., Zhang, D., and Zheng, J. (2011). Extended guided tabu search and a new packing algorithm for the two-dimensional loading vehicle routing problem. Computers & Operations Research, 38(1):205-215.
  14. Martì, R., Laguna, M., and Campos, V. (2005). Scatter search vs genetic algorithms: an experimental evaluation with permutation problems. Metaheuristic Optimization via Memory and Evolution: Tabu Search and Scatter Search, Boston, Kluwer. C. Rego and B. Alidaee, editors.
  15. Moura, A. (2008). A multi-objective genetic algorithm for the vehicle routing with time windows and loading problem. Intelligent Decision Support, pages 187- 201.
  16. Moura, A. and Oliveira, J. F. (2009). An integrated approach to the vehicle routing and container loading problems. Operations Research Spectrum, 31(4):775- 800.
  17. Prins, C. (2004). A simple and effective evolutionary algorithm for the vehicle routing problem. Computers and Operations Research, 31:1985-2002.
  18. Sörensen, K. and Sevaux, M. (2006). MAjPM: Memetic algorithms with population management. Computers and Operations Research, 33(5):1214-1225.
  19. Stoyan, Y. and Chugay, A. (2009). Packing cylinders and rectangular parallelepipeds with distances between them into a given region. European Journal of Operational Research, 360(197):446-455.
  20. Stoyan, Y. G. and Yaskov, G. N. (1998). Mathematical model and solution method of optimization problem of placement of rectangles and circles taking account special constraints. International Transactions on Operational Research, 5(1):45-57.
  21. Zachariadis, E., Tarantilis, C., and Kiranoudis, C. (2009). A guided tabu search for the vehicle routing problem with two-dimensional loading constraints. European Journal of Operational Research, 195(3):729-743.
Download


Paper Citation


in Harvard Style

Dhaoui K., Labadie N. and Yalaoui A. (2012). Memetic Algorithm with Population Management for the Two-dimensional Loading Vehicle Routing Problem with Partial Conflicts . In Proceedings of the 4th International Joint Conference on Computational Intelligence - Volume 1: ECTA, (IJCCI 2012) ISBN 978-989-8565-33-4, pages 189-195. DOI: 10.5220/0004149501890195


in Bibtex Style

@conference{ecta12,
author={Khaoula Dhaoui and Nacima Labadie and Alice Yalaoui},
title={Memetic Algorithm with Population Management for the Two-dimensional Loading Vehicle Routing Problem with Partial Conflicts},
booktitle={Proceedings of the 4th International Joint Conference on Computational Intelligence - Volume 1: ECTA, (IJCCI 2012)},
year={2012},
pages={189-195},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004149501890195},
isbn={978-989-8565-33-4},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 4th International Joint Conference on Computational Intelligence - Volume 1: ECTA, (IJCCI 2012)
TI - Memetic Algorithm with Population Management for the Two-dimensional Loading Vehicle Routing Problem with Partial Conflicts
SN - 978-989-8565-33-4
AU - Dhaoui K.
AU - Labadie N.
AU - Yalaoui A.
PY - 2012
SP - 189
EP - 195
DO - 10.5220/0004149501890195