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

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

1 2 3 ... 34 35 36 next

  1. Atefi, Reza; Salari, Majid; C.Coelho, Leandro; Renaud, Jacques: The open vehicle routing problem with decoupling points (2018)
  2. Ben Jouida, Sihem; Krichen, Saoussen: A DSS based on optimizer tools and MTS meta-heuristic for the warehousing problem with conflicts (2018)
  3. Bulhões, Teobaldo; Hà, Minh Hoàng; Martinelli, Rafael; Vidal, Thibaut: The vehicle routing problem with service level constraints (2018)
  4. Burger, M.; Su, Z.; De Schutter, B.: A node current-based 2-index formulation for the fixed-destination multi-depot travelling salesman problem (2018)
  5. de Oliveira da Costa, Paulo Roberto; Mauceri, Stefano; Carroll, Paula; Pallonetto, Fabiano: A genetic algorithm for a green vehicle routing problem (2018)
  6. Grazia Speranza, M.: Trends in transportation and logistics (2018)
  7. Hill, Alessandro; Voß, Stefan: Generalized local branching heuristics and the capacitated ring tree problem (2018)
  8. Kirschstein, Thomas; Bierwirth, Christian: The selective traveling salesman problem with emission allocation rules (2018)
  9. Lahyani, Rahma; Coelho, Leandro C.; Renaud, Jacques: Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem (2018)
  10. Leggieri, Valeria; Haouari, Mohamed: A matheuristic for the asymmetric capacitated vehicle routing problem (2018)
  11. Männel, Dirk; Bortfeldt, Andreas: Solving the pickup and delivery problem with three-dimensional loading constraints and reloading ban (2018)
  12. Naccache, Salma; C^oté, Jean-François; Coelho, Leandro C.: The multi-pickup and delivery problem with time windows (2018)
  13. Ozbaygin, Gizem; Karasan, Oya; Yaman, Hande: New exact solution approaches for the split delivery vehicle routing problem (2018)
  14. Santini, Alberto; Plum, Christian E.M.; Ropke, Stefan: A branch-and-price approach to the feeder network design problem (2018)
  15. Wei, Lijun; Zhang, Zhenzhen; Zhang, Defu; Leung, Stephen C.H.: A simulated annealing algorithm for the capacitated vehicle routing problem with two-dimensional loading constraints (2018)
  16. Zhou, Lin; Baldacci, Roberto; Vigo, Daniele; Wang, Xu: A multi-depot two-echelon vehicle routing problem with delivery options arising in the last mile distribution (2018)
  17. Amous, Marwa; Toumi, Said; Jarboui, Bassem; Eddaly, Mansour: A variable neighborhood search algorithm for the capacitated vehicle routing problem (2017)
  18. Azadian, Farshid; Murat, Alper; Chinnam, Ratna Babu: An unpaired pickup and delivery problem with time dependent assignment costs: application in air cargo transportation (2017)
  19. Baldacci, Roberto; Hill, Alessandro; Hoshino, Edna A.; Lim, Andrew: Pricing strategies for capacitated ring-star problems based on dynamic programming algorithms (2017)
  20. Bistaffa, Filippo; Farinelli, Alessandro; Chalkiadakis, Georgios; Ramchurn, Sarvapali D.: A cooperative game-theoretic approach to the social ridesharing problem (2017)

1 2 3 ... 34 35 36 next


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