-
Metaheuristics for the Asymmetric Traveling Salesman Problem
Described in this paper .
|
BROWSE
|
-
Hybrid tabu search for Lot Sizing problems
Hybrid tabu search and Relax-and-fix for Lot Sizing
problems, together with a set of benchmark instances and
models.
Described in this paper .
|
BROWSE
|
-
python-glpk
An inteface to allow calling GLPK from Python. (Required
for the Lot Sizing code.)
|
BROWSE
|
-
Sheduling metaheuristics
Some simple metaheuristics for scheduling problems, described in this paper .
|
BROWSE
|
-
MIP tabu search
tabu search for the general MIP, using GLPK. Described in this paper .
|
BROWSE
|
- The niche search library, a series of C++ classes that
implement a (simplified) version of the evolutionary structure
described in the Niche
Search paper.
|
BROWSE
FTP PACKAGE
|
-
A Genome for a class of vehicle routing
problems to use with niche search, described in the Manhattan paper.
Includes local searches procedures specific for this type of
problems.
|
BROWSE
FTP PACKAGE
|
Back to my home page