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

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

1 2 3 ... 32 33 34 next

  1. Leggieri, Valeria; Haouari, Mohamed: A matheuristic for the asymmetric capacitated vehicle routing problem (2018)
  2. Amous, Marwa; Toumi, Said; Jarboui, Bassem; Eddaly, Mansour: A variable neighborhood search algorithm for the capacitated vehicle routing problem (2017)
  3. Baldacci, Roberto; Hill, Alessandro; Hoshino, Edna A.; Lim, Andrew: Pricing strategies for capacitated ring-star problems based on dynamic programming algorithms (2017)
  4. Bistaffa, Filippo; Farinelli, Alessandro; Chalkiadakis, Georgios; Ramchurn, Sarvapali D.: A cooperative game-theoretic approach to the social ridesharing problem (2017)
  5. Blázsik, Zoltán; Fajfrik, Zoltán Imre: A heuristic framework on a common generalization of the vehicle routing problem and the linear ordering problem (2017)
  6. Borndörfer, Ralf; Sagnol, Guillaume; Schlechte, Thomas; Swarat, Elmar: Optimal duty rostering for toll enforcement inspectors (2017)
  7. Chen, Binhui; Qu, Rong; Bai, Ruibin; Ishibuchi, Hisao: An investigation on compound neighborhoods for VRPTW (2017)
  8. Chu, James C.; Yan, Shangyao; Huang, Han-Jheng: A multi-trip split-delivery vehicle routing problem with time windows for inventory replenishment under stochastic travel times (2017)
  9. Fedtke, Stefan; Boysen, Nils: Gantry crane and shuttle car scheduling in modern rail-rail transshipment yards (2017)
  10. Fotakis, Dimitris; Gourvès, Laurent; Monnot, Jér^ome: Selfish transportation games (2017)
  11. Gansterer, Margaretha; Küçüktepe, Murat; Hartl, Richard F.: The multi-vehicle profitable pickup and delivery problem (2017)
  12. Gaur, Daya Ram; Singh, Rishi Ranjan: A heuristic for cumulative vehicle routing using column generation (2017)
  13. González, Miguel A.; Palacios, Juan José; Vela, Camino R.; Hernández-Arauzo, Alejandro: Scatter search for minimizing weighted tardiness in a single machine scheduling with setups (2017)
  14. Han, Shuihua; Zhao, Ling; Chen, Kui; Luo, Zong-wei; Mishra, Deepa: Appointment scheduling and routing optimization of attended home delivery system with random customer behavior (2017)
  15. Hemmi, David; Tack, Guido; Wallace, Mark: Scenario-based learning for stochastic combinatorial optimisation (2017)
  16. He, Yun; Briand, Cyril; Jozefowiez, Nicolas: Inventory routing with explicit energy consumption: a mass-flow formulation and first experimentation (2017)
  17. Kammoun, Manel; Derbel, Houda; Ratli, Mostapha; Jarboui, Bassem: An integration of mixed VND and VNS: the case of the multivehicle covering tour problem (2017)
  18. Khachai, M.Yu.; Dubinin, Roman D.: Approximability of the vehicle routing problem in finite-dimensional Euclidean spaces (2017)
  19. Lichen, Junran; Li, Jianping; Lih, Ko-Wei: Approximation algorithms for constructing spanning K-trees using stock pieces of bounded length (2017)
  20. Mahdavi, Iraj; Bakhsi, Mani; Goli, Alireza; Tirkolaee, Erfan Babaee: A robust multi-trip vehicle routing problem of perishable products with intermediate depots and time windows (2017)

1 2 3 ... 32 33 34 next

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