A variety of hybrid genetic algorithms has been recently proposed to address the vehicle routing problem with time windows (VRPTW), a problem known to be NP-hard. However, very few...
Abstract: This paper concentrates on a new framework for a post-market reassignment of requests in a Collaborative Carrier Network (CCN). While the framework was applied to a picku...
Abstract. We consider the train delivery problem which is a generalization of the bin packing problem and is equivalent to a one dimensional version of the vehicle routing problem ...
Abstract. In this paper the author presents three approaches to parallel Tabu Search, applied to several instances of the Capacitated Vehicle Routing Problem with soft Time Windows...
In an unpublished paper, Araque, Hall and Magnanti considered polyhedra associated with the Capacitated Vehicle Routing Problem (CVRP) in the special case of unit demands. Among th...
Adam N. Letchford, Richard W. Eglese, Jens Lysgaar...