Planning in Multiagent Expedition with Collaborative Design Networks (2008)
Abstract. DEC-POMDPs provide formal models of many cooperative multiagent problems, but their complexity is NEXP-complete in general. We investigate a sub-class of DEC-POMDPs termed multiagent...
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...