METSlib

The METSlib QAP solver is a Tabu Search solver for the quadratic assignment problem, a combinatorial optimization problem that arises in many applicative cases. It can be used to find optimal locations for a set of facilities while minimizing the cost of moving commodities between them, to optimize the placement of components on a circuit board, and for many other applications. This software is based on the METSlib framework. (Source: http://freecode.com/)

Keywords for this software

Anything in here will be replaced on browsers that support the canvas element

References in zbMATH (referenced in 13 articles , 1 standard article )

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

  1. Galligari, Alessandro; Maischberger, Mirko; Schoen, Fabio: Local search heuristics for the zone planning problem (2017)
  2. Doppstadt, C.; Koberstein, A.; Vigo, D.: The hybrid electric vehicle-traveling salesman problem (2016)
  3. Li, Jian; Li, Yang; Pardalos, Panos M.: Multi-depot vehicle routing problem with time windows under shared depot resources (2016)
  4. Hemmelmayr, Vera C.: Sequential and parallel large neighborhood search algorithms for the periodic location routing problem (2015)
  5. Contardo, Claudio; Martinelli, Rafael: A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints (2014)
  6. Vidal, Thibaut; Crainic, Teodor Gabriel; Gendreau, Michel; Prins, Christian: Implicit depot assignments and rotations in vehicle routing heuristics (2014)
  7. Vidal, Thibaut; Crainic, Teodor Gabriel; Gendreau, Michel; Prins, Christian: A unified solution framework for multi-attribute vehicle routing problems (2014)
  8. Zhang, Tao; Chaovalitwongse, W.Art; Zhang, Yuejie: Integrated ant colony and tabu search approach for time dependent vehicle routing problems with simultaneous pickup and delivery (2014)
  9. Chen, Chen-Fu; Wu, Muh-Cherng; Lin, Keng-Han: Effect of solution representations on tabu search in scheduling applications (2013)
  10. Zhang, Junlong; Lam, William H.K.; Chen, Bi Yu: A stochastic vehicle routing problem with travel time uncertainty: trade-off between cost and customer service (2013)
  11. Basu, Sumanta: Neighborhood reduction strategy for tabu search implementation in asymmetric traveling salesman problem (2012) ioport
  12. Cordeau, Jean-François; Maischberger, Mirko: A parallel iterated tabu search heuristic for vehicle routing problems (2012) ioport
  13. Maischberger, Mirko; Cordeau, Jean-François: Solving variants of the vehicle routing problem with a simple parallel iterated tabu search (2011)