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

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

1 2 3 ... 41 42 43 next

  1. Arakaki, Rafael Kendy; Usberti, Fábio Luiz: An efficiency-based path-scanning heuristic for the capacitated arc routing problem (2019)
  2. Arnold, Florian; Sörensen, Kenneth: Knowledge-guided local search for the vehicle routing problem (2019)
  3. Bach, Lukas; Hasle, Geir; Schulz, Christian: Adaptive large neighborhood search on the graphics processing unit (2019)
  4. 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)
  5. Boysen, Nils; Briskorn, Dirk; Fedtke, Stefan; Schmickerath, Marcel: Automated sortation conveyors: a survey from an operational research perspective (2019)
  6. Breunig, U.; Baldacci, R.; Hartl, R. F.; Vidal, T.: The electric two-echelon vehicle routing problem (2019)
  7. Bruglieri, M.; Mancini, S.; Pezzella, F.; Pisacane, O.: A path-based solution approach for the green vehicle routing problem (2019)
  8. Hiermann, Gerhard; Hartl, Richard F.; Puchinger, Jakob; Vidal, Thibaut: Routing a mix of conventional, plug-in hybrid, and electric vehicles (2019)
  9. Hoogeboom, Maaike; Dullaert, Wout: Vehicle routing with arrival time diversification (2019)
  10. Konur, Dinçer; Geunes, Joseph: Integrated districting, fleet composition, and inventory planning for a multi-retailer distribution system (2019)
  11. Letchford, Adam N.; Salazar-González, Juan-José: The capacitated vehicle routing problem: stronger bounds in pseudo-polynomial time (2019)
  12. Lu, Da; Gzara, Fatma: The robust vehicle routing problem with time windows: solution by branch and price and cut (2019)
  13. Nowak, Maciek; Hewitt, Mike; Bachour, Hussam: Mileage bands in freight transportation (2019)
  14. Özener, Okan Örsan: Solving the integrated shipment routing problem of a less-than-truckload carrier (2019)
  15. Paul, Joydeep; Agatz, Niels; Spliet, Remy; de Koster, René: Shared capacity routing problem -- an omni-channel retail study (2019)
  16. Reihaneh, Mohammad; Ghoniem, Ahmed: A branch-and-price algorithm for a vehicle routing with demand allocation problem (2019)
  17. Rossit, Diego Gabriel; Vigo, Daniele; Tohmé, Fernando; Frutos, Mariano: Visual attractiveness in routing problems: a review (2019)
  18. Salavati-Khoshghalb, Majid; Gendreau, Michel; Jabali, Ola; Rei, Walter: An exact algorithm to solve the vehicle routing problem with stochastic demands under an optimal restocking policy (2019)
  19. Stavropoulou, F.; Repoussis, P. P.; Tarantilis, C. D.: The vehicle routing problem with profits and consistency constraints (2019)
  20. Tilk, Christian; Drexl, Michael; Irnich, Stefan: Nested branch-and-price-and-cut for vehicle routing problems with multiple resource interdependencies (2019)

1 2 3 ... 41 42 43 next


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