this paper addresses the vehicle routing problem with delivery time cost. this problem aims to find a set of routes of minimal total costs including the travelling cost and delivery time cost, starting and ending at the depot, in such a way that each customer is visited by one vehicle given the capacity of the vehicle to satisfy a specific demand. in this research, a hybrid metaheuristic approa...

Local discriminant bases method is a powerful algorithmic framework for feature extraction and classification applications that is based on supervised training. It is considerably faster compared to more theoretically ideal feature extraction methods such as principal component analysis or projection pursuit. In this paper an optimization block is added to original local discriminant bases algo...

The purpose of this paper is to discuss the use of the local mutation genetic algorithm (LMGA). In the local mutation technique chromosomes are constrained to lie at the vertices of a network. The location on a chromosome where mutations are allowed to occur is correlated with the location of the chromosome in the network. This paper analyzes the type of network needed for local mutation. It al...

Template matching is a widely used technique in many of image processing and machine vision applications. In this paper we propose a new as well as a fast and reliable template matching algorithm which is invariant to Rotation, Scale, Translation and Brightness (RSTB) changes. For this purpose, we adopt the idea of ring projection transform (RPT) of image. In the proposed algorithm, two novel s...

In this study, we discuss the capacitated facility location-allocation problem with uncertain parameters in which the uncertainty is characterized by given finite numbers of scenarios. In this model, the objective function minimizes the total expected costs of transportation and opening facilities subject to the robustness constraint. To tackle the problem efficiently and effectively, an effici...