www.cs.cmu.edu

15-854: Approximation Algorithms

The area of approximation algorithms is aimed at giving provable guarantees on the performance of heuristics for hard problems. The course will present general techniques (such as convex ...
GitHub

Feroz455/Fundamentals-of-Computer-Algorithms-2nd-Edition-by-Ellis-Horowitz-Sartaj-Sahni-and-Sanguthevar

This repository contains comprehensive implementations of algorithms from the classic textbook "Fundamentals of Computer Algorithms" (Second Edition) by Ellis Horowitz, Sartaj Sahni, and Sanguthevar ...
University of Kent

Professor Maria Paola Scaparra

Professor of Management Science Associate Dean for Research and Innovation Maria Paola Scaparra is a Professor of Management Science and a member of the Centre for Logistics and Heuristic Optimisation ...
IEEE

Optimizing Genetic Algorithms for TSP: Evaluating Greedy Permuting Method with Diverse Selection and Crossover Techniques

Abstract: The Greedy Permuting Method (GPM) is a method introduced for initial population generation in the Genetic Algorithm (GA). For a test problem with 280 cities, the generated initial population ...
GitHub

Vehicle Routing Problem

Vehicle Routing Problem or simply VRP is a well known combinatorial optimization problem and a generalization of the travelling salesman problem. A definition of the problem is this: We have a number ...
IEEE

A Greedy-Genetic Local-Search Heuristic for the Traveling Salesman Problem

Abstract: The Travelling Salesman Problem (TSP) is one of the typical combinatorial optimization problems that is easy to describe but hard to solve. In this work, we present a novel solution that ...