The purpose of this article is to review the literature on the topic of deterministic vehicle routing problem (VRP) and to give a review on the exact and approximate solution techniques. More specifically the approximate (meta-heuristic) solution techniques are classified into: tabu search, simulated annealing, genetic algorithm, evolutionary algorithm, hybrid algorithm, and Ant Colony Opti...

Introduction: The selection of suitable beam angles and weights in external-beam radiotherapy is at present generally based upon the experience of the planner. Therefore, automated selection of beam angles and weights in forward-planned radiotherapy will be beneficial. Material and Methods: In this work, an efficient method is presented within the MATLAB environment to investigate how to improv...

Augmented Downhill Simplex Method (ADSM) is introduced here, that is a heuristic combination of Downhill Simplex Method (DSM) with Random Search algorithm. In fact, DSM is an interpretable nonlinear local optimization method. However, it is a local exploitation algorithm; so, it can be trapped in a local minimum. In contrast, random search is a global exploration, but less efficient. Here, rand...

in this paper an exponentially fitted finite difference method is presented for solving singularly perturbed two-point boundary value problems with the boundary layer. a fitting factor is introduced and the model equation is discretized by a finite difference scheme on an uniform mesh. thomas algorithm is used to solve the tri-diagonal system. the stability of the algorithm is investigated. it ...

projects scheduling by the project portfolio selection, something that has its own complexity and its flexibility, can create different composition of the project portfolio. an integer programming model is formulated for the project portfolio selection and scheduling.two heuristic algorithms, genetic algorithm (ga) and simulated annealing (sa), are presented to solve the problem. results of cal...

Numerical solutions obtained by the Meshless Local Petrov-Galerkin (MLPG) method are presented for two dimensional steady-state heat conduction problems. The MLPG method is a truly meshless approach, and neither the nodal connectivity nor the background mesh is required for solving the initial-boundary-value problem. The penalty method is adopted to efficiently enforce the essential boundary co...