Solving capacitated vehicle routing problems using edge histogram based sampling algorithms

Proceedings of the 2004 Congress on Evolutionary Computation, CEC2004

Volumn 1, Issue , 2004, Pages 1150-1157

  Tsutsui, Shigeyoshi ^a   Wilson, Gordon ^a  

^a HANNAN UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

CAPACITATED VEHICLE ROUTING PROBLEMS (CVRP); EDGE HISTOGRAM BASED SAMPLING ALGORITHMS (EHBSA); PROBABILISTIC MODELING; SYMMETRICAL SEQEUNCING PROBLEMS;

GENETIC ALGORITHMS; GROUND VEHICLES; HEURISTIC METHODS; MATHEMATICAL OPERATORS; MATRIX ALGEBRA; PARAMETER ESTIMATION; PROBABILISTIC LOGICS; SCHEDULING; TRAVELING SALESMAN PROBLEM; VECTORS;

PROBLEM SOLVING;

EID: 4344561082     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. Bosman, P. A. N., and Thierens, D.: Continuous iterated density estimation evolutionary algorithms within the IDEA framework, Workshop Proceedings of the Genetic and Evolutionary Computation Conference 2000 (GECCO-2000), pp. 197-200 (2000).
2. Bosman, P. A. N., and Thierens, D.: Crossing the Road to Efficient IDEAs for Permutation Problems, Proceedings of the Genetic and Evolutionary Computation Conference GECCO-2001, pp. 219-226 (2001).
3. Bosman, P. A. N., and Thierens, D.: Permutation Optimization by Iterated Estimation of Random Keys Marginal Product Factorizations. Proceedings of Parallel Problem Solving From Nature, pp. 331-340 (2002).
4. Goldberg, D. E.: Genetic algorithms in search, optimization and machine learning. Reading, MA: Addison-Wesley publishing company (1989).
5. Goldberg, D. E.; The design of innovation: Lessons from and for competent genetic algorithms, Volume 7 of Genetic and Evolutionary Computation, Kluwer (2002).
6. Larrañaga, P., and Lozano, J. A. (Eds.): Estimation of distribution algorithms, Boston, MA: Kluwer (2002).
7. Muehlenbein, H., and Paass, G.: From recombination of genes to the estimation of distributions I. Binary parameters, Proceedings of the 4th Parallel Problem Solving from Nature, pp. 178-187 (1996).
8. Machado, P., Tavares, J., Pereira, F. B., and Costa, E.: Vehicle Routing Problem: Doing It The Evolutionary Way, Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2002), pp. 690-697, Morgan Kaufmann Publishers, San Francisco (2002).
9. Oliver, I, Smith, D., and Holland, J.: A study of permutation crossover operators on the travel salesman problem, Proceeding of the 2nd International Conference on Genetic Algorithms, pp. 224-230 (1987).
10. Pelikan, M.: Bayesian optimization algorithm: From single level to hierarchy, Doctoral dissertation, University of Illinois at Urbana-Champaign, Urbana, IL. Also IlliGAL Report No. 2002023 (2002).
11. Pelikan, M., Goldberg, D. E., and Lobo, F.: A survey of optimization by building and using probabilistic models, Computational Optimization and Applications, 21(1), 5-20 (2002). Also IlliGAL Report No. 99018.
12. Robles, V., Miguel, P. D., and Larranaga, P.: Solving the traveling salesman problem with EDAs, Estimation of Distribution Algorithms, Larranaga, P. and Lozano, J. A. (eds), Kluwer Academic Publishers, Chapter 10, pp. 211-229 (2002).
13. Starkweather, T., McDaniel, S., Mathias, K, Whitley, D, and Whitley, C.: A comparison of genetic sequence operators, Proceedings of the 4th International Conference on Genetic Algorithms, Morgan Kaufmann, pp. 69-76 (1991).
14. Thierens, D.: Analysis and design of genetic algorithms, Doctoral dissertation, Katholieke Uni-versiteit Leuven, Leuven, Belgium (1995).
15. Tsutsui, S.: Probabilistic Model-Building Genetic Algorithms in Permutation Representation Domain Using Edge Histogram, Proceedings of the 7th Parallel Problem Solving from Nature - PPSN VII, pp. 224-233 (2002).
16. Tsutsui, S. and Miki, M.: Solving Flow Shop Scheduling Problems with Probabilistic Model-Building Genetic Algorithms using Edge Histograms, Proceedings of the 4th Asia-Pacific Conference on Simulated Evolution And Learning -SEAL02 (2002).
17. Tsutsui, S., Pelikan, M., and Goldberg, D. E: Using Edge Histogram Models to Solve Permutation Problems with Probabilistic Model-Building Genetic Algorithms, IlliGAL Report No. 2003022, University of Illinois at Urbana-Champaign (2003).
18. Tsutsui, S. and Miki, M.: Using Edge Histogram Models to Solve Flow Shop scheduling Problems with Probabilistic Model-Building Genetic Algorithms, Recent Advances in Simulated Evolution and Learning, Kay Chen Tan, Meng Hiot Lim, Xin Yao, and Lipo Wang Eds, Advances in Natural Computation Series, World Scientific (2004) (in press).
19. Ulder, N., Pesch, E., van Laarhoven, P., Bandelt, and Aarts, E.: Improving TSP ex-change heuristics by population genetics, Proceeding of the Parallel Problem Solving from Nature - PPSN (1990).
20. Whitley, D., Starkweather, T., and Fuquay, D.: Scheduling problems and traveling salesman problem: The genetic edge recombination operator, Proceedings of the 3rd International Conference on Genetic Algorithms, Morgan Kaufmann (1989).