Skip to main content

Vehicle Routing, Scheduling and Dispatching System Based on HIMS Model

  • Conference paper
  • First Online:
Advances in Soft Computing — AFSS 2002 (AFSS 2002)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 2275))

Included in the following conference series:

  • 1584 Accesses

Abstract

A concept of the VRSDP/SD problem and its formularization are proposed in order to bridge the gap between conventional methods and complex situations in the real world. A HIMS model is also proposed for the VRSDP/SD problem. Experiments with two cases (full or partial working), are performed. The experimental results and the evaluations by experts from practice show that the HIMS model provides a feasible, fast, and efficient tool for the real world problem.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

Reference

  1. M.O. Ball, T.L. Magnanti, C.L. Monma, and G.L. Nemhauser: Network Routing, vol.8, Elsevier Science, Amsterdam, 1995.

    Google Scholar 

  2. G. Laporte and I.H. Osman: Routing problems: A bibliographyAnn. Oper. Res., vol.61, pp.227–262,1995.

    Article  MATH  Google Scholar 

  3. A.V. Breedam: Improvements heuristics for the vehicle routing problem based on simulated annealing, Eur. J. Oper. Res., vol.86, pp.480–490,1995.

    Article  MATH  Google Scholar 

  4. A.S. Alfa, S.S. Heragu, and M. Chen: A 3-opt based simulated annealing algorithm for the vehicle routing problem, Comp. Ind. Eng., vol.21, p.635,1991.

    Article  Google Scholar 

  5. E. Taillard and R Badeau: A tabu search heuristic for the vehicle routing problem with soft time windows, Transportation Science, vol.31, pp. 170–186, May 1997.

    Google Scholar 

  6. C. Duhamel, J.Y. Potvin, and J.M. Rousseau: A tabu search heuristic for the vehicle routing problem with backhauls and time windows, Transp. Science, vol.31, pp.49–59,1997.

    Article  MATH  Google Scholar 

  7. F. Leclerc and J.Y. Potvin: Genetic algorithms for vehicle dispatching, Int. Trans. Opl. Res., vol.4, no.5/6, pp.391–400,1997.

    Article  MATH  Google Scholar 

  8. R. Cheng, and M. Gen: Vehicle routing problem with fuzzy due-time using genetic algorithms, Journal of Fuzzy Theory and Systems, vol.7, no.5, pp.1050–1061, Japan, 1995.

    Google Scholar 

  9. L.D. Bodin: Twenty years of routing and scheduling, Oper. Res., vol.38, pp.571–579, 1990.

    Google Scholar 

  10. P.K. Bagchi and B.N. Nag: Dynamic vehicle scheduling: An expert systems approach, hit. J. Physical Dist. & Log. Manag., vol.21, no.2, pp.10–18,1991.

    Google Scholar 

  11. G. Laporte: The traveling salesman problem: An overwiew of exact and approximate algorithms, Eur. J. Oper. Res., vol.59, pp.231–247,1992.

    Article  MATH  Google Scholar 

  12. L. Ingber: Simulated Annealing: Practice versus Theory, Mathl. Comput. Modelling, Vol.18, No.ll,pp.29–57,1993.

    Article  MATH  MathSciNet  Google Scholar 

  13. F. Glover, E. Taillard and D.D. Werra: A user’s guide to tabu search, Annals of Operations Research, Vol.41, pp.3–28,1993.

    Article  MATH  Google Scholar 

  14. K. Chen, Y. Takama, K. Hirota: A Calculation Model with Hierarchical Multiplex Structure for Vehicle Routing, Scheduling, and Dispatching Problem With Single Depot, Journal of Japan Society for Fuzzy Theory and System, vol.13, no.2, pp. 187–198,2001.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hirota, K., Dong, F., Chen, K., Takama, Y. (2002). Vehicle Routing, Scheduling and Dispatching System Based on HIMS Model. In: Pal, N.R., Sugeno, M. (eds) Advances in Soft Computing — AFSS 2002. AFSS 2002. Lecture Notes in Computer Science(), vol 2275. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45631-7_11

Download citation

  • DOI: https://doi.org/10.1007/3-540-45631-7_11

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43150-3

  • Online ISBN: 978-3-540-45631-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics