To build a cooperative logistics network covering multiple enterprises, a planning method that can build a long-distance transportation network is required. Many strict constraints...
In this paper, we provide an algorithm that systematically considers all small trees in the search space of genetic programming. These small trees are used to generate useful subr...
This paper describes the combination of a well-known tsp heuristic, genius, with a constraint programming model for routing problems. The result, genius-cp, is an e cient heuristic...
Gilles Pesant, Michel Gendreau, Jean-Marc Rousseau
Optimal Communication Spanning Tree (OCST) is a well-known NP-hard problem on the graph that seeks for the spanning tree with the lowest cost. The tree cost depends on the demand ...
Pham Trung Kien, Nguyen Duy Hiep, Huynh Thi Thanh ...
A Genetic Algorithm, embedded in a simulation-based method, is applied to the identification of Asynchronous Finite State Machines. Two different coding schemes and their associat...