CBMix

CBMix benchmark. Here you find instance definitions and the best known upper and lower bounds (to our knowledge) for the 23 instances of the CBMix benchmark created by Prins and Bouchenoua in 2004 [PB]. The values for the upper and lower bounds reported in the table only include traversal costs, i.e. service costs are omitted.


References in zbMATH (referenced in 11 articles )

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

  1. Lu, Yongliang; Hao, Jin-Kao; Wu, Qinghua: Hybrid evolutionary search for the traveling repairman problem with profits (2019)
  2. Ciancio, Claudio; Laganá, Demetrio; Vocaturo, Francesca: Branch-price-and-cut for the mixed capacitated general routing problem with time windows (2018)
  3. Lu, Yongliang; Benlic, Una; Wu, Qinghua: A hybrid dynamic programming and memetic algorithm to the traveling salesman problem with hotel selection (2018)
  4. Halvorsen-Weare, Elin E.; Savelsbergh, Martin W. P.: The bi-objective mixed capacitated general routing problem with different route balance criteria (2016)
  5. Cherif-Khettaf, Wahiba Ramdane; Rachid, Mais Haj; Bloch, Christelle; Chatonnay, Pascal: New notation and classification scheme for vehicle routing problems (2015)
  6. Irnich, Stefan; Laganà, Demetrio; Schlebusch, Claudia; Vocaturo, Francesca: Two-phase branch-and-cut for the mixed capacitated general routing problem (2015)
  7. Vidal, Thibaut; Crainic, Teodor Gabriel; Gendreau, Michel; Prins, Christian: A unified solution framework for multi-attribute vehicle routing problems (2014)
  8. Bach, Lukas; Hasle, Geir; Wøhlk, Sanne: A lower bound for the node, edge, and arc routing problem (2013)
  9. Bosco, Adamo; Laganà, Demetrio; Musmanno, Roberto; Vocaturo, Francesca: Modeling and solving the mixed capacitated general routing problem (2013)
  10. Pop, Petrică C.; Matei, Oliviu: A memetic algorithm approach for solving the multidimensional multi-way number partitioning problem (2013)
  11. Duhamel, Christophe; Lacomme, Philippe; Prodhon, Caroline: Efficient frameworks for greedy split and new depth first search split procedures for routing problems (2011)