We present a new evolutionary algorithm to solve the 0-1 multidimensional knapsack problem.We tackle the problem using duality concept, differently from traditional approaches. Ourmethod is based on Lagrangian relaxation. Lagrangemultipliers transform the problem, keeping the optimality as well as decreasing the complexity. However, it is not easy to find Lagrange multipliers nearest to the cap...

In this article, we study an Inventory Routing Problem with deterministic customer demand in a two-tier supply chain. The chain network consists of supplier using single vehicle given capacity to deliver product type multiple customers. We are interested population-based algorithms solve our problem. A Memetic Algorithm (MA) is developed based on the Genetic (GA) and Variable Neighborhood Searc...

August 29, 2013 Maintainer Christoph Bergmeir License GPL-3 | file LICENSE Title Continuous Optimization using Memetic Algorithms with Local Search Chains (MA-LS-Chains) in R LinkingTo Rcpp Type Package LazyLoad yes Author Christoph Bergmeir, Daniel Molina, José M. Benítez Description This package implements an algorithm family for continuous optimization called memet...

The rising popularity of evolutionary algorithms to solve complex problems has inspired researchers to explore their utility in recommender systems. Recommender systems are intelligent web applications which generate recommendations keeping in view the user’s stated and unstated requirements. Evolutionary approaches like Genetic and memetic algorithms have been considered as one of the most suc...