Skip to main content
SpringerLink
Log in

A differential evolution algorithm for the capacitated VRP with flexibility of mixing pickup and delivery services and the maximum duration of a route in poultry industry

  • Published:
Journal of Intelligent Manufacturing Aims and scope Submit manuscript

Abstract

In this paper, we propose two heuristics to solve the General Q-Delivery Vehicle Routing Problem with consideration of flexibility of mixing pickup, delivery services and a maximum duration of a route constraint which is the extending version of the well-known VRP with pickup and delivery problem. Firstly, the heuristic called DE_G-Q-DVRP-FD is presented to determine the routing of transferring pullets from pullet houses to hen houses. Since the problem considered is very complicated, the DE_G-Q-DVRP-FD is extended to the two-phase heuristic called MESOMDE_G-Q-DVRP-FD. The difference between two heuristics is that in the MESOMDE_G-Q-DVRP-FD algorithm, the customer vertices (pullet houses) will be clustered before determining routes. The clustering of customer vertices method called the Multifactor Based Evolving Self-Organizing Map is proposed in the first phase in order to completely utilize the vehicle. Finally, in the second phase, the DE_G-Q-DVRP-FD is used to execute the routing. To demonstrate the algorithm efficiency, flock allocation from pullet houses to hen houses in the egg industry is used as the case study. The results obtained from this study show that the MESOMDE_G-Q-DVRP-FD algorithm provides lower total cost values than that of the firm’s current practice by 7.59–31.28 and 0.84–13.15 % better than the DE_G-Q-DVRP-FD algorithm. Additionally, the MESOMDE_G-Q-DVRP-FD is adjusted to solve the benchmark problem found in the literature. The experimental results show that the MESOMDE_G-Q-DVRP-FD algorithm yields better total cost values by 5.72–61.60 % (with an average of 31.46 %).

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10

Similar content being viewed by others

References

  • Ai, T. J., & Kachitvichyanukul, V. (2009). A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery. Computers & Operations Research, 36(5), 1693–1702.

  • Anily, S., & Bramel, J. (1999). Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries. Naval Research Logistics, 46, 654–670.

    Article  Google Scholar 

  • Anily, S., & Hassin, R. (1992a). The swapping problem. Networks, 22(4), 419–433.

  • Archetti, C., Speranza, M. G., & Hertz, A. (2006). A tabu search algorithm for the split delivery vehicle routing problem. Transportation Science, 40(1), 64–73.

    Article  Google Scholar 

  • Arnonkijpanich, B., Chaikanha, N., Pathumnakul, S., & Lursinsap, C. (2004). Proportional self-organizing map (PSOM) based on flexible capacity buffer for allocating sugar cane loading stations. In Proceedings of the IEEE international conference on systems, manufacturing and cybernetics, pp. 6206–6211.

  • Arnonkijpanich, B., Hasenfuss, A., & Hammer, B. (2011a). Local matrix adaptation in topographic neural maps. Neurocomputing, 74(4), 522–539.

    Article  Google Scholar 

  • Belmecheri, F., Prins, C., Yalaoui, F., & Amodeo, L. (2013). Particle swarm optimization algorithm for a vehicle routing problem with heterogeneous fleet, mixed backhauls, and time windows. Journal of Intelligent Manufacturing, 24(4), 775–789.

    Article  Google Scholar 

  • Berbeglia, G., Cordeau, J. F., Gribkovskaia, I., & Laporte, G. (2007). Static pickup and delivery problems: A classification scheme and survey. Top, 15(1), 1–31.

    Article  Google Scholar 

  • Boonmee, A., Sethanan, K., & Arnonkijpanich, B. (2013). Growing neural gas approach for minimizing the total cost of hen allocation to poultry farms in Thailand. In Proceedings of the Asia Pacific industrial engineering and management system.

  • Boonmee, A., Sethanan, K., Arnonkijpanich, B., & Theerakulpisut, S. (2015). Minimizing the total cost of hen allocation to poultry farms using hybrid growing neural gas approach. Computers and Electronics in Agriculture, 110, 27–35.

    Article  Google Scholar 

  • Chakaravarthy, G. V., Marimuthu, S., & Sait, A. N. (2013). Performance evaluation of proposed differential evolution and particle swarm pptimization algorithms for scheduling m-machine flow shops with lot streaming. Journal of Intelligent Manufacturing, 24, 175–191.

    Article  Google Scholar 

  • Chen, Q., Li, K., & Liu, Z. (2014). Model and algorithm for an unpaired pickup and delivery vehicle routing problem with split loads. Transportation Research Part E, 69, 218–235.

    Article  Google Scholar 

  • Cordeau, J. F., & Laporte, G. (2003). The dial-a-ride problem (DARP): Variants modeling issues and algorithms. Journal of the Belgian, French and Italian Operations Research Societies, 1, 89–101.

    Google Scholar 

  • Dechampai, D., Sethanan, K., Tanwanichkul, L., & Arnonkijpanich, B. (2013). Transportation management systems of pullet farm using multifactor based evolving self-organizing maps (MESOM). In Proceedings of the Asia Pacific industrial engineering and management system.

  • Deng, D., & Kasabov, N. (2000). ESOM: An algorithm to evolve self-organizing maps from on-line data streams. IEEE International Joint Conference on Neural Networks, 2000, 3–8.

    Google Scholar 

  • Dong, G., Tang, J., Lai, K. K., & Kong, Y. (2011). An exact algorithm for vehicle routing and scheduling problem of free pickup and delivery service in flight ticket sales companies based on set-partitioning model. Journal of Intelligent Manufacturing, 22, 789–799.

    Article  Google Scholar 

  • Dror, M., & Trudeau, P. (1989). Savings by split delivery routing. Transportation Science, 23(2), 141–145.

    Article  Google Scholar 

  • Dror, M., Laporte, G., & Trudeaub, P. (1994). Vehicle routing with split deliveries. Discrete Applied Mathematics, 50(3), 239–254.

    Article  Google Scholar 

  • Erbao, C., & Mingyong, L. (2009). A hybrid differential evolution algorithm to vehicle routing problem with fuzzy demands. Journal of Computational and Applied Mathematics, 231, 302–310.

    Article  Google Scholar 

  • Erbao, C., Mingyong, L., & Kai, N. (2008). A differential evolution & genetic algorithm for vehicle routing problem with simultaneous delivery and pick-up and time windows. In Proceedings of the international federation of automatic control 17th world congress, pp. 6–11.

  • Fritzke, B. (1995). A growing neural gas network learns topologies. Advances in Neural Information Processing Systems, 7, 625– 632.

    Google Scholar 

  • Hernandez-Perez, H., & Salazar-Gonzalez, J. J. (2004). A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery. Discrete Applied Mathematics, 145, 126–139.

    Article  Google Scholar 

  • Hou, L., Zhou, H., & Zhao, J. (2010). A novel discrete differential evolution algorithm for stochastic VRPSPD. Journal of Computational Information Systems, 6(8), 2483–2491.

    Google Scholar 

  • Karen, I., Kaya, N., & Öztürk., F. (2013). Intelligent die design optimization using enhanced differential evolution and response surface methodology. Journal of Intelligent Manufacturing. doi:10.1007/s1084501307951.

  • Kim, B. I., & Son, S. J. (2012). A probability matrix based particle swarm optimization for the capacitated vehicle routing problem. Journal of Intelligent Manufacturing, 23(4), 1119–1126.

    Article  Google Scholar 

  • Kohonen, T. (1995). Self-organizing maps. New York: Springer.

    Book  Google Scholar 

  • Lai, M. Y., & Cao, E. B. (2010). An improved differential evolution algorithm for vehicle routing problem with simultaneous pickups and deliveries and time windows. Engineering Applications of Artificial Intelligence, 23(2), 188–195.

    Article  Google Scholar 

  • Landrieu, A., Mati, Y., & Binder, Z. (2001). A tabu search heuristic for the single vehicle pickup and delivery problem with time windows. Journal of Intelligent Manufacturing, 12, 497–508.

    Article  Google Scholar 

  • Ma, W., Wang, M., & Zhu, X. (2013). Hybrid particle swarm optimization and differential evolution algorithm for bi-level programming problem and its application to pricing and lot-sizing decisions. Journal of Intelligent Manufacturing,. doi:10.1007/s1084501308035.

    Google Scholar 

  • MacQueen, J. (1967). Some methods for classification and analysis of multivariate observations. In Proceedings of the 5th Berkeley symposium on mathematical statistics and probability, pp. 281–297.

  • Martinovic, G., Aleksi, I., & Baumgartner, A. (2008). Single-commodity vehicle routing problem with pickup and delivery service. Mathematical Problems in Engineering. doi:10.1155/2008697981.

  • Nagy, G., & Salhi, S. (2005). Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries. European Journal of Operational Research, 162(1), 126– 141.

    Article  Google Scholar 

  • Nearchou, A. C. (2006). Meta-heuristics from nature for the loop layout design problem. International Journal of Production Economics, 101(2), 312–328.

    Article  Google Scholar 

  • Şahin, M., Çavuşlar, G., Öncan, T., Şahin, G., & Aksu, D. T. (2013). An efficient heuristic for the multi-vehicle one-to-one pickup and delivery problem with split loads. Transportation Research Part C, 27, 169–188.

    Article  Google Scholar 

  • Storn, R., & Price, K. (1997). Differential evolution—A simple and efficient heuristic for global optimization over continuous spaces. Journal of Global Optimization, 11, 341–359.

    Article  Google Scholar 

  • Vahdani, B., Tavakkoli-Moghaddam, R., Zandieh, M., & Razmi, J. (2012). Vehicle routing scheduling using an enhanced hybrid optimization approach. Journal of Intelligent Manufacturing, 23(3), 759–774.

  • Vincent, L. W. H., Ponnambalam, S. G., & Kanagaraj, G. (2012). Differential evolution variants to schedule flexible assembly lines. Journal of Intelligent Manufacturing. doi:10.1007/s1084501207168.

  • Wang, C. H., & Lu, J. Z. (2010). An effective evolutionary algorithm for the practical capacitated vehicle routing problems. Journal of Intelligent Manufacturing, 21(4), 363–375.

  • Zachariadis, E. E., Tarantilis, C. D., & Kiranoudis, C. T. (2009). A hybrid metaheuristic algorithm for the vehicle routing problem with simultaneous delivery and pick-up service. Expert Systems with Applications, 36(2), 1070–1081.

Download references

Acknowledgments

This work was supported by the Higher Education Research Promotion and National Research University Project of Thailand, Office of the Higher Education Commission, through the Food and Functional Food Research Cluster of Khon Kaen University and in collaboration with the Research Unit on System Modeling for Industry, Khon Kaen University, Thailand.

Author information

Authors and Affiliations

  1. Research Unit on System Modeling for Industry, Department of Industrial Engineering, Faculty of Engineering, Khon Kaen University, Khon Kaen, 40002, Thailand

    Darat Dechampai & Kanchana Sethanan

  2. Department of Civil Engineering, Faculty of Engineering, Khon Kaen University, Khon Kaen, 40002, Thailand

    Ladda Tanwanichkul

  3. Metaheuristics for Logistic Optimization Laboratory, Department of Industrial Engineering, Ubon Ratchathani University, Ubon Ratchathani, Thailand

    Rapeepan Pitakaso

Authors
  1. Darat Dechampai
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ladda Tanwanichkul
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Kanchana Sethanan
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Rapeepan Pitakaso
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ladda Tanwanichkul.

Appendix

Appendix

figure a

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Dechampai, D., Tanwanichkul, L., Sethanan, K. et al. A differential evolution algorithm for the capacitated VRP with flexibility of mixing pickup and delivery services and the maximum duration of a route in poultry industry. J Intell Manuf 28, 1357–1376 (2017). https://doi.org/10.1007/s10845-015-1055-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10845-015-1055-3

Keywords

Search

Navigation