Multi-objective genetic algorithms for vehicle routing problem with time windows (2006)
B. Ombuki, B. J. Ross, F. Hanshar, Beatrice Ombuki, Brian J. Ross, Franklin Hanshar
The Vehicle Routing Problem with Time windows (VRPTW) is an extension of the capacity constrained Vehicle Routing Problem (VRP). The VRPTW is NP-Complete and instances with 100 customers or more are...
Search Space Analysis of Recurrent Spiking and Continuous-time (2006)
Mario Ventresca, Beatrice Ombuki
www.cosc.brocku.ca Abstract—The problem of designing recurrent continuoustime and spiking neural networks is NP-Hard. A common practice is to utilize stochastic searches, such as evolutionary...