Abstract
Rich Vehicle Routing Problems (RVRPs) refer to complex and realistic extensions of the classical Vehicle Routing Problem. They constitute a hot topic in logistics due to their high number of relevant applications. This work focuses on a RVRP with the following characteristics: (a) heterogeneous fleet of vehicles, (b) site-dependency, i.e., not all types of vehicle can reach all customers, (c) asymmetric costs, and (d) stochastic demands. We formally define the problem and describe real-life applications. Our main contribution is a simheuristic-based methodology including a Successive Approximations Method for solving it. A computational experiment is carried out to illustrate the proposed methodology. Moreover, the suitability of considering a simheuristic approach is analyzed.
Keywords
- Simheuristics
- Successive approximations method
- Heterogeneous VRP
- Site-dependent VRP
- Metaheuristics
- Stochastic optimization problems
This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Branch and Cut. http://www.coin-or.org/SYMPHONY/branchandcut/VRP/data/
Bianchi, L., Birattari, M., Chiarandini, M., Manfrin, M., Mastrolilli, M., Paquete, L., Rossi-Doria, O., Schiavinotto, T.: Hybrid metaheuristics for the vehicle routing problem with stochastic demands. J. Math. Modell. Algorithms 5, 91–110 (2006)
Bianchi, L., Marco, D., Gambardella, L.M., Gutjahr, W.J.: A survey on metaheuristics for stochastic combinatorial optimization. Nat. Comput. 8, 239–287 (2009)
Caceres, J., Arias, P., Guimarans, D., Riera, D., Juan, A.: Rich vehicle routing problem: a survey. ACM Comput. Surv. 47(2), 1–28 (2014)
Chao, I.M., Liou, T.S.: A new tabu search heuristic for the site-dependent vehicle routing problem. Next Wave Comput. Optim. Decis. Technol. 29, 107–119 (2005)
Clarke, G., Wright, J.: Scheduling of vehicles from a central depot to a number of delivering points. Oper. Res. 12, 568–581 (1964)
Cordeau, J.F., Laporte, G.: A tabu search algorithm for the site dependent vehicle routing problem with time windows. Inf. Syst. Oper. Res. 39(3), 292–298 (2001)
Cornillier, F., Boctor, F., Renaud, J.: Heuristics for the multi-depot petrol station replenishment problem with time windows. Eur. J. Oper. Res. 220, 361–369 (2012)
Dror, M., Trudeau, P.: Stochastic vehicle routing with modified savings algorithms. Eur. J. Oper. Res. 23, 228–235 (1986)
Gendreau, M., Laporte, G., Séguin, R.: Stochastic vehicle routing with modified savings algorithms. Eur. J. Oper. Res. 88, 3–12 (1996)
Gruler, A., Juan, A., Steglich, M.: A heuristic approach for smart waste collection management. In: Proceedings of the Metaheuristics International Conference, Agadir, Morocco (2015)
Herrero, R., Rodriguez, A., Caceres-Cruz, J., Juan, A.: Solving vehicle routing problems with asymmetric costs and heterogeneous fleets. Int. J. Adv. Oper. Manag. 6(1), 58–80 (2014)
Hoff, A., Andersson, H., Christiansen, M., Hasle, G., Løkketangen, A.: Industrial aspects and literature survey: fleet composition and routing. Comput. Oper. Res. 37(9), 2041–2061 (2010)
Juan, A., Faulin, J., Caceres, J., Barrios, B., Martinez, E.: A successive approximations method for the heterogeneous vehicle routing problem: analyzing different fleet configurations. Eur. J. Ind. Eng. 8(6), 762–788 (2014)
Juan, A., Faulin, J., Grasman, S., Rabe, M., Figueira, G.: A review of simheuristics: extending metaheuristics to deal with stochastic optimization problems. Oper. Res. Perspect. 2, 62–72 (2015)
Juan, A., Faulin, J., Grasman, S., Riera, D., Marull, J., Mendez, C.: Using safety stocks and simulation to solve the vehicle routing problem with stochastic demands. Transp. Res. Part C: Emerg. Technol. 19(5), 751–765 (2011)
Juan, A., Faulin, J., Jorba, J., Caceres, J., Marques, J.M.: Using parallel & distributed computing for real-time solving of vehicle routing problems with stochastic demands. Ann. Oper. Res. 207(1), 43–65 (2013)
Juan, A., Faulin, J., Jorba, J., Riera, D., Masip, D., Barrios, B.: On the use of monte carlo simulation, cache and splitting techniques to improve the clarke and wright savings heuristics. J. Oper. Res. Soc. 62, 1085–1097 (2011)
Lourenço, H.R., Martin, O.C., Stützle, T.: Iterated local search: framework and applications. In: Gendreau, M., Potvin, J.-Y. (eds.) Handbook of Metaheuristics. International Series in Operations Research & Management Science, vol. 146, pp. 363–397. Springer, US (2010)
Nag, B., Golden, B., Assad, A.: Vehicle routing with site dependencies. In: Vehicle Routing: Methods and Studies, pp. 149–159. Elsevier, Amsterdam (1988)
Pisinger, D., Ropke, S.: A general heuristic for vehicle routing problems. Comput. Oper. Res. 34(8), 2403–2435 (2007)
Talbi, E.: Metaheuristics: From Design to Implementation. Wiley, New Jersey (2009)
Tillman, F.A.: The multiple terminal delivery problem with probabilistic demands. Transp. Sci. 3, 192–204 (1969)
Yang, W.H., Mathur, K., Ballou, R.H.: Stochastic vehicle routing problem with restocking. Transp. Sci. 34, 99–112 (2000)
Yusuf, I.: Solving multi-depot, heterogeneous, site dependent and asymmetric VRP using three steps heuristic. J. Algorithms Optim. 2(2), 28–42 (2014)
Acknowledgments
This work has been partially supported by the Spanish Ministry of Economy and Competitiveness (TRA2013-48180-C3-P and TRA2015-71883-REDT), FEDER, the Catalan Government (2014-CTP-00001) and the Government of Andorra (ACTP022-AND/2014).
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
Calvet, L., Pagès-Bernaus, A., Travesset-Baro, O., Juan, A.A. (2016). A Simheuristic for the Heterogeneous Site-Dependent Asymmetric VRP with Stochastic Demands. In: Luaces , O., et al. Advances in Artificial Intelligence. CAEPIA 2016. Lecture Notes in Computer Science(), vol 9868. Springer, Cham. https://doi.org/10.1007/978-3-319-44636-3_38
Download citation
DOI: https://doi.org/10.1007/978-3-319-44636-3_38
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-44635-6
Online ISBN: 978-3-319-44636-3
eBook Packages: Computer ScienceComputer Science (R0)