VRP

The Vehicle Routing Problem (VRP) is one of the most challenging combinatorial optimization task. Defined more than 40 years ago, this problem consists in designing the optimal set of routes for fleet of vehicles in order to serve a given set of customers. The interest in VRP is motivated by its practical relevance as well as by its considerable difficulty. This web is dedicated to the study of VRP; we have compiled here a great deal of information about it for public access: technical reports, many different variants of the problem, alternative algorithms and techniques for solving it, some well-known instances of the problem, the best-so-far solutions for those instances, bibliography, related links… (Source: http://plato.asu.edu)


References in zbMATH (referenced in 1047 articles )

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

1 2 3 ... 51 52 53 next

  1. Abdullahi, Hassana; Reyes-Rubiano, Lorena; Ouelhadj, Djamila; Faulin, Javier; Juan, Angel A.: Modelling and multi-criteria analysis of the sustainability dimensions for the green vehicle routing problem (2021)
  2. Ali, Ousmane; Côté, Jean-François; Coelho, Leandro C.: Models and algorithms for the delivery and installation routing problem (2021)
  3. Bakker, Steffen J.; Wang, Akang; Gounaris, Chrysanthos E.: Vehicle routing with endogenous learning: application to offshore plug and abandonment campaign planning (2021)
  4. Baller, Annelieke C.; Dabia, Said; Desaulniers, Guy; Dullaert, Wout E. H.: The inventory routing problem with demand moves (2021)
  5. Behrend, Moritz; Meisel, Frank; Fagerholt, Kjetil; Andersson, Henrik: A multi-period analysis of the integrated item-sharing and crowdshipping problem (2021)
  6. Ben Ticha, Hamza; Absi, Nabil; Feillet, Dominique; Quilliot, Alain; Van Woensel, Tom: The time-dependent vehicle routing problem with time windows and road-network information (2021)
  7. Beraldi, Patrizia; De Maio, Annarita; Laganà, Demetrio; Violi, Antonio: A pick-up and delivery problem for logistics e-marketplace services (2021)
  8. Bianchessi, Nicola; Irnich, Stefan; Tilk, Christian: A branch-price-and-cut algorithm for the capacitated multiple vehicle traveling purchaser problem with unitary demand (2021)
  9. Brandstätter, Christian: A metaheuristic algorithm and structured analysis for the Line-haul Feeder vehicle routing problem with time windows (2021)
  10. Bruglieri, M.; Mancini, S.; Peruzzini, R.; Pisacane, O.: The multi-period multi-trip container drayage problem with release and due dates (2021)
  11. Carrabs, Francesco: A biased random-key genetic algorithm for the set orienteering problem (2021)
  12. Ceselli, Alberto; Felipe, Ángel; Ortuño, M. Teresa; Righini, Giovanni; Tirado, Gregorio: A branch-and-cut-and-price algorithm for the electric vehicle routing problem with multiple technologies (2021)
  13. Cinar, Ahmet; Salman, F. Sibel; Bozkaya, Burcin: Prioritized single nurse routing and scheduling for home healthcare services (2021)
  14. Corberán, Ángel; Plana, Isaac; Reula, Miguel; Sanchis, José M.: On the distance-constrained close enough arc routing problem (2021)
  15. Czyzowicz, Jurek; Dereniowski, Dariusz; Ostrowski, Robert; Rytter, Wojciech: Gossiping by energy-constrained mobile agents in tree networks (2021)
  16. Emde, Simon; Tahirov, Nail; Gendreau, Michel; Glock, Christoph H.: Routing automated lane-guided transport vehicles in a warehouse handling returns (2021)
  17. Fink, Jiří; Hurink, Johann L.: Greedy algorithm for local heating problem (2021)
  18. Frank, Markus; Ostermeier, Manuel; Holzapfel, Andreas; Hübner, Alexander; Kuhn, Heinrich: Optimizing routing and delivery patterns with multi-compartment vehicles (2021)
  19. Gadegaard, S. L.; Lysgaard, J.: A symmetry-free polynomial formulation of the capacitated vehicle routing problem (2021)
  20. Heßler, Katrin; Irnich, Stefan: A branch-and-cut algorithm for the soft-clustered vehicle-routing problem (2021)

1 2 3 ... 51 52 53 next


Further publications can be found at: http://neo.lcc.uma.es/vrp/bibliography-on-vrp/