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...

In this paper, we consider a multi-index constrained transportation problem (CTP) of axial constraints with bounds on destination requirements, source availabilities, and multiple types of commodities. The specified problem is converted into a related transportation problem by adding a source, a...

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...

This paper presents a Genetic Algorithm for the Vehicle Routing and Scheduling Problem with time windows and temporal synchronization constraints. That means that as opposed to the usual procedure, in addition to the usual task covering, some vertices must be served by more than one vehicle at...

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...