CVRPSEP

CVRPSEP: A package of seperations routines for the capacitated vehicle routing problem. The CVRPSEP package is a collection of routines, written in the C programming language, for separation of various classes of cuts in branch-and-cut algorithms for the Capacitated Vehicle Routing Problem. The routines are those that were used in ”A New Branch-and-Cut Algorithm for the Capacitated Vehicle Routing Problem” (by Lysgaard, Letchford, and Eglese, published in Mathematical Programming - see Publications). The package contains separation routines for rounded capacity inequalities, homogeneous multistar inequalities, generalized multistar inequalities, framed capacity inequalities, strengthened comb inequalities, and hypotour inequalities. In addition, the package contains a routine for generating candidate sets for branching.


References in zbMATH (referenced in 22 articles )

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

1 2 next

  1. Martinelli, Rafael; Contardo, Claudio: Exact and heuristic algorithms for capacitated vehicle routing problems with quadratic costs structure (2015)
  2. Battarra, Maria; Pessoa, Artur Alves; Subramanian, Anand; Uchoa, Eduardo: Exact algorithms for the traveling salesman problem with draft limits (2014)
  3. Contardo, Claudio; Martinelli, Rafael: A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints (2014)
  4. Gauvin, Charles; Desaulniers, Guy; Gendreau, Michel: A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands (2014)
  5. Hà, Minh Hoàng; Bostel, Nathalie; Langevin, André; Rousseau, Louis-Martin: An exact algorithm and a metaheuristic for the generalized vehicle routing problem with flexible fleet size (2014)
  6. Lysgaard, Jens; Wøhlk, Sanne: A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem (2014)
  7. Masson, Renaud; Ropke, Stefan; Lehuédé, Fabien; Péton, Olivier: A branch-and-cut-and-price approach for the pickup and delivery problem with shuttle routes (2014)
  8. Avella, Pasquale; Boccia, Maurizio; Vasilyev, Igor: Lifted and local reachability cuts for the vehicle routing problem with time windows (2013)
  9. Bartolini, Enrico; Cordeau, Jean-François; Laporte, Gilbert: Improved lower bounds and exact algorithm for the capacitated arc routing problem (2013)
  10. Reiter, Peter; Gutjahr, Walter J.: Exact hybrid algorithms for solving a bi-objective vehicle routing problem (2012)
  11. Belenguer, José-Manuel; Benavent, Enrique; Prins, Christian; Prodhon, Caroline; Wolfler Calvo, Roberto: A Branch-and-Cut method for the Capacitated Location-Routing Problem (2011)
  12. Tricoire, Fabien; Doerner, Karl F.; Hartl, Richard F.; Iori, Manuel: Heuristic and exact algorithms for the multi-pile vehicle routing problem (2011)
  13. Baldacci, Roberto; Bartolini, Enrico; Mingozzi, Aristide; Roberti, Roberto: An exact solution framework for a broad class of vehicle routing problems (2010)
  14. Baldacci, Roberto; Toth, Paolo; Vigo, Daniele: Exact algorithms for routing problems under vehicle capacity constraints (2010)
  15. Lysgaard, Jens: The pyramidal capacitated vehicle routing problem (2010)
  16. Rieck, Julia; Zimmermann, Jürgen: A new mixed integer linear model for a rich vehicle routing problem with docking constraints (2010)
  17. Baldacci, Roberto; Mingozzi, Aristide: A unified exact method for solving different classes of vehicle routing problems (2009)
  18. Baldacci, Roberto; Christofides, Nicos; Mingozzi, Aristide: An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts (2008)
  19. Baldacci, Roberto; Toth, Paolo; Vigo, Daniele: Recent advances in vehicle routing exact algorithms (2007)
  20. Fukasawa, Ricardo; Longo, Humberto; Lysgaard, Jens; Poggi de Aragão, Marcus; Reis, Marcelo; Uchoa, Eduardo; Werneck, Renato F.: Robust branch-and-cut-and-price for the capacitated vehicle routing problem (2006)

1 2 next