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

An efficient genetic algorithm for the traveling salesman problem with precedence constraints

Author

Listed:
  • Moon, Chiung
  • Kim, Jongsoo
  • Choi, Gyunghyun
  • Seo, Yoonho

Abstract

No abstract is available for this item.

Suggested Citation

  • Moon, Chiung & Kim, Jongsoo & Choi, Gyunghyun & Seo, Yoonho, 2002. "An efficient genetic algorithm for the traveling salesman problem with precedence constraints," European Journal of Operational Research, Elsevier, vol. 140(3), pages 606-617, August.
  • Handle: RePEc:eee:ejores:v:140:y:2002:i:3:p:606-617
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(01)00227-2
    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. Lysgaard, Jens, 1999. "Cluster based branching for the asymmetric traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 119(2), pages 314-325, December.
    2. Giorgio Carpaneto & Paolo Toth, 1980. "Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem," Management Science, INFORMS, vol. 26(7), pages 736-743, July.
    3. Gouveia, Luis & Pires, Jose Manuel, 1999. "The asymmetric travelling salesman problem and a reformulation of the Miller-Tucker-Zemlin constraints," European Journal of Operational Research, Elsevier, vol. 112(1), pages 134-146, January.
    4. Matteo Fischetti & Paolo Toth, 1989. "An Additive Bounding Procedure for Combinatorial Optimization Problems," Operations Research, INFORMS, vol. 37(2), pages 319-328, April.
    5. M. W. P. Savelsbergh & M. Sol, 1995. "The General Pickup and Delivery Problem," Transportation Science, INFORMS, vol. 29(1), pages 17-29, February.
    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. Carter, Arthur E. & Ragsdale, Cliff T., 2009. "Quality inspection scheduling for multi-unit service enterprises," European Journal of Operational Research, Elsevier, vol. 194(1), pages 114-126, April.
    2. Qin, Hu & Zhang, Zizhen & Qi, Zhuxuan & Lim, Andrew, 2014. "The freight consolidation and containerization problem," European Journal of Operational Research, Elsevier, vol. 234(1), pages 37-48.
    3. Izabela Nielsen & Quang-Vinh Dang & Grzegorz Bocewicz & Zbigniew Banaszak, 2017. "A methodology for implementation of mobile robot in adaptive manufacturing environments," Journal of Intelligent Manufacturing, Springer, vol. 28(5), pages 1171-1188, June.
    4. Kaj Holmberg, 2019. "The (Over)zealous Snow Remover Problem," Transportation Science, INFORMS, vol. 53(3), pages 867-881, May.
    5. Yuliang Su & Xuening Chu & Dongping Chen & Xiwu Sun, 2018. "A genetic algorithm for operation sequencing in CAPP using edge selection based encoding strategy," Journal of Intelligent Manufacturing, Springer, vol. 29(2), pages 313-332, February.
    6. Abdullah Falih & Ahmed Z. M. Shammari, 2020. "Hybrid constrained permutation algorithm and genetic algorithm for process planning problem," Journal of Intelligent Manufacturing, Springer, vol. 31(5), pages 1079-1099, June.
    7. Mina Roohnavazfar & Seyed Hamid Reza Pasandideh, 2022. "Decomposition algorithm for the multi-trip single vehicle routing problem with AND-type precedence constraints," Operational Research, Springer, vol. 22(4), pages 4253-4285, September.
    8. Carter, Arthur E. & Ragsdale, Cliff T., 2006. "A new approach to solving the multiple traveling salesperson problem using genetic algorithms," European Journal of Operational Research, Elsevier, vol. 175(1), pages 246-257, November.
    9. Merve Kayacı Çodur & Mustafa Yılmaz, 2020. "A time-dependent hierarchical Chinese postman 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. 28(1), pages 337-366, March.
    10. Yajun Yang & Zhongfei Li & Xin Wang & Qinghua Hu, 2019. "Finding the Shortest Path with Vertex Constraint over Large Graphs," Complexity, Hindawi, vol. 2019, pages 1-13, February.
    11. Gustavo Erick Anaya Fuentes & Eva Selene Hernández Gress & Juan Carlos Seck Tuoh Mora & Joselito Medina Marín, 2018. "Solution to travelling salesman problem by clusters and a modified multi-restart iterated local search metaheuristic," PLOS ONE, Public Library of Science, vol. 13(8), pages 1-20, August.
    12. Nikolakopoulos, Athanassios & Sarimveis, Haralambos, 2007. "A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 177(3), pages 1911-1929, March.

    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. Margarita P. Castro & Andre A. Cire & J. Christopher Beck, 2020. "An MDD-Based Lagrangian Approach to the Multicommodity Pickup-and-Delivery TSP," INFORMS Journal on Computing, INFORMS, vol. 32(2), pages 263-278, April.
    2. Gerardo Berbeglia & Jean-François Cordeau & Irina Gribkovskaia & Gilbert Laporte, 2007. "Static pickup and delivery problems: a classification scheme and survey," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 15(1), pages 1-31, July.
    3. Quan Lu & Maged Dessouky, 2004. "An Exact Algorithm for the Multiple Vehicle Pickup and Delivery Problem," Transportation Science, INFORMS, vol. 38(4), pages 503-514, November.
    4. Quadrifoglio, Luca & Dessouky, Maged M. & Ordonez, Fernando, 2008. "Mobility allowance shuttle transit (MAST) services: MIP formulation and strengthening with logic constraints," European Journal of Operational Research, Elsevier, vol. 185(2), pages 481-494, March.
    5. Lysgaard, Jens, 1999. "Cluster based branching for the asymmetric traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 119(2), pages 314-325, December.
    6. Lu, Quan & Dessouky, Maged M., 2006. "A new insertion-based construction heuristic for solving the pickup and delivery problem with time windows," European Journal of Operational Research, Elsevier, vol. 175(2), pages 672-687, December.
    7. Gronalt, Manfred & Hartl, Richard F. & Reimann, Marc, 2003. "New savings based algorithms for time constrained pickup and delivery of full truckloads," European Journal of Operational Research, Elsevier, vol. 151(3), pages 520-535, December.
    8. Capelle, Thomas & Cortés, Cristián E. & Gendreau, Michel & Rey, Pablo A. & Rousseau, Louis-Martin, 2019. "A column generation approach for location-routing problems with pickup and delivery," European Journal of Operational Research, Elsevier, vol. 272(1), pages 121-131.
    9. Hatzenbühler, Jonas & Jenelius, Erik & Gidófalvi, Gyözö & Cats, Oded, 2023. "Modular vehicle routing for combined passenger and freight transport," Transportation Research Part A: Policy and Practice, Elsevier, vol. 173(C).
    10. Jesus Gonzalez-Feliu, 2013. "Vehicle Routing in Multi-Echelon Distribution Systems with Cross-Docking: A Systematic Lexical-Metanarrative Analysis," Post-Print halshs-00834573, HAL.
    11. Diana, Marco & Dessouky, Maged M., 2004. "A new regret insertion heuristic for solving large-scale dial-a-ride problems with time windows," Transportation Research Part B: Methodological, Elsevier, vol. 38(6), pages 539-557, July.
    12. Goel, Asvin & Meisel, Frank, 2013. "Workforce routing and scheduling for electricity network maintenance with downtime minimization," European Journal of Operational Research, Elsevier, vol. 231(1), pages 210-228.
    13. Francis, Peter & Zhang, Guangming & Smilowitz, Karen, 2007. "Improved modeling and solution methods for the multi-resource routing problem," European Journal of Operational Research, Elsevier, vol. 180(3), pages 1045-1059, August.
    14. Dikas, G. & Minis, I., 2014. "Scheduled paratransit transport systems," Transportation Research Part B: Methodological, Elsevier, vol. 67(C), pages 18-34.
    15. Jansen, Benjamin & Swinkels, Pieter C. J. & Teeuwen, Geert J. A. & van Antwerpen de Fluiter, Babette & Fleuren, Hein A., 2004. "Operational planning of a large-scale multi-modal transportation system," European Journal of Operational Research, Elsevier, vol. 156(1), pages 41-53, July.
    16. Cristián E. Cortés & Doris Sáez & Alfredo Núñez & Diego Muñoz-Carpintero, 2009. "Hybrid Adaptive Predictive Control for a Dynamic Pickup and Delivery Problem," Transportation Science, INFORMS, vol. 43(1), pages 27-42, February.
    17. Masoud, Neda & Jayakrishnan, R., 2017. "A decomposition algorithm to solve the multi-hop Peer-to-Peer ride-matching problem," Transportation Research Part B: Methodological, Elsevier, vol. 99(C), pages 1-29.
    18. Pop, Petrică C. & Cosma, Ovidiu & Sabo, Cosmin & Sitar, Corina Pop, 2024. "A comprehensive survey on the generalized traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 314(3), pages 819-835.
    19. Le-Anh, T. & de Koster, M.B.M., 2004. "A Review Of Design And Control Of Automated Guided Vehicle Systems," ERIM Report Series Research in Management ERS;2004-030-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    20. Paul Buijs & Jose Alejandro Lopez Alvarez & Marjolein Veenstra & Kees Jan Roodbergen, 2016. "Improved Collaborative Transport Planning at Dutch Logistics Service Provider Fritom," Interfaces, INFORMS, vol. 46(2), pages 119-132, April.

    More about this item

    Statistics

    Access and download statistics

    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:140:y:2002:i:3:p:606-617. 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.