Results 91 to 100 of about 2,294,625 (144)

Solving Asymmetric Travelling Salesman Problem using Memetic Algorithm

open access: yes, 2014
— Memetic Algorithms have been proven to be successful to find the nearest optimum solution to hard combinatorial optimization problems. In this paper, Memetic algorithm is designed for Asymmetric Traveling salesman problem (ATSP). Memetic Algorithm is a
Prof Mahesh Panchal, Misba Shaikh
core  

An Intensification-Enhanced Adaptive Hybrid Memetic Algorithm for the Multi-Depot Vehicle Routing Problem with Time Windows

open access: yesApplications of Modelling and Simulation
The Multi-Depot Vehicle Routing Problem with Time Windows (MDVRPTW) is categorized as NP-hard in terms of logistics planning, given the various constraints and some inherent combinatorial nature of the problem.
Farid Morsidi
doaj  

Home - About - Disclaimer - Privacy