Limited by the capacity of its own fleet of vehicles, a logistics distribution center cannot handle all the transportation job orders and have to outsource some to other local transportation companies. By analyzing different kinds of job orders received from the customers, an agent-based model is presented to describe the problem and a general model of vehicle capacity planning system (VCPS) is built to tackle the problem, which models the problem as a modified and more complicated vehicle routing problem with time window constraints (VRPTW). In the study case, a taboo search (TS) method is applied to find a solution for the problem. From the results, some new rules on how to assign jobs for outsourcing are derived, and it shows the new rules is better than the traditional existing rules currently adopted by the practitioners.
Agent Architecture and Design Framework for VRPTW in Distribution Center
Sixth International Conference of Traffic and Transportation Studies Congress (ICTTS) ; 2008 ; Nanning, China
2008-07-17
Conference paper
Electronic Resource
English
Low cost parallel solutions for the VRPTW optimization problem
Tema Archive | 2001
|Flower Pollination Algorithm for Vehicle Routing Problem with Time Windows (VRPTW)
BASE | 2021
|An Analysis of Exact VRPTW Solutions on ITS Data-based Logistics Instances
Springer Verlag | 2011
|