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

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

1 2 3 ... 30 31 32 next

  1. Bistaffa, Filippo; Farinelli, Alessandro; Chalkiadakis, Georgios; Ramchurn, Sarvapali D.: A cooperative game-theoretic approach to the social ridesharing problem (2017)
  2. Borndörfer, Ralf; Sagnol, Guillaume; Schlechte, Thomas; Swarat, Elmar: Optimal duty rostering for toll enforcement inspectors (2017)
  3. Fedtke, Stefan; Boysen, Nils: Gantry crane and shuttle car scheduling in modern rail-rail transshipment yards (2017)
  4. Gansterer, Margaretha; Küçüktepe, Murat; Hartl, Richard F.: The multi-vehicle profitable pickup and delivery problem (2017)
  5. 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)
  6. Ostrowski, Krzysztof; Karbowska-Chilinska, Joanna; Koszelew, Jolanta; Zabielski, Pawel: Evolution-inspired local improvement algorithm solving orienteering problem (2017)
  7. Pecin, Diego; Pessoa, Artur; Poggi, Marcus; Uchoa, Eduardo: Improved branch-cut-and-price for capacitated vehicle routing (2017)
  8. Song, Liang; Gu, Hao; Huang, Hejiao: A lower bound for the adaptive two-echelon capacitated vehicle routing problem (2017)
  9. Sundar, Kaarthik; Rathinam, Sivakumar: Multiple depot ring star problem: a polyhedral study and an exact algorithm (2017)
  10. Turkensteen, Marcel; Malyshev, Dmitry; Goldengorin, Boris; Pardalos, Panos M.: The reduction of computation times of upper and lower tolerances for selected combinatorial optimization problems (2017)
  11. Wang, Xingyin; Poikonen, Stefan; Golden, Bruce: The vehicle routing problem with drones: several worst-case results (2017)
  12. Afifi, Sohaib; Dang, Duc-Cuong; Moukrim, Aziz: Heuristic solutions for the vehicle routing problem with time windows and synchronized visits (2016)
  13. Andreatta, G.; Casula, M.; De Francesco, C.; De Giovanni, L.: A branch-and-price based heuristic for the stochastic vehicle routing problem with hard time windows (2016)
  14. Archetti, Claudia; Corberán, Ángel; Plana, Isaac; Sanchis, José M.; Speranza, M.Grazia: A branch-and-cut algorithm for the orienteering arc routing problem (2016)
  15. Archetti, Claudia; Savelsbergh, Martin; Speranza, M.Grazia: The vehicle routing problem with occasional drivers (2016)
  16. Baklagis, D.G.; Dikas, G.; Minis, I.: The team orienteering pick-up and delivery problem with time windows and its applications in fleet sizing (2016)
  17. Bautzer, Ana; Gouveia, Luís; Paias, Ana; Pires, José Manuel: Models for a Steiner multi-ring network design problem with revenues (2016)
  18. Brandão, José: A deterministic iterated local search algorithm for the vehicle routing problem with backhauls (2016)
  19. Breunig, U.; Schmid, V.; Hartl, R.F.; Vidal, T.: A large neighbourhood based heuristic for two-echelon routing problems (2016)
  20. Bui, Quoc Trung; Deville, Yves; Pham, Quang Dung: Exact methods for solving the elementary shortest and longest path problems (2016)

1 2 3 ... 30 31 32 next

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