Skip to main content
SpringerLink
Log in

Hybrid Metaheuristic to Solve the Selective Multi-compartment Vehicle Routing Problem with Time Windows

  • Conference paper
  • First Online:
Proceedings of the Second International Afro-European Conference for Industrial Advancement AECIA 2015

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 427))

  • 1023 Accesses

Abstract

This paper presents a new variant of the multi-compartment Vehicle Routing Problem (MCVRP) with profits and time windows. This problem is called the selective MCVRP with time windows. In the proposed approach, a limited number of k vehicles with multiple compartment is available at the depot to serve a set of customers. Each vehicle has a limited capacity and each compartment contains one product. A customer is served only within a given time windows and when it is visited a profit is collected. Moreover, to the best of our knowledge, this problem is addressed for the first time. The goal of this research work is to determine a set of routes limited in length, such that a set of customers are visited within a given time windows, the total collected profit is maximized and the total routing cost is minimized. We present an hybrid metaheuristic to solve this problem.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Aras, N., Aksen, D., Tekin, M.T.: Selective multi-depot vehicle routing problem with pricing. Trans. Res. Part C: Emerg. Technol. (2011)

    Google Scholar 

  2. Chajakis, E.D., Guignard, M.: Scheduling deliveries in vehicles with multiple compartments. J. Glob. Optim. (2003)

    Google Scholar 

  3. Cornillier, F., Laporte, G., Boctor, F.F., Renaud, J.: The petrol station replenishment problem with time windows. Comput. Oper. Res. (2009)

    Google Scholar 

  4. Cornillier, F., Boctor, F.F., Laporte, G., Renaud, J.: A heuristic for the multi-period petrol station replenishment problem. Eur. J. Oper. Res. (2008)

    Google Scholar 

  5. Cornillier, F., Boctor, F.F., Renaud, J.: Heuristics for the multi-depot petrol station replenishment problem with time windows. Eur. J. Oper. Res. (2012)

    Google Scholar 

  6. Derbali, H., Jarboui, B., Hanafi, S., Chabchoub, H.: Genetic algorithm with iterated local search for solving a location-routing problem. Expert Syst. Appl. (2012)

    Google Scholar 

  7. El Fallahi, A., Prins, C.H., Calvo, R.W.: A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem. Comput. Oper. Res. (2008)

    Google Scholar 

  8. Feillet, D., Dejax, P., Gendreau, M.: Traveling salesman problems with profits: an overview. Trans. Sci. (2001)

    Google Scholar 

  9. Grosso, A., Jamali, A., Locatelli, M.: Finding maximin latin hypercube designs by iterated local search heuristics. Eur. J. Oper. Res. (2009)

    Google Scholar 

  10. Herrera, F., Lozano, M., Verdegay, J.L.: Tackling real-coded genetic algorithms: operators and tools for behavioral analysis. Artif. Intell. Rev. (1998)

    Google Scholar 

  11. Hvattum, L.M., Fagerholt, K., Armentano, V.A.: Tank allocation problems in maritime bulkshipping. Comput. Oper. Res. (2009)

    Google Scholar 

  12. Lahyani, R., Coelho, L.C., Khemakhem, M., Laporte, G.: A multi-compartment vehicle problem arising in the collection of olive oil in Tunisia. Omega (2015)

    Google Scholar 

  13. Muyldermans, L., Pang, G.: On the benefits of co-collection: experiments with a multi-compartment vehicle routing algorithm. Eur. J. Oper. Res. (2010)

    Google Scholar 

  14. Oppen, J., Lokketangen, A.: A tabu search approach for the livestock collection problem. Comput. Oper. Res. (2008)

    Google Scholar 

  15. Reed, M., Yiannakou, A., Evering, R.: An ant colony algorithm for the multi-compartment vehicle routing problem. Appl. Soft Comput. (2014)

    Google Scholar 

  16. Reeves, C.: Modern Heuristic Techniques for Combinatorial Problems. McGraw- Hill Book Company Inc. (1995)

    Google Scholar 

  17. Relvas, S., Magatos, N.B., Neves, J.F.: Integrated scheduling and inventory management of an oil products distribution system. Omega (2014)

    Google Scholar 

  18. Solomon, M.M.: Algorithms for the vehicle routing and scheduling problems with time window and constraints. Oper. Res. (1987)

    Google Scholar 

  19. Stalhane, M., Rakke, J., Moe, C., Andersson, H., Christiansen, M., Fagerholt, K.: A construction and improvement heuristic for a liquefied natural gas inventory routing problem. Comput. Ind. Eng. (2012)

    Google Scholar 

  20. Valle, C., Martinez, L.C., Da Cunha, A.S., Mateus, G.R.: Heuristic and exact algorithms for a min-max selective vehicle routing problem. Comput. Oper. Res. (2011)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut Supérieur de Gestion de Tunis, Université de Tunis, 41, Rue de la Liberté - Bouchoucha, 2000, Bardo, Tunisia

    Hadhami Kaabi

Authors
  1. Hadhami Kaabi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hadhami Kaabi .

Editor information

Editors and Affiliations

  1. Sci. Network for Innovation & Rec. Exell, Machine Intelligence Research Labs (MIR, Auburn, Washington, USA

    Ajith Abraham

  2. Membre du Groupe Efrei, ESIGETEL, Villejuif, France

    Katarzyna Wegrzyn-Wolska

  3. Faculty of Computers & Information, Cairo University, Giza, Egypt

    Aboul Ella Hassanien

  4. VSB-Technical University of Ostrava, Ostrava, Czech Republic

    Vaclav Snasel

  5. ENIS, University of Sfax, Sfax, Tunisia

    Adel M. Alimi

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Kaabi, H. (2016). Hybrid Metaheuristic to Solve the Selective Multi-compartment Vehicle Routing Problem with Time Windows. In: Abraham, A., Wegrzyn-Wolska, K., Hassanien, A., Snasel, V., Alimi, A. (eds) Proceedings of the Second International Afro-European Conference for Industrial Advancement AECIA 2015. Advances in Intelligent Systems and Computing, vol 427. Springer, Cham. https://doi.org/10.1007/978-3-319-29504-6_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-29504-6_19

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-29503-9

  • Online ISBN: 978-3-319-29504-6

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation