72
Views
4
CrossRef citations to date
0
Altmetric
Articles

A Prufer-based genetic algorithm for allocation of the vehicles in a discounted transportation cost system

&
Pages 1-15 | Received 11 May 2015, Accepted 15 Aug 2016, Published online: 16 Sep 2016

References

  • Altassan, K.M., El-Sherbiny, M.M., & Abid, D. (2012). Solving fixed charge transportation problems using artificial immune system. Proceedings of 1st International Conference on Decision Modeling, 15–18 March 2012, Kedah.
  • Altiparmak, F., Gen, M., & Lin, L.I. (2009). A steady-state genetic algorithm for multi-product supply chain network design. Computers & Industrial Engineering, 56, 521–537.
  • Gen, M., & Cheng, R. (2000). Genetic algorithms and engineering optimization (pp. 61–69). New York, NY: John Wiley and Sons.
  • Gupta, T., & Kumar, A. (2012). Genetic algorithm for dynamic capacitated minimum spanning tree. International Journal of Computational Engineering & Management, 15(2012), 28–35.
  • Hajiaghaei-Keshteli, M., Molla-Alizadeh-Zavardehi, S., & Tavakkoli-Moghaddam, R. (2010). Addressing a nonlinear fixed-charge transportation problem using a spanning tree-based genetic algorithm. Computers & Industrial Engineering, 5, 259–271.
  • Hang, X.U., Rong, X.U., & Qingtai, Y.E. (2006), Optimization of unbalanced multi-stage logistic systems based on Prufer number and effective capacity coding. Tsinghua Science and Technology, 11, 96–101.
  • Jo, J.B., Kim, B.K., & Kim, J.R. (2008). Evolutionary algorithm-based methods to choose fixed charge transportation plan. International Journal of Information Systems for Logistics and Management, 3, 95–106.
  • Jo, J., Li, Y., & Gen, M. (2007). Nonlinear fixed charge transportation problem by spanning tree-based genetic algorithm. Computers & Industrial Engineering, 53, 290–298.
  • Kannan, G., Sasi Kumar, P., & Vinay, V.P. (2008). Comments on ‘‘Nonlinear fixed charge transportation problem by spanning tree-based genetic algorithm’’ by Jung-Bok Joet al. in Computers & Industrial engineering (2007). Computers & Industrial Engineering, 55, 533–534.
  • Klansek, U., & Psunder, M. (2010). Solving the nonlinear transportation problem by global optimization. Transport, 25, 314–324.
  • Lotfi, M.M., & Tavakkoli-Moghaddam, R. (2013). A genetic algorithm using priority-based encoding with new operators for fixed charge transportation problems. Applied Soft Computing, 13, 2711–2726.
  • Manimaran, P., Selladurai, V., & Ranganathan, A. (2011). A simple heuristics for optimization of unbalanced multistage supply chain logistics associated with fixed charges. International Journal of Procurement Management, 4, 203–222.
  • Mehdizadeh, E., Afrabandpei, F., & Afshar Najafi, B. (2013). Design of a multi-stage transportation network in a supply chain system: Formulation and efficient solution procedure. Scientia Iranica, Transaction E; Industrial Engineering, 20, 2188–2200.
  • Michel, S., & Vanderbeck, F. (2012). A column-generation based tactical planning method for inventory routing. Operations Research, 60, 382–397.
  • Molla-Alizadeh-Zavardehi, S., Hajiaghaei-Keshteli, M., & Tavakkoli-Moghaddam, R. (2011). Solving a capacitated fixed-charge transportation problem by artificial immune and genetic algorithms with a Prufer number representation. Expert Systems with Applications, 38, 10462–10474.
  • Othman, Z., Rostamian-Delavar, M.R., Behnam, S., & Lessanibahri, S. (2011). Adaptive genetic algorithm for fixed-charge transportation problem. Proceedings of the International Muti-Conference of Engineering and Computer Scientists 1, March 16–18, Hong Kong, 96–101.
  • Pandey, H.M., Chaudhary, A, & Mehoretra, D. (2014). A comparative review of approaches to prevent premature convergence in GA. Applied Soft Computing, 24, 1047–1077.
  • Rahimi-Vahed, A., Crainic, T.G., Gendreau, M., & Rei, W. (2015). Fleet-sizing for multi-depot and periodic vehicle routing problems using a modular heuristic algorithm. Computers & Operations Research, 53, 9–23.
  • Reiz, B., Csato, L., & Dumitrescu, D. (2008). Prufer number encoding for genetic Bayesian network structure learning algorithm. SYNASC '08. Proceedings of the 10th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 239–242.
  • Roghanian, E., & Pazhoheshfar, P. (2014). An optimization model for reverse logistics network under stochastic environment by using genetic algorithm. Journal of Manufacturing Systems, 33, 348–356.
  • Sarkar, A., & Mohapatra, P.K.J. (2008). Maximum utilization of vehicle capacity: A case of MRO items. Computers & Industrial Engineering, 54, 185–201.
  • Schindl, D., & Zufferey, N. (2015). Learning tabu search for a truck allocation problem with linear and nonlinear cost components. Naval Research Logistics, 62, 32–45.
  • Tari, F.G., & Hashemi, Z. (2016). A priority based genetic algorithm for nonlinear transportation costs problems. Computers & Industrial Engineering, 96, 86–95.
  • Tsujimura, Y., Gen, M., & Syarif, A. (2002). Solving a nonlinear side constrained transportation problem by using spanning tree-based genetic algorithm. Proceedings of the 2002 Congress on Evolutionary Computation, 12-17, 551–546.
  • Vinay, V., Panicker, R.V., & Sridharan, R. (2013). Ant colony optimization algorithm for distribution-allocation problem in a two-stage supply chain with a fixed transportation charge. International Journal of Production Research, 51, 698–717.
  • Wu, Y. (2014). A mixed-integer programming model for global logistics transportation problems. International Journal of Systems Science, 39(3), 217–228.
  • Ying, W., & Sang, S.D. (2005). Multi-agent framework for third party logistics in e-commerce. Expert Systems with Applications, 29, 431–436.

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.