BoneRoute

BoneRoute: An adaptive memory-based method for effective fleet management This paper presents an adaptive memory-based method for solving the Capacitated Vehicle Routing Problem (CVRP), called BoneRoute. The CVRP deals with the problem of finding the optimal sequence of deliveries conducted by a fleet of homogeneous vehicles, based at one depot, to serve a set of customers. The computational performance of the BoneRoute was found to be very efficient, producing high quality solutions over two sets of well known case studies examined.


References in zbMATH (referenced in 32 articles , 1 standard article )

Showing results 1 to 20 of 32.
Sorted by year (citations)

1 2 next

  1. Dominguez, Oscar; Juan, Angel A.; Barrios, Barry; Faulin, Javier; Agustin, Alba: Using biased randomization for solving the two-dimensional loading vehicle routing problem with heterogeneous fleet (2016)
  2. Juan, Angel A.; Faulin, Javier; Ferrer, Albert; Lourenço, Helena R.; Barrios, Barry: MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems (2013)
  3. Tarantilis, Christos D.: Adaptive multi-restart tabu search algorithm for the vehicle routing problem with cross-docking (2013)
  4. Subramanian, Anand; Penna, Puca Huachi Vaz; Uchoa, Eduardo; Ochi, Luiz Satoru: A hybrid algorithm for the heterogeneous fleet vehicle routing problem (2012)
  5. Guimarans, Daniel; Herrero, Rosa; Riera, Daniel; Juan, Angel A.; Ramos, Juan José: Combining probabilistic algorithms, constraint programming and Lagrangian relaxation to solve the vehicle routing problem (2011)
  6. Marinakis, Yannis; Marinaki, Magdalene: Bumble bees mating optimization algorithm for the vehicle routing problem (2011)
  7. Szeto, W.Y.; Wu, Yongzhong; Ho, Sin C.: An artificial bee colony algorithm for the capacitated vehicle routing problem (2011)
  8. Aleman, Rafael E.; Hill, Raymond R.: A tabu search with vocabulary building approach for the vehicle routing problem with Split demands (2010)
  9. Bolduc, Marie-Claude; Laporte, Gilbert; Renaud, Jacques; Boctor, Fayez F.: A tabu search heuristic for the split delivery vehicle routing problem with production and demand calendars (2010)
  10. Marinakis, Yannis; Marinaki, Magdalene; Dounias, Georgios: Honey bees mating optimization algorithm for large scale vehicle routing problems (2010)
  11. Repoussis, P.P.; Tarantilis, C.D.; Bräysy, O.; Ioannou, G.: A hybrid evolution strategy for the open vehicle routing problem (2010)
  12. Zachariadis, Emmanouil E.; Tarantilis, Christos D.; Kiranoudis, Chris T.: An adaptive memory methodology for the vehicle routing problem with simultaneous pick-ups and deliveries (2010)
  13. Aleman, Rafael E.; Zhang, Xinhui; Hill, Raymond R.: A ring-based diversification scheme for routing problems (2009)
  14. Zachariadis, Emmanouil E.; Tarantilis, Christos D.; Kiranoudis, Christos T.: A guided tabu search for the vehicle routing problem with two-dimensional loading constraints (2009)
  15. Paraskevopoulos, D.C.; Repoussis, P.P.; Tarantilis, C.D.; Ioannou, G.; Prastacos, G.P.: A reactive variable neighborhood tabu search for the heterogeneous fleet vehicle routing problem with time windows (2008)
  16. Perboli, Guido; Pezzella, Ferdinando; Tadei, Roberto: EVE-OPT: a hybrid algorithm for the capacitated vehicle routing problem (2008)
  17. Tarantilis, C.D.; Zachariadis, E.E.; Kiranoudis, C.T.: Corrigendum: A guided tabu search for the heterogeneous vehicle routeing problem (2008)
  18. Derigs, U.; Kaiser, R.: Applying the attribute based hill climber heuristic to the vehicle routing problem (2007)
  19. Kytöjoki, Jari; Nuortio, Teemu; Bräysy, Olli; Gendreau, Michel: An efficient variable neighborhood search heuristic for very large scale vehicle routing problems (2007)
  20. Laporte, Gilbert: What you should know about the vehicle routing problem (2007)

1 2 next