Skip to main content
SpringerLink
Log in

An experimental analysis of evolutionary heuristics for the biobjective traveling purchaser problem

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

Given a set of markets and a set of products to be purchased on those markets, the Biobjective Traveling Purchaser Problem (2TPP) consists in determining a route through a subset of markets to collect all products, minimizing the travel distance and the purchasing cost simultaneously. As its single objective version, the 2TPP is an NP-hard Combinatorial Optimization problem. Only one exact algorithm exists that can solve instances up to 100 markets and 200 products and one heuristic approach that can solve instances up to 500 markets and 200 products. Since the Transgenetic Algorithms (TAs) approach has shown to be very effective for the single objective version of the investigated problem, this paper examines the application of these algorithms to the 2TPP. TAs are evolutionary algorithms based on the endosymbiotic evolution and other interactions of the intracellular flow interactions. This paper has three main purposes: the first is the investigation of the viability of Multiobjective TAs to deal with the 2TPP, the second is to determine which characteristics are important for the hybridization between TAs and multiobjective evolutionary frameworks and the last is to compare the ability of multiobjective algorithms based only on Pareto dominance with those based on both decomposition and Pareto dominance to deal with the 2TPP. Two novel Transgenetic Multiobjective Algorithms are proposed. One is derived from the NSGA-II framework, named NSTA, and the other is derived from the MOEA/D framework, named MOTA/D. To analyze the performance of the proposed algorithms, they are compared with their classical counterparts. It is also the first time that NSGA-II and MOEA/D are applied to solve the 2TPP. The methods are validated in 365 uncapacitated instances of the TPPLib benchmark. The results demonstrate the superiority of MOTA/D and encourage further researches in the hybridization of Transgenetic Algorithms and Multiobjective Evolutionary Algorithms specially the ones based on decomposition.

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

Similar content being viewed by others

References

  • Almeida, C. P., Gonçalves, R. A., Goldbarg, M. C., Goldbarg, E. F. G., & Delgado, M. R. (2007). TA-PFP: a transgenetic algorithm to the protein folding problem. In International conference on intelligent systems design and applications, ISDA (pp. 163–168). New York: IEEE Computer Society.

    Google Scholar 

  • Almeida, C. P., Gonçalves, R. A., Delgado, M. R., Goldbarg, E. F., & Goldbarg, M. C. (2010). A transgenetic algorithm for the bi-objective traveling purchaser problem. In IEEE world congress on computational intelligence (pp. 719–726). Barcelona: IEEE Press.

    Google Scholar 

  • Arroyo, J., Vieira, P., & Vianna, D. (2008). A grasp algorithm for the multi-criteria minimum spanning tree problem. Annals of Operations Research, 159, 125–133. doi:10.1007/s10479-007-0263-4.

    Article  Google Scholar 

  • Bleuler, S., Laumanns, M., Thiele, L., & Zitzler, E. (2003). PISA—a platform and programming language independent interface for search algorithms. In C. M. Fonseca, P. J. Fleming, E. Zitzler, K. Deb, & L. Thiele (Eds.), Lecture notes in computer science. Evolutionary multi-criterion optimization (EMO 2003) (pp. 494–508). Berlin: Springer.

    Chapter  Google Scholar 

  • Bontoux, B., & Feillet, D. (2008). Ant colony optimization for the traveling purchaser problem. Computers & Operations Research, 35(2), 628–637.

    Article  Google Scholar 

  • Chinchuluun, A., & Pardalos, P. (2007). A survey of recent developments in multiobjective optimization. Annals of Operations Research, 154, 29–50.

    Article  Google Scholar 

  • Coello Coello, A. C. (2009). Evolutionary multi-objective optimization: Some current research trends and topics that remain to be explored. Frontiers of Computer Science in China, 3, 18–30.

    Article  Google Scholar 

  • Coello Coello, C. A., Lamont, G. B., & Van Veldhuizen, D. A. (2007). Evolutionary algorithms for solving multi-objective problems (2nd ed.). Berlin: Springer.

    Google Scholar 

  • Conover, W. J. (1999). Practical nonparametric statistics (3rd ed.). New York: Wiley.

    Google Scholar 

  • Deb, K. (2004). Multi-objective optimization using evolutionary algorithms. New York: Wiley.

    Google Scholar 

  • Deb, K., Pratap, A., Agarwal, S., & Meyarivan, T. (2002). A fast and elitist multiobjective genetic algorithm: Nsga-ii. IEEE Transactions on Evolutionary Computation, 6(2), 182–197.

    Article  Google Scholar 

  • Demsar, J. (2006). Statistical comparisons of classifiers over multiple data sets. Journal of Machine Learning Research, 7, 1–30.

    Google Scholar 

  • Derrac, J., García, S., Molina, D., & Herrera, F. (2011). A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm and Evolutionary Computation, 1(1), 3–18. doi:10.1016/j.swevo.2011.02.002. http://www.sciencedirect.com/science/article/B6PJK-526MSBD-1/2/d6c6b35c40adaab70703ce72e3496672.

    Article  Google Scholar 

  • Ehrgott, M. (2006). A discussion of scalarization techniques for multiple objective integer programming. Annals of Operations Research, 147, 343–360.

    Article  Google Scholar 

  • Eiben, A., & Smith, J. (2003). Introduction to evolutionary computing. Berlin: Springer.

    Google Scholar 

  • Friedman, M. (1937). The use of ranks to avoid the assumption of normality implicit in the analysis of variance. Journal of the American Statistical Association, 32, 675–701.

    Article  Google Scholar 

  • Friedman, M. (1940). A comparison of alternative tests significance for problem of m rankings. Annals of Mathematical Statistics, 11, 86–92.

    Article  Google Scholar 

  • García, S., & Herrera, F. (2008). An extension on “statistical comparisons of classifiers over multiple data sets” for all pairwise comparisons. Journal of Machine Learning Research, 9, 2677–2694.

    Google Scholar 

  • García, S., Fernández, A., Luengo, J., & Herrera, F. (2010). Advanced nonparametric tests for multiple comparisons in the design of experiments in computational intelligence and data mining: experimental analysis of power. Information Sciences, 180(10), 2044–2064. doi:10.1016/j.ins.2009.12.010. http://www.sciencedirect.com/science/article/B6V0C-4XY4GPN-5/2/2b56b24291277698f5249572f51746b0. Special Issue on Intelligent Distributed Information Systems.

    Article  Google Scholar 

  • Goldbarg, E. F. G., & Goldbarg, M. C. (2009). Foundations of computational intelligence: global optimization. In Studies in computational intelligence. Transgenetic algorithm: a new endosymbiotic approach for evolutionary algorithms (pp. 425–460). Berlin: Springer.

    Google Scholar 

  • Goldbarg, E. F. G., Goldbarg, M. C., & Schmidt, C. C. (2008). A hybrid transgenetic algorithm for the prize collecting steiner tree problem. Journal of Universal Computer Science, 14(15), 2491–2511.

    Google Scholar 

  • Goldbarg, M. C., Bagi, L. B., & Goldbarg, E. F. G. (2009). Transgenetic algorithm for the traveling purchaser problem. European Journal of Operational Research, 199(1), 36–45.

    Article  Google Scholar 

  • Hamacher, H., & Ruhe, G. (1994). On spanning tree problems with multiple objectives. Annals of Operations Research, 52, 209–230. doi:10.1007/BF02032304.

    Article  Google Scholar 

  • Hollander, M., & Wolfe, D. A. (1999). Nonparametric statistical methods. New York: Wiley.

    Google Scholar 

  • Junker, U. (2004). Preference-based search and multi-criteria optimization. Annals of Operations Research, 130, 75–115.

    Article  Google Scholar 

  • Knowles, J., Thiele, L., & Zitzler, E. (2006). A tutorial on the performance assessment of stochastic multiobjective optimizers (Tech. Rep. TIK 214). Computer Engineering and Networks Laboratory (TIK), Swiss Federal Institute of Technology (ETH), Switzerland.

  • Li, H., & Zhang, Q. (2009). Multiobjective optimization problems with complicated Pareto sets, moea/d and nsga-ii. IEEE Transactions on Evolutionary Computation, 13(2), 284–302. doi:10.1109/TEVC.2008.925798.

    Article  Google Scholar 

  • Lin, S., & Kernighan, B. W. (1973). An effective heuristic algorithm for the traveling salesman problem. Operations Research, 21, 498–516.

    Article  Google Scholar 

  • Mack, G. A., & Skillings, J. H. (1980). A Friedman-type rank test for main effects in a two-factor anova. Journal of the American Statistical Association, 75(372), 947–951.

    Article  Google Scholar 

  • Margulis, L. (1992). Symbiosis in cell evolution: microbial communities in the archean and proterozoic eon (2nd ed.). New York: Freeman.

    Google Scholar 

  • Molina, J., Santana, L. V., Hernandez-Daz, A. G., Coello Coello, C. A., & Caballero, R. (2009). g-dominance: reference point based dominance for multiobjective metaheuristics. European Journal of Operational Research, 197(2), 685–692. http://ideas.repec.org/a/eee/ejores/v197y2009i2p685-692.html.

    Article  Google Scholar 

  • Monteiro, S. M. D., Goldbarg, E. F. G., & Goldbarg, M. C. (2009). A plasmid based transgenetic algorithm for the biobjective minimum spanning tree problem. In European conference on evolutionary computation in combinatorial optimization (pp. 49–60). Berlin: Springer.

    Chapter  Google Scholar 

  • Monteiro, S. M. D., Goldbarg, E. F. G., & Goldbarg, M. C. (2010). A new transgenetic approach for the biobjective spanning tree problem. In IEEE congress on evolutionary computation (pp. 519–526). Berlin: Springer.

    Google Scholar 

  • Pearn, W. L., & Chien, R. C. (1998). Improved solutions for the traveling purchaser problem. Computers & Operations Research, 25, 879–885.

    Article  Google Scholar 

  • Peng, W., Zhang, Q., & Li, H. (2009). Comparison between MOEA/D and NSGA-II on the multiobjective travelling salesman problem. In Studies in computational intelligence. Multiobjective memetic algorithms (pp. 309–324). Berlin: Springer.

    Chapter  Google Scholar 

  • Ramesh, T. (1981). Traveling purchaser problem. Operations Research, 18, 78–91.

    Google Scholar 

  • Riera-Ledesma, J., & Salazar-González, J. J. (2005a). The biobjective travelling purchaser problem. European Journal of Operational Research, 160, 599–613.

    Article  Google Scholar 

  • Riera-Ledesma, J., & Salazar-González, J. J. (2005b). A heuristic approach for the traveling purchaser problem. European Journal of Operational Research, 162, 142–152.

    Article  Google Scholar 

  • Riera-Ledesma, J., & Salazar-González, J. J. (2006). Solving the asymmetric traveling purchaser problem. Annals of Operations Research, 144, 83–97.

    Article  Google Scholar 

  • Singh, K. N., & van Oudheusden, D. L. (1997). A branch and bound algorithm for the traveling purchaser problem. European Journal of Operational Research, 97, 571–579.

    Article  Google Scholar 

  • Voß, S. (1996). Dynamic tabu search strategies for the traveling purchaser problem. Annals of Operations Research, 63, 253–275.

    Article  Google Scholar 

  • Zhang, Q., & Li, H. (2007). Moea/d: a multi-objective evolutionary algorithm based on decomposition. IEEE Transactions on Evolutionary Computation, 11(6), 712–731.

    Article  Google Scholar 

  • Zhang, Q., Liu, W., Tsang, E., & Virginas, B. (2010). Expensive multiobjective optimization by moea/d with gaussian process model. IEEE Transactions on Evolutionary Computation, 14(3), 456–474.

    Article  Google Scholar 

  • Zitzler, E., Knowles, J., & Thiele, L. (2008). Quality assessment of Pareto set approximations (pp. 373–404). doi:10.1007/978-3-540-88908-3_14.

Download references

Author information

Authors and Affiliations

  1. Graduate Program of Electrical Engineering and Computer Science, Federal University of Technology of Paraná—UTFPR, Curitiba, PR, 80230-901, Brazil

    Carolina P. Almeida, Richard A. Gonçalves & Myriam R. Delgado

  2. Computer Science Department, Midwest State University of Paraná—UNICENTRO, Guarapuava, PR, Brazil

    Carolina P. Almeida & Richard A. Gonçalves

  3. Graduate Program on Systems and Computing, Universidade Federal do Rio Grande do Norte, Campus Universitário, Lagoa Nova, Natal, RN, 59072-970, Brazil

    Elizabeth F. Goldbarg & Marco C. Goldbarg

Authors
  1. Carolina P. Almeida
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Richard A. Gonçalves
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Elizabeth F. Goldbarg
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Marco C. Goldbarg
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Myriam R. Delgado
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Carolina P. Almeida.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Almeida, C.P., Gonçalves, R.A., Goldbarg, E.F. et al. An experimental analysis of evolutionary heuristics for the biobjective traveling purchaser problem. Ann Oper Res 199, 305–341 (2012). https://doi.org/10.1007/s10479-011-0994-0

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-011-0994-0

Keywords

Search

Navigation