We propose a heuristic for a class of vehicle routing problems (VRPs) with minmax objective. These include the Capacitated VRP, the Capacitated VRP with multiple use of vehicles, and the Traveling Salesman Problem with multiple use of vehicles. A tabu search based adaptive memory procedure of instances indicate that the method produces very good solutions within reasonable computing times.

The Capacitated Centred Clustering Problem (CCCP) consists in partitioning a set of n points into p disjoint clusters with a known capacity. Each cluster is specified by a centroid. The objective is to minimize the total dissimilarity within each cluster, such that a given capacity limit of the cluster is not exceeded. This paper presents a solution procedure for the CCCP, using the hybrid meta...

We propose solutions for assignment of physical tasks to heterogeneous agents when the costs of the tasks change over time. We assume tasks have a natural growth rate which is counteracted by the work applied by the agents. As the future cost of a task depends on the agents allocation, reasoning must be both spatial and temporal to effectively minimize the growth so tasks can be completed. We p...

In this work, we suggest a Multi-Agent model based on a tabu search method for solving the permutation flow shop scheduling problem. The problem is strongly NP-hard and its resolution optimally within a reasonable time is impossible. The objective of this work is to minimize the makespan or the total duration of the schedule. The proposed model is composed of two classes of agents: Supervisor a...

The aim of the current research was to develop models predict severity accidents on rural roads in Tehran province, Iran. In this regard, using accident data from 2017 2020, machine learning algorithms, including multiple logistic regression, multilayer perceptron neural network (MLPNN), and radial basis function (RBFNN) models, as well statistical methods, Kolmogorov–Smirnov test, Friedman fac...