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

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

1 2 3 ... 45 46 47 next

  1. Agarwal, Yogesh Kumar; Venkateshan, Prahalad: A new model for the asymmetric vehicle routing problem with simultaneous pickup and deliveries (2020)
  2. 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)
  3. Bortfeldt, Andreas; Yi, Junmin: The split delivery vehicle routing problem with three-dimensional loading constraints (2020)
  4. Bruni, M. E.; Beraldi, P.; Khodaparasti, S.: A hybrid reactive GRASP heuristic for the risk-averse (k)-traveling repairman problem with profits (2020)
  5. Chitsaz, Masoud; Cordeau, Jean-François; Jans, Raf: A branch-and-cut algorithm for an assembly routing problem (2020)
  6. Eshtehadi, Reza; Demir, Emrah; Huang, Yuan: Solving the vehicle routing problem with multi-compartment vehicles for city logistics (2020)
  7. Fotio Tiotsop, Lohic; Servetti, Antonio; Masala, Enrico: An integer linear programming model for efficient scheduling of UGV tasks in precision agriculture under human supervision (2020)
  8. Glize, Estèle; Roberti, Roberto; Jozefowiez, Nicolas; Ngueveu, Sandra Ulrich: Exact methods for mono-objective and bi-objective multi-vehicle covering tour problems (2020)
  9. Gnegel, Fabian; Fügenschuh, Armin: An iterative graph expansion approach for the scheduling and routing of airplanes (2020)
  10. Hintsch, Timo; Irnich, Stefan: Exact solution of the soft-clustered vehicle-routing problem (2020)
  11. Homsi, Gabriel; Martinelli, Rafael; Vidal, Thibaut; Fagerholt, Kjetil: Industrial and tramp ship routing problems: closing the gap for real-scale instances (2020)
  12. Lam, Edward; Mak-Hau, Vicky: Branch-and-cut-and-price for the cardinality-constrained multi-cycle problem in kidney exchange (2020)
  13. Lehuédé, Fabien; Péton, Olivier; Tricoire, Fabien: A lexicographic minimax approach to the vehicle routing problem with route balancing (2020)
  14. Arakaki, Rafael Kendy; Usberti, Fábio Luiz: An efficiency-based path-scanning heuristic for the capacitated arc routing problem (2019)
  15. Arnold, Florian; Gendreau, Michel; Sörensen, Kenneth: Efficiently solving very large-scale routing problems (2019)
  16. Arnold, Florian; Sörensen, Kenneth: Knowledge-guided local search for the vehicle routing problem (2019)
  17. Bach, Lukas; Hasle, Geir; Schulz, Christian: Adaptive large neighborhood search on the graphics processing unit (2019)
  18. Ben Ticha, Hamza; Absi, Nabil; Feillet, Dominique; Quilliot, Alain: Multigraph modeling and adaptive large neighborhood search for the vehicle routing problem with time windows (2019)
  19. Bettinelli, Andrea; Cacchiani, Valentina; Crainic, Teodor Gabriel; Vigo, Daniele: A branch-and-cut-and-price algorithm for the multi-trip separate pickup and delivery problem with time windows at customers and facilities (2019)
  20. Boysen, Nils; Briskorn, Dirk; Fedtke, Stefan; Schmickerath, Marcel: Automated sortation conveyors: a survey from an operational research perspective (2019)

1 2 3 ... 45 46 47 next


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