We describe an artificial ant colony capable of solving the travelling salesman problem
(TSP). Ants of the artificial colony are able to generate successively shorter feasible tours by …

In this paper we introduce Ant-Q, a family of algorithms which present many similarities with
Q-learning (Watkins, 1989), and which we apply to the solution of symmetric and asymmetric …

Ant-Q is an algorithm belonging to the class of ant colony based methods, that is, of
combinatorial optimization methods in which a set of simple agents, called ants, cooperate …

In this thesis we describe a practical problem that we encountered in the on--line
optimization of a complex Flexible Manufacturing System. In the considered system a …

In this article we consider a variant of the classical asymmetric traveling salesman problem
(ATSP), namely the ATSP in which precedence constraints require that certain nodes must …

An important aspect of the vehicle routing problem (VRP) that has been largely overlooked
is the use of satellite facilities to replenish vehicles during a route. When possible, satellite …

This paper presents a branch-and-cut (B&C) algorithm for the problem of minimizing the
makespan associated with scheduling n jobs in an m-machine flowshop with setup times …

The research of traveling salesman problem is important in logistics distribution. There are
many stochastic disturbance factors affecting logistics distribution in real life. So the result …

In this article we consider a variant of the classical asymmetric traveling salesman problem,
namely the asymmetric Hamiltonian path problem in which precedence constraints require …

This dissertation studies an inventory routing problem with satellite facilities (IRPSF). The
major contributions are:(1) A cost analysis procedure to reduce a long term optimization …