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
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Aras, N., Aksen, D., Tekin, M.T.: Selective multi-depot vehicle routing problem with pricing. Trans. Res. Part C: Emerg. Technol. (2011)
Chajakis, E.D., Guignard, M.: Scheduling deliveries in vehicles with multiple compartments. J. Glob. Optim. (2003)
Cornillier, F., Laporte, G., Boctor, F.F., Renaud, J.: The petrol station replenishment problem with time windows. Comput. Oper. Res. (2009)
Cornillier, F., Boctor, F.F., Laporte, G., Renaud, J.: A heuristic for the multi-period petrol station replenishment problem. Eur. J. Oper. Res. (2008)
Cornillier, F., Boctor, F.F., Renaud, J.: Heuristics for the multi-depot petrol station replenishment problem with time windows. Eur. J. Oper. Res. (2012)
Derbali, H., Jarboui, B., Hanafi, S., Chabchoub, H.: Genetic algorithm with iterated local search for solving a location-routing problem. Expert Syst. Appl. (2012)
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)
Feillet, D., Dejax, P., Gendreau, M.: Traveling salesman problems with profits: an overview. Trans. Sci. (2001)
Grosso, A., Jamali, A., Locatelli, M.: Finding maximin latin hypercube designs by iterated local search heuristics. Eur. J. Oper. Res. (2009)
Herrera, F., Lozano, M., Verdegay, J.L.: Tackling real-coded genetic algorithms: operators and tools for behavioral analysis. Artif. Intell. Rev. (1998)
Hvattum, L.M., Fagerholt, K., Armentano, V.A.: Tank allocation problems in maritime bulkshipping. Comput. Oper. Res. (2009)
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)
Muyldermans, L., Pang, G.: On the benefits of co-collection: experiments with a multi-compartment vehicle routing algorithm. Eur. J. Oper. Res. (2010)
Oppen, J., Lokketangen, A.: A tabu search approach for the livestock collection problem. Comput. Oper. Res. (2008)
Reed, M., Yiannakou, A., Evering, R.: An ant colony algorithm for the multi-compartment vehicle routing problem. Appl. Soft Comput. (2014)
Reeves, C.: Modern Heuristic Techniques for Combinatorial Problems. McGraw- Hill Book Company Inc. (1995)
Relvas, S., Magatos, N.B., Neves, J.F.: Integrated scheduling and inventory management of an oil products distribution system. Omega (2014)
Solomon, M.M.: Algorithms for the vehicle routing and scheduling problems with time window and constraints. Oper. Res. (1987)
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)
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)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights 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)