Heuristics are here to help your online vehicle scheduling
Tóm tắt
An application of real-time changes in scheduling deliveries of road-making materials is conducted based on an implementation of a tabu search heuristic. This distribution problem deals with heterogeneous products and vehicles where the assignment of pickup points to requests needs also to be made. The problem is investigated as a full-load pickup and delivery problem with time windows. Online as well as offline experiments based on real data from a construction company in the United Kingdom are reported and discussed. Various practical issues that arise in this real-time logistical problem are also discussed and analysed. Interesting and encouraging results are reported.
Tài liệu tham khảo
Currie, R. (2003) Distribution management: An investigation into a full-load multi-terminal vehicle scheduling problem with backhauling and time windows. PhD thesis, School of Mathematics and Statistics, University of Birmingham, UK.
Currie, R. and Salhi, S. (2003) Exact and heuristic methods for a full-load, multi-terminal, vehicle scheduling problem with backhauling and time windows. Journal of the Operational Research Society 54: 390–400.
Currie, R. and Salhi, S. (2004) A tabu search heuristic for a full-load, multi-terminal, vehicle scheduling problem with backhauling and time windows. Journal of Modelling and Mathematical Algorithms 3: 225–243.
Gendreau, M. and Potvin, J.Y. (2004) Issues in real-time fleet management. Transportation Science 38: 397–398.
Ichoua, S., Gendreau, M. and Potvin, J.Y. (2000) Diversion issues in real-time vehicle dispatching. Transportation Science 34: 426–438.
Ichoua, S., Gendreau, M. and Potvin, J.Y. (2003) Vehicle dispatching with time-dependent travel times. European Journal of Operational Research 144: 379–396.
Lee, T. (2004) Real time optimisation for road stone production. MPhil dissertation, School of Mathematics and Statistics, University of Birmingham, UK.
Salhi, S. (1998) Heuristic Search Methods. In: G. Marcoulides (ed.) Modern Methods for Business Research, Chapter 6. New Jersey: Lawrence Erlbaum Associates, pp. 147–175.
Salhi, S. (2002) Defining tabu list size and aspiration criterion within tabu search methods. Computers and Operations Research 29: 67–86.
Salhi, S. (2006) Heuristic Search in Action: The Science of Tomorrow. In: S. Salhi (ed.) OR40 Keynote Papers. London: GORS, pp. 39–58.
Salhi, S. and Currie, R. (2008) An Application of Real Time Vehicle Scheduling: A Case Study. UK: University of Kent, Kent Business School Paper.
Taillard, E., Badeau, P., Gendreau, M., Guertin, F. and Potvin, J.Y. (1997) A tabu search heuristic for the vehicle routing problem with soft time windows. Transportation Science 31: 170–186.