We propose a meta-heuristic based on GRASP combined with Path Relinking to address the Two-Echelon Vehicle Routing Problem, an extension of the Capacitated Vehicle Routing Problem in which the delivery from a single depot to customers is achieved by routing and consolidating the freight through intermediate depots called satellites. The problem is treated by separating the depot-to-satellite tr...

This paper presents cuckoo search algorithm (CSA) for solving non-convex economic load dispatch (ELD) problems of fossil fuel fired generators considering transmission losses and valve point loading effect. CSA is a new meta-heuristic optimisation technique inspired from the obligate brood parasitism of some cuckoo species by laying their eggs in the nests of other host birds of other species. ...

In this paper, a new codification is proposed for variousmeta-heuristic techniques to solve the reconfiguration problem of distribution networks. The full potential of meta-heuristic algorithms can be exploited by their efficient codification using some engineering knowledge base. The distribution system reconfiguration problems are non-differentiable, mixed integer and highly complex combinato...

Sequential parameter optimization is a heuristic that combines classical and modern statistical techniques to improve the performance of search algorithms. It includes methods for tuning based on classical regression and analysis of variance techniques; tree-based models such as CART and random forest; Gaussian process models (Kriging), and combinations of different meta-modeling approaches. Th...

Timetable generation is a combinatorial optimization problem. Meta Heuristic methods and Evolutionary Algorithms have given the best results when it comes to solving the problem of timetable generation. In our paper the problem of timetable generation for the Computer Science and Engineering Dept. of BMS College of Engineering is solved with the help of Genetic Algorithm and Tabu Search which b...

Among most machine learning algorithms for optimization problem including meta-heuristic search algorithms, the solution is drawn like a moth to a flame and cannot keep away. The track of chaotic variable can travel ergodically over the whole search space. In general, the chaotic variable has special characters, i.e., ergodicity, pseudo-randomness and irregularity. To enrich the searching behav...

gravitational search algorithm (gsa) is one of the newest swarm based optimization algorithms, which has been inspired by the newtonian laws of gravity and motion. gsa has empirically shown to be an efficient and robust stochastic search algorithm. since introducing gsa a convergence analysis of this algorithm has not yet been developed. this paper introduces the first attempt to a formal conve...

ARTICLE 1. Introduction Computational Grids (CGs) are a natural extension of classical distributed systems. CGs are expected to leverage unprecedented larger computing capacities by virtually joining together geographically distributed resources at large scale. To achieve this objective, the design of ecient Grid schedulers that map and allocate tasks and applications onto Grid resources is a k...