The ant system is a new meta-heuristic for hard combinatorial optimization problems. It is a population-based approach that uses exploitation of positive feedback as well as greedy search. It was first proposed for tackling the well known Traveling Salesman Problem (TSP), but has been also...

Transportation problem at its general form consists in finding an optimum transportation plan of a product from the receiving centers to consuming centers, so that the transportation costs to be minimal

The thesis is comprised of topics dealing with variations of the pickup and delivery problem (PDP), a subfield of commercial transportation problems. The research on PDPs has been advanced thematically and methodologically by studying new topics and developing extensions of existing algorithms...

In this paper, we develop a simple algorithm for obtaining the global solution to a small scale fixed-charge transportation problem (FCTP). The procedure itself is very quick. The proposed method solves FCTP by decomposing the problem into series of smaller sub-problems, which is novel and can...

The routing of commodities is a tactical problem in supply chain management that aims to synchronise transportation services connecting a network of warehouses and consolidation locations. This paper considers the routing of commodities in a transportation network that is flexible in response to...