Aiming to large-scale Multiple-Depot Food transport Vehicle Routing Problem (MDFVRP), this study proposed an improved genetic algorithm solution frame based on the two-stage fuzzy clustering. In the static upper stage, the k-means technology is used to divide the MDFVRP into several one-to-many sub-problems. From the perspective of improving the customer satisfaction and integrating logistics r...

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 pickup and delivery scenario in [BB07] we now use it for the vehicle routing of a carrier network offering LTL pickup services leading to a set of interdependent capacitated traveling salesman tours.

Many simulation models contain one or more transport systems where some type of vehicle, perhaps an AGV, a fork truck, a shuttle, or a human being, travel along predefined paths. Locations along the paths may specify where loads carried by the vehicle transfer to or from it, where some activity takes place requiring the vehicle’s presence, or where vehicle routing logic executes. This paper foc...

The vehicle routing problem with backhauls and time windows (VRPBTW) involves the pickup and delivery of goods at different customer locations, with earliest and latest time deadlines, and varying demands. The demands are serviced using capacitated vehicles with limited route time. Moreover, all deliveries (linehauls) must be done before the pick-ups (backhauls). The objective of the problem is...

In the stochastic and dynamic multi-stage vehicle routing problem, a set of vehicles collectively transports and services demands which require service at multiple spatially separated locations. Arrival times and service locations of individual demands are not known until the demand’s arrival, and vehicles are assumed to have infinite capacity and to travel with bounded velocity. The objective ...