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

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

1 2 3 ... 26 27 28 next

  1. Afifi, Sohaib; Dang, Duc-Cuong; Moukrim, Aziz: Heuristic solutions for the vehicle routing problem with time windows and synchronized visits (2016)
  2. 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)
  3. Bautzer, Ana; Gouveia, Luís; Paias, Ana; Pires, José Manuel: Models for a Steiner multi-ring network design problem with revenues (2016)
  4. Brandão, José: A deterministic iterated local search algorithm for the vehicle routing problem with backhauls (2016)
  5. Cattaruzza, Diego; Absi, Nabil; Feillet, Dominique: Vehicle routing problems with multiple trips (2016)
  6. Chakrabarty, Deeparnab; Swamy, Chaitanya: Facility location with client latencies: LP-based techniques for minimum-latency problems (2016)
  7. Di Puglia Pugliese, Luigi; Guerriero, Francesca; Zorbas, Dimitrios; Razafindralambo, Tahiry: Modelling the mobile target covering problem using flying drones (2016)
  8. Di Puglia Pugliese, Luigi; Guerriero, Francesca: On the shortest path problem with negative cost cycles (2016)
  9. Dominguez, Oscar; Juan, Angel A.; Barrios, Barry; Faulin, Javier; Agustin, Alba: Using biased randomization for solving the two-dimensional loading vehicle routing problem with heterogeneous fleet (2016)
  10. Gørtz, Inge Li; Molinaro, Marco; Nagarajan, Viswanath; Ravi, R.: Capacitated vehicle routing with nonuniform speeds (2016)
  11. Hill, Alessandro; Voß, Stefan: Optimal capacitated ring trees (2016)
  12. Huang, Can; Zhang, Defu; Si, Yain-Whar; Leung, Stephen C.H.: Tabu search for the real-world carpooling problem (2016)
  13. Jaillet, Patrick; Qi, Jin; Sim, Melvyn: Routing optimization under uncertainty (2016)
  14. Khachay, Michael; Neznakhina, Katherine: Approximability of the minimum-weight $k$-size cycle cover problem (2016)
  15. Kilby, Philip; Urli, Tommaso: Fleet design optimisation from historical data using constraint programming and large neighbourhood search (2016)
  16. Laporte, Gilbert: Scheduling issues in vehicle routing (2016)
  17. Lees-Miller, John D.: Minimising average passenger waiting time in personal rapid transit systems (2016)
  18. Malaguti, Enrico; Durán, Rosa Medina; Toth, Paolo: A metaheuristic framework for nonlinear capacitated covering problems (2016)
  19. Morito, Susumu; Inoue, Tatsuki; Nakahara, Ryo; Hirota, Takuya: Optimization of vehicle routes with delivery and pickup for a rental business: a case study (2016)
  20. Ritzinger, Ulrike; Puchinger, Jakob; Hartl, Richard F.: Dynamic programming based metaheuristics for the dial-a-ride problem (2016)

1 2 3 ... 26 27 28 next


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