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 1023 articles )

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

1 2 3 ... 50 51 52 next

  1. Baller, Annelieke C.; Dabia, Said; Desaulniers, Guy; Dullaert, Wout E. H.: The inventory routing problem with demand moves (2021)
  2. 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)
  3. Bianchessi, Nicola; Irnich, Stefan; Tilk, Christian: A branch-price-and-cut algorithm for the capacitated multiple vehicle traveling purchaser problem with unitary demand (2021)
  4. Bruglieri, M.; Mancini, S.; Peruzzini, R.; Pisacane, O.: The multi-period multi-trip container drayage problem with release and due dates (2021)
  5. 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)
  6. Czyzowicz, Jurek; Dereniowski, Dariusz; Ostrowski, Robert; Rytter, Wojciech: Gossiping by energy-constrained mobile agents in tree networks (2021)
  7. Fink, Jiří; Hurink, Johann L.: Greedy algorithm for local heating problem (2021)
  8. Gadegaard, S. L.; Lysgaard, J.: A symmetry-free polynomial formulation of the capacitated vehicle routing problem (2021)
  9. Heßler, Katrin; Irnich, Stefan: A branch-and-cut algorithm for the soft-clustered vehicle-routing problem (2021)
  10. Keskin, Merve; Çatay, Bülent; Laporte, Gilbert: A simulation-based heuristic for the electric vehicle routing problem with time windows and stochastic waiting times at recharging stations (2021)
  11. Mathlouthi, Ines; Gendreau, Michel; Potvin, Jean-Yves: Branch-and-price for a multi-attribute technician routing and scheduling problem (2021)
  12. Nafstad, Gaute Messel; Haugseth, Amund; Høyland, Vebjørn; Stålhane, Magnus: An exact solution method for a rich helicopter flight scheduling problem arising in offshore oil and gas logistics (2021)
  13. Pan, Binbin; Zhang, Zhenzhen; Lim, Andrew: A hybrid algorithm for time-dependent vehicle routing problem with time windows (2021)
  14. Rim, Suk-Chul; Vu, Hang T. T.: Transshipment vehicle routing with pickup and delivery for cross-filling (2021)
  15. Wolfinger, David: A large neighborhood search for the pickup and delivery problem with time windows, split loads and transshipments (2021)
  16. Adamo, Tommaso; Ghiani, Gianpaolo; Guerriero, Emanuela: An enhanced lower bound for the time-dependent travelling salesman problem (2020)
  17. Agarwal, Yogesh Kumar; Venkateshan, Prahalad: A new model for the asymmetric vehicle routing problem with simultaneous pickup and deliveries (2020)
  18. Aldana-Galván, I.; Catana-Salazar, J. C.; Díaz-Báñez, J. M.; Duque, F.; Fabila-Monroy, R.; Heredia, M. A.; Ramírez-Vigueras, A.; Urrutia, J.: On optimal coverage of a tree with multiple robots (2020)
  19. Alvarez, Aldair; Cordeau, Jean-François; Jans, Raf; Munari, Pedro; Morabito, Reinaldo: Formulations, branch-and-cut and a hybrid heuristic algorithm for an inventory routing problem with perishable products (2020)
  20. Barbosa, Luiz Henrique; Uchoa, Eduardo: A branch-cut-and-price algorithm for the traveling salesperson problem with hotel selection (2020)

1 2 3 ... 50 51 52 next


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