Author:
Dechampai Darat,Tanwanichkul Ladda,Sethanan Kanchana,Pitakaso Rapeepan
Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Industrial and Manufacturing Engineering,Software
Reference39 articles.
1. 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.
2. Anily, S., & Bramel, J. (1999). Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries. Naval Research Logistics, 46, 654–670.
3. Anily, S., & Hassin, R. (1992a). The swapping problem. Networks, 22(4), 419–433.
4. 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.
5. 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.
Cited by
50 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献