420
Views
6
CrossRef citations to date
0
Altmetric
Original Articles

A heuristic algorithm for optimal fleet composition with vehicle routing considerations

, &
Pages 272-289 | Received 30 Aug 2014, Accepted 09 Jun 2015, Published online: 10 Jul 2015

References

  • F. Alonso, M.J. Alvarez, and J.E. Beasley, A tabu search algorithm for the periodic vehicle routing problem with multiple vehicle trips and accessibility restrictions, J. Oper. Res. Soc. 59 (2008), pp. 963–976. doi: 10.1057/palgrave.jors.2602405
  • R. Baldacci, M. Battarra, and D. Vigo, Routing a heterogeneous fleet of vehicles, in The Vehicle Routing Problem: Latest Advances and New Challenges, B. Golden, S. Raghavan, and E. Wasil, eds., Springer, New York, 2008, pp. 3–27.
  • L. Bertazzi, G. Paletta, and M.G. Speranza, An improved heuristic for the period traveling salesman problem, Comput. Oper. Res. 31 (2004), pp. 1215–1222. doi: 10.1016/S0305-0548(03)00075-3
  • I.M. Chao, B.L. Golden, and E. Wasil, A new heuristic for the multi-depot vehicle routing problem that improves upon best-known solutions, Amer. J. Math. Management Sci. 13 (1993), pp. 371–406.
  • K. Chepuri and T. Homem-de-Mello, Solving the vehicle routing problem with stochastic demands using the cross-entropy method, Ann. Oper. Res. 134 (2005), pp. 153–181. doi: 10.1007/s10479-005-5729-7
  • A. Eshragh, J. Filar, and A. Nazar, A projection-adapted cross entropy (PACE) method for transmission network planning, Energy Syst. 2 (2011), pp. 189–208. doi: 10.1007/s12667-011-0033-x
  • P.M. Francis, K.R. Smilowitz, and M. Tzur, The period vehicle routing problem and its extensions, in The Vehicle Routing Problem: Latest Advances and New Challenges, B. Golden, S. Raghavan, and E. Wasil, eds., Springer, New York, 2008, pp. 73–102.
  • G. Ghiani, G. Laporte, and R. Musmanno, Introduction to Logistics Systems Planning and Control, John Wiley, Chichester, 2004.
  • A. Hoff, H. Andersson, M. Christiansen, G. Hasle, and A. Løkketangen, Industrial aspects and literature survey: Fleet composition and routing, Comput. Oper. Res. 37 (2010), pp. 2041–2061. doi: 10.1016/j.cor.2010.03.015
  • R. Loxton and Q. Lin, Optimal fleet composition via dynamic programming and golden section search, J. Ind. Manag. Optim. 7 (2011), pp. 875–890. doi: 10.3934/jimo.2011.7.875
  • R. Loxton, Q. Lin, and K.L. Teo, A stochastic fleet composition problem, Comput. Oper. Res. 39 (2012), pp. 3177–3184. doi: 10.1016/j.cor.2012.04.004
  • M. Mourgaya and F. Vanderbeck, Column generation based heuristic for tactical planning in multi-period vehicle routing, European J. Oper. Res. 183 (2007), pp. 1028–1041. doi: 10.1016/j.ejor.2006.02.030
  • R.Y. Rubinstein, Optimization of computer simulation models with rare events, Eur. J. Oper. Res. 99 (1997), pp. 89–112. doi: 10.1016/S0377-2217(96)00385-2
  • R.Y. Rubinstein, The cross-entropy method for combinatorial and continuous optimization, Methodol. Comput. Appl. Probab. 1 (1999), pp. 127–190. doi: 10.1023/A:1010091220143
  • R.Y. Rubinstein and D.P. Kroese, The Cross-entropy Method: A Unified Approach to Combinatorial Optimization, Monte-Carlo Simulation, and Machine Learning, Springer, New York, 2004.
  • S. Salhi and G.K. Rand, Incorporating vehicle routing into the vehicle fleet composition problem, Eur J. Oper. Res. 66 (1993), pp. 313–330. doi: 10.1016/0377-2217(93)90220-H
  • K. Sebaa, H. Guéguen, and M. Boudour, Mixed integer non-linear programming via the cross-entropy approach for power system stabilisers location and tuning, IET Gener. Transm. Distrib. 4 (2010), pp. 928–939. doi: 10.1049/iet-gtd.2009.0435

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.