Combinatorial expanding neighborhood topology particle swarm optimization for the vehicle routing problem with stochastic demands

GECCO 2013 - Proceedings of the 2013 Genetic and Evolutionary Computation Conference

Volumn , Issue , 2013, Pages 49-56

  Marinakis, Yannis ^a   Marinaki, Magdalene ^a  

^a TECHNICAL UNIVERSITY OF CRETE   (Greece)

Author keywords

Combinatorial neighborhood topology; Expanding neighborhood topology; Particle swarm optimization; Vehicle routing problem with stochastic demands

Indexed keywords

COMPLEX PROBLEMS; GLOBAL NEIGHBORHOOD STRUCTURES; LOCAL NEIGHBORHOOD STRUCTURES; NEIGHBORHOOD TOPOLOGY; PATH RELINKING; SPEED UP; STOCHASTIC DEMAND; VEHICLE ROUTING PROBLEMS;

ALGORITHMS; BENCHMARKING; ITERATIVE METHODS; NETWORK ROUTING; PARTICLE SWARM OPTIMIZATION (PSO); ROUTING ALGORITHMS; TOPOLOGY;

COMBINATORIAL MATHEMATICS;

EID: 84883104978     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2463372.2463375     Document Type: Conference Paper

References (23)

1. Bianchi, L., Birattari, M., Manfrin, M., Mastrolilli, M., Paquete, L., Rossi-Doria, O., Schiavinotto, T. (2006). Hybrid Metaheuristics for the Vehicle Routing Problem with Stochastic Demands. Journal of Mathematical Modelling and Algorithms, 5(1), 91-110.
2. Bianchi, L., Dorigo, M., Gambardella, L.M., Gutjahr, W.J. (2009). A survey on metaheuristics for stochastic combinatorial optimization. Natural Computing, 8(2), 239-287.
3. Christiansen, C.H., Lysgaard, J. (2007). A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands. Operations Research Letters, 35, 773-781.
4. Clerc, M., and J. Kennedy (2002). The particle swarm: explosion, stability and convergence in a multi-dimensional complex space. IEEE Transactions on Evolutionary Computation, 6, 58-73.
5. Dror, M., Laporte, G., Louveaux, F.V. (1993). Vehicle Routing with Stochastic Demands and Restricted Failures, ZOR - Methods and Models of Operations Research, 37, 273-283.
6. Engelbrecht, A. P. (2007). Computational Intelligence: An Introduction, Second Edition, John Wiley and Sons, England.
7. Gendreau, M., Laport, G., Seguin, R. (1996). Stochastic vehicle routing. European Journal of Operational Research, 88, 3-12.
8. Glover, F., M. Laguna, M., and R. Marti (2003). Scatter search and path relinking: Advances and applications. Handbook of Metaheuristics, Glover, F., Kochenberger, G.A. (Eds.), Kluwer Academic Publishers, Boston, 1-36.
9. Goodson, J.C., Ohlmann, J.W., Thomas, B.W. (2012). Cyclic-order neighborhoods with application to the vehicle routing problem with stochastic demand, European Journal of Operational Research, 217, 312-323.
10. Kennedy, J., and R. Eberhart (1995). Particle swarm optimization. Proceedings of 1995 IEEE International Conference on Neural Networks, 4, 1942-1948.
11. Lin, S. (1965). Computer solutions of the Traveling Salesman Problem. Bell Systems Technical Journal, 44, 2245-2269.
12. Marinakis, Y. and M. Marinaki (2008). A Particle Swarm Optimization Algorithm with Path Relinking for the Location Routing Problem, Journal of Mathematical Modelling and Algorithms, 7(1), 59-78.
13. Marinakis, Y. and M. Marinaki (2010). A Hybrid Multi-Swarm Particle Swarm Optimization Algorithm for the Probabilistic Traveling Salesman Problem, Computers and Operations Research, 37, 432-442.
14. Marinakis, Y. and M. Marinaki (2010). A Hybrid Genetic - Particle Swarm Optimization Algorithm for the Vehicle Routing Problem, Expert Systems with Applications, 37, 1446-1455.
15. Marinakis, Y., Marinaki, M., and G. Dounias (2010). A Hybrid Particle Swarm Optimization Algorithm for the Vehicle Routing Problem, Engineering Applications of Artificial Intelligence, 23, 463-472.
16. Marinakis, Y., Iordanidou, G.R., Marinaki, M. (2013). Particle Swarm Optimization for the Vehicle Routing Problem with Stochastic Demands, Applied Soft Computing, 13, 1693-1704.
17. Marinakis, Y. and M. Marinaki (2013). Combinatorial Neighborhood Topology Particle Swarm Optimization Algorithm for the Vehicle Routing Problem, M. Middendorf and C. Blum (Eds.): EvoCOP 2013, LNCS 7832, pp. 133-144.
18. Marinakis, Y. and M. Marinaki, (2013). Particle Swarm Optimization with Expanding Neighborhood Topology for the Permutation Flowshop Scheduling Problem, Soft Computing, (accepted), DOI: 10.1007/s00500-013-0992-z
19. Rosendo, M., and A. Pozo (2010). A hybrid Particle Swarm Optimization algorithm for combinatorial optimization problems, 2010 IEEE Congress on Evolutionary Computation (CEC), DOI: 10.1109/CEC.2010.5586178.
20. Stewart, W. R, Golden, B. L. (1983). Stochastic Vehicle Routing: A Comprehensive Approach European Journal of Operational Research, 14, 371-385.
21. Tillman, F., (1969). The multiple terminal delivery problem with probabilistic demands. Transportation Science, 3, 192-204.
22. Yang, W. H., Mathur, K., Ballou, R. H. (2000). Stochastic vehicle routing problem with restocking, Transportation Science, 34, 99-112.
23. http://www.coin-or.org/SYMPHONY/branchandcut/VRP/data/Vrp-All.tgz