Computational intelligence approach to real-world cooperative vehicle dispatching problem
- 26 March 2008
- journal article
- research article
- Published by Hindawi Limited in International Journal of Intelligent Systems
- Vol. 23 (5) , 619-634
Abstract
The vehicle dispatching problem for cooperative deliveries from multiple depots (VDP/CD/MD) is an important and difficult problem in the transport industries. To solve the VDP/CD/MD, A hierarchical multiplex structure (HIMS++) calculation model is proposed. The HIMS++ model takes advantage of object-oriented modeling, heuristic method, and fuzzy inference in (atomic, molecular, individual) three layers, so it can find a utility decision (vehicles plan) close to expert dispatcher. Furthermore, since the vital input parameters are few and the computational engine is packaged into a software component, the HIMS++ model is a convenient tool for the VDP/CD/MD. The HIMS++ model and its optimization algorithm are implemented as a software component using object-oriented paradigm, and through metaprogramming. The performance of the HIMS++ model is evaluated through experiments using 3-days oil delivery data taken from an actual dispatching center in Tokyo area. A total of 27 tank lorries are available for daily cooperative deliveries from three depots to about 30–60 destinations with different owners are used to save a running cost. The experimental results and the evaluations by human experts confirm that the HIMS++ model is better than the results of experienced dispatchers in six evaluation objectives, and can be applied to the planning support system for the VDP/CD/MD. The HIMS++ model will be able to cover similar transportation problems in the real world.Keywords
This publication has 9 references indexed in Scilit:
- Decision support for vehicle dispatching using genetic programmingIEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans, 1998
- Genetic Algorithms for Vehicle DispatchingInternational Transactions in Operational Research, 1997
- A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time WindowsTransportation Science, 1997
- The Vehicle Routing Problem with Time Windows Part I: Tabu SearchINFORMS Journal on Computing, 1996
- Routing problems: A bibliographyAnnals of Operations Research, 1995
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problemAnnals of Operations Research, 1993
- Simulated annealing: Practice versus theoryMathematical and Computer Modelling, 1993
- A user's guide to tabu searchAnnals of Operations Research, 1993
- A 3-OPT based simulated annealing algorithm for vehicle routing problemsComputers & Industrial Engineering, 1991