IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v199y2009i1p36-45.html
   My bibliography  Save this article

Transgenetic algorithm for the Traveling Purchaser Problem

Author

Listed:
  • Goldbarg, M.C.
  • Bagi, L.B.
  • Goldbarg, E.F.G.

Abstract

In this paper an evolutionary algorithm is presented for the Traveling Purchaser Problem, an important variation of the Traveling Salesman Problem. The evolutionary approach proposed in this paper is called transgenetic algorithm. It is inspired on two significant evolutionary driving forces: horizontal gene transfer and endosymbiosis. The performance of the algorithm proposed for the investigated problem is compared with other recent works presented in the literature. Computational experiments show that the proposed approach is very effective for the investigated problem with 17 and 9 new best solutions reported for capacitated and uncapacitated instances, respectively.

Suggested Citation

  • Goldbarg, M.C. & Bagi, L.B. & Goldbarg, E.F.G., 2009. "Transgenetic algorithm for the Traveling Purchaser Problem," European Journal of Operational Research, Elsevier, vol. 199(1), pages 36-45, November.
    • Handle: RePEc:eee:ejores:v:199:y:2009:i:1:p:36-45
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(08)00966-1
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Singh, Kashi N. & van Oudheusden, Dirk L., 1997. "A branch and bound algorithm for the traveling purchaser problem," European Journal of Operational Research, Elsevier, vol. 97(3), pages 571-579, March.
    2. Golden, Bruce & Levy, Larry & Dahl, Roy, 1981. "Two generalizations of the traveling salesman problem," Omega, Elsevier, vol. 9(4), pages 439-441.
    3. S. Lin & B. W. Kernighan, 1973. "An Effective Heuristic Algorithm for the Traveling-Salesman Problem," Operations Research, INFORMS, vol. 21(2), pages 498-516, April.
    4. Jon Jouis Bentley, 1992. "Fast Algorithms for Geometric Traveling Salesman Problems," INFORMS Journal on Computing, INFORMS, vol. 4(4), pages 387-411, November.
    5. Riera-Ledesma, Jorge & Salazar-Gonzalez, Juan Jose, 2005. "A heuristic approach for the Travelling Purchaser Problem," European Journal of Operational Research, Elsevier, vol. 162(1), pages 142-152, April.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Palomo-Martínez, Pamela J. & Salazar-Aguilar, M. Angélica, 2019. "The bi-objective traveling purchaser problem with deliveries," European Journal of Operational Research, Elsevier, vol. 273(2), pages 608-622.
    2. Carolina Almeida & Richard Gonçalves & Elizabeth Goldbarg & Marco Goldbarg & Myriam Delgado, 2012. "An experimental analysis of evolutionary heuristics for the biobjective traveling purchaser problem," Annals of Operations Research, Springer, vol. 199(1), pages 305-341, October.
    3. Caballero, William N. & Lunday, Brian J. & Meissner, Finn, 2024. "Regulating the rebound effect in the traveling purchaser problem," European Journal of Operational Research, Elsevier, vol. 317(3), pages 660-677.
    4. Manerba, Daniele & Mansini, Renata & Riera-Ledesma, Jorge, 2017. "The Traveling Purchaser Problem and its variants," European Journal of Operational Research, Elsevier, vol. 259(1), pages 1-18.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Manerba, Daniele & Mansini, Renata & Riera-Ledesma, Jorge, 2017. "The Traveling Purchaser Problem and its variants," European Journal of Operational Research, Elsevier, vol. 259(1), pages 1-18.
    2. Carolina Almeida & Richard Gonçalves & Elizabeth Goldbarg & Marco Goldbarg & Myriam Delgado, 2012. "An experimental analysis of evolutionary heuristics for the biobjective traveling purchaser problem," Annals of Operations Research, Springer, vol. 199(1), pages 305-341, October.
    3. Jaehn, Florian & Meissner, Finn, 2022. "The rebound effect in transportation," Omega, Elsevier, vol. 108(C).
    4. Palomo-Martínez, Pamela J. & Salazar-Aguilar, M. Angélica, 2019. "The bi-objective traveling purchaser problem with deliveries," European Journal of Operational Research, Elsevier, vol. 273(2), pages 608-622.
    5. Riera-Ledesma, Jorge & Salazar-Gonzalez, Juan Jose, 2005. "A heuristic approach for the Travelling Purchaser Problem," European Journal of Operational Research, Elsevier, vol. 162(1), pages 142-152, April.
    6. Luca Maria Gambardella & Marco Dorigo, 2000. "An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem," INFORMS Journal on Computing, INFORMS, vol. 12(3), pages 237-255, August.
    7. Jorge Riera-Ledesma & Juan-José Salazar-González, 2006. "Solving the asymmetric traveling purchaser problem," Annals of Operations Research, Springer, vol. 144(1), pages 83-97, April.
    8. William Cook & André Rohe, 1999. "Computing Minimum-Weight Perfect Matchings," INFORMS Journal on Computing, INFORMS, vol. 11(2), pages 138-148, May.
    9. Luc Muyldermans & Patrick Beullens & Dirk Cattrysse & Dirk Van Oudheusden, 2005. "Exploring Variants of 2-Opt and 3-Opt for the General Routing Problem," Operations Research, INFORMS, vol. 53(6), pages 982-995, December.
    10. Gilbert Laporte & Jorge Riera-Ledesma & Juan-José Salazar-González, 2003. "A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem," Operations Research, INFORMS, vol. 51(6), pages 940-951, December.
    11. Yannis Marinakis & Athanasios Migdalas & Panos M. Pardalos, 2005. "A Hybrid Genetic—GRASP Algorithm Using Lagrangean Relaxation for the Traveling Salesman Problem," Journal of Combinatorial Optimization, Springer, vol. 10(4), pages 311-326, December.
    12. G Babin & S Deneault & G Laporte, 2007. "Improvements to the Or-opt heuristic for the symmetric travelling salesman problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(3), pages 402-407, March.
    13. Riera-Ledesma, Jorge & Salazar-Gonzalez, Juan Jose, 2005. "The biobjective travelling purchaser problem," European Journal of Operational Research, Elsevier, vol. 160(3), pages 599-613, February.
    14. Kang, Seungmo & Ouyang, Yanfeng, 2011. "The traveling purchaser problem with stochastic prices: Exact and approximate algorithms," European Journal of Operational Research, Elsevier, vol. 209(3), pages 265-272, March.
    15. Voudouris, Christos & Tsang, Edward, 1999. "Guided local search and its application to the traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 113(2), pages 469-499, March.
    16. E. Angelelli & R. Mansini & M. Vindigni, 2009. "Exploring greedy criteria for the dynamic traveling purchaser problem," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 17(2), pages 141-158, June.
    17. Bektas, Tolga, 2006. "The multiple traveling salesman problem: an overview of formulations and solution procedures," Omega, Elsevier, vol. 34(3), pages 209-219, June.
    18. Yannis Marinakis & Athanasios Migdalas & Panos M. Pardalos, 2009. "Multiple phase neighborhood Search—GRASP based on Lagrangean relaxation, random backtracking Lin–Kernighan and path relinking for the TSP," Journal of Combinatorial Optimization, Springer, vol. 17(2), pages 134-156, February.
    19. Helsgaun, Keld, 2000. "An effective implementation of the Lin-Kernighan traveling salesman heuristic," European Journal of Operational Research, Elsevier, vol. 126(1), pages 106-130, October.
    20. Jean Bertrand Gauthier & Stefan Irnich, 2020. "Inter-Depot Moves and Dynamic-Radius Search for Multi-Depot Vehicle Routing Problems," Working Papers 2004, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:199:y:2009:i:1:p:36-45. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.