Skip to main content

MIDAS’s Routing and Scheduling Approach for the Australian Transport Industries

  • Conference paper
On The Move to Meaningful Internet Systems 2003: OTM 2003 Workshops (OTM 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2889))

  • 462 Accesses

Abstract

Effective and efficient route scheduling can mainly affect client/customer satisfaction and operating costs in the transport industry. Dynamic scheduling has simplified transport logistics such as courier services by providing technology-enhanced, real-time communication. Service requests from the same area should be served once rather than multiple times, facilitating a huge saving in travel distance and time. Mobile Intelligent Distributed Application Software (MIDAS) develops an autonomous routing and scheduling system for Australian transport industry. This system enables smoother running of transportation logistics with efficient and effective operation costs, by combining wireless and Internet technology. This system can receive orders and requests from mobile devices (Palm) and the Internet, and then schedule and forward the orders to the drivers automatically. Autonomous route scheduling includes static and dynamic scheduling to produce an optimal route on digital maps. Static scheduling is used to deal with non-emergency orders that can be scheduled overnight, to output a better solution with sufficient computation time. Dynamic scheduling can also be used to deal with emergency orders that require real-time scheduling within limited time constraints.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Larsen, J.: Vehicle Routing with Time Windows – Finding Optimal Solution Efficiently. DORSnyt (1999)

    Google Scholar 

  2. Solomon, M.: Algorithms for The Vehicle Routing and Scheduling Problems with Time Window Constrains. Operations Research 35(2) (1987)

    Google Scholar 

  3. Berger, J., Salois, M., Begin, R.: A Hybrid Genetic Algorithm for the Vehicle Routing Problem with Time Windows. In: Proc. of the 12th Biennial Conference of the Canadian Society for Computational Studies of Intelligence, pp. 114–127 (1998)

    Google Scholar 

  4. Savelsbergh, M.: Local Search in Routing Problem With Time Windows. Annual Operations Research 4, 285–305 (1985)

    Article  MathSciNet  Google Scholar 

  5. BBN Technologies, http://openmap.bbn.com

  6. Environment System Research Institute, Inc., http://www.esri.com

  7. Environment System Research Institute, Inc. ESRI Shapefile Technical Description, An ESRI White Paper (July 1998)

    Google Scholar 

  8. Hoch, F.: Assessing a wireless future. Trends Report 2001, October 1 (2001)

    Google Scholar 

  9. BlueSkyFrog wireless service provider, http://business.blueskyfrog.com

  10. Geoscience Australia, http://www.ga.gov.au

  11. Telstra Mobile SMS Access Manager. Technical Guide, http://www.telstra.com.au/mobilenet/pdf/sms_techguide.pdf

  12. Solomon, M., Desrosiers, J.: Time Windows Constrained Routing and Scheduling Problems. Transportation Science 22(1) (1988)

    Google Scholar 

  13. Castro, M., Adya, A., Liskov, B., Myers, A.C.: HAC: Hybrid Adaptive Caching for Distributed Storage Systems. In: Proc. of the 16th ACM Symposium on Operating Systems Principles, Saint-Malo (1997)

    Google Scholar 

  14. O’Neil, E.J., O’Neil, P.E., Weikum, G.: The LRU-K Page Replacement Algorithm for Database Disk Buffering. In: Proc. of the ACM SIGMOD International Conference on Management of Data, pp. 297–306 (1993)

    Google Scholar 

  15. Robinson, J., Devarakonda, N.: Data Cache Management using Frequency-based Replacement. In: Proc. of ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems, pp. 134–142 (1990)

    Google Scholar 

  16. Malhotra, M., Tari, T.: MIDAS – An Integrated E-Commerce Solution for Australian Transport Industries. International Journal on Web Engineering and Technology, IJWET (2003) (to appear)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Malhotra, M., Tari, Z. (2003). MIDAS’s Routing and Scheduling Approach for the Australian Transport Industries. In: Meersman, R., Tari, Z. (eds) On The Move to Meaningful Internet Systems 2003: OTM 2003 Workshops. OTM 2003. Lecture Notes in Computer Science, vol 2889. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39962-9_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-39962-9_21

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20494-7

  • Online ISBN: 978-3-540-39962-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics