Hybrid Algorithm for Solving the Multi-compartment Vehicle Routing Problem with Time Windows and Profit

Hadhami Kaabi, Khaled Jabeur

Abstract

This paper presents a new variant of the well-known vehicle routing problem with time windows (VRPTW). More precisely, this paper addresses a multi-compartment vehicle routing problem with time windows and profit (MCVRPTW with profit). The aim of this problem is to serve a set of customers by using a set of vehicles with multiple compartments, under a minimum traveling cost. The vehicles, starting and ending at the depot, have a limited capacity and each compartment is dedicated to one product. A customer is served only within a given time windows and, when it is visited a profit is collected (i.e. a profit not low than a preset profit bound). To solve this problem, an hybrid approach combining the genetic algorithm (GA) and the iterated local search (ILS) is used.

References

  1. Aras N., Aksen D., Tekin M. T., (2011). Selective multidepot vehicle routing problem with pricing. Transportation Research Part C: Emerging Technologies.
  2. Chajakis E. D., Guignard M., (2003). Scheduling deliveries in vehicles with multiple compartments. Journal of Global Optimization.
  3. Cornillier F., Laporte G., Boctor F. F., Renaud J., (2009). The petrol station replenishment problem with time windows. Computers & Operations Research.
  4. Cornillier F., Boctor F. F., Laporte G., Renaud J., (2008). A heuristic for the multi-period petrol station replenishment problem. European Journal of Operational Research.
  5. Cornillier F., Boctor F. F., Renaud J., (2012). Heuristics for the multi-depot petrol station replenishment problem with time windows. European Journal of Operational Research.
  6. Derbali H., Jarboui B., Hanafi S., Chabchoub H., (2012). Genetic algorithm with iterated local search for solving a location-routing problem. Expert System with Applications.
  7. El Fallahi A., Prins Ch, Calvo R. W. (2008). A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem. Computers & Operations Research.
  8. Feillet D., Dejax P., Gendreau M. (2001). Traveling Salesman problems with profits: An overview. Transportation Science.
  9. Grosso A., Jamali A., Locatelli M., (2009). Finding maximin latin hypercube designs by iterated local search heuristics. European Journal of Operational Research.
  10. Herrera F, Lozano M, Verdegay J. L., (1998). Tackling Real-Coded Genetic Algorithms: Operators and Tools for Behavioral Analysis. Artificial Intelligence Review.
  11. Hvattum L. M., Fagerholt K., Armentano V. A., (2009). Tank allocation problems in maritime bulkshipping. Computers & Operations Research.
  12. Lahyani R., Coelho L. C., Khemakhem M., Laporte G., (2015). A multi-compartment vehicle problem arising in the collection of olive oil in Tunisia. Omega
  13. Laurenco M., Martin O., Stutzle T., (2003). Iterated local search. Handbook of metaheuristics of international series in operations research & management science.
  14. Muyldermans L., Pang G. (2010). On the benefits of cocollection: Experiments with a multi-compartment vehicle routing algorithm. European Journal of Operational Research.
  15. Oppen J., Lokketangen A. (2008). A tabu search approach for the livestock collection problem. Computers & Operations Research.
  16. Reed M., Yiannakou A., Evering R. (2014). An ant colony algorithm for the multi-compartment vehicle routing problem. Applied Soft Computing.
  17. Reeves, C. (1995). Modern heuristic techniques for combinatorial problems. McGraw-Hill Book Company Inc.
  18. Relvas S., Magata˜o S. N. B., Barbosa-Póvoa A. P. F. D., Neves Jr. F., (2014). Integrated scheduling and inventory management of an oil products distribution system. Omega.
  19. Solomon M. M., (1987). Algorithms for the vehicle routing and scheduling problems with time window and constraints. Operations Research.
  20. Stalhane M., Rakke J. G., Moe C. R., Andersson H., Christiansen M., Fagerholt K., (2012). A construction and improvement heuristic for a liquefied natural gas inventory routing problem. Computers & Industrial Engineering.
  21. Valle C. A., Martinez L. C., Da Cunha A. S., Mateus G. R. (2011). Heuristic and exact algorithms for a minmax selective vehicle routing problem. Computers & Operations Research.
Download


Paper Citation


in Harvard Style

Kaabi H. and Jabeur K. (2015). Hybrid Algorithm for Solving the Multi-compartment Vehicle Routing Problem with Time Windows and Profit . In Proceedings of the 12th International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO, ISBN 978-989-758-122-9, pages 324-329. DOI: 10.5220/0005572503240329


in Bibtex Style

@conference{icinco15,
author={Hadhami Kaabi and Khaled Jabeur},
title={Hybrid Algorithm for Solving the Multi-compartment Vehicle Routing Problem with Time Windows and Profit},
booktitle={Proceedings of the 12th International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO,},
year={2015},
pages={324-329},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005572503240329},
isbn={978-989-758-122-9},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 12th International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO,
TI - Hybrid Algorithm for Solving the Multi-compartment Vehicle Routing Problem with Time Windows and Profit
SN - 978-989-758-122-9
AU - Kaabi H.
AU - Jabeur K.
PY - 2015
SP - 324
EP - 329
DO - 10.5220/0005572503240329