IDEAS home Printed from https://ideas.repec.org/a/hin/complx/6498218.html
   My bibliography  Save this article

Coordination of Pheromone Deposition Might Solve Time-Constrained Travelling Salesman Problem

Author

Listed:
  • Tomoko Sakiyama
  • Ikuo Arizono

Abstract

In this study, we develop two Ant Colony Optimization (ACO) models as new metaheuristic models for solving the time-constrained Travelling Salesman Problem (TSP). Here, the time-constrained TSP means a TSP in which several cities have constraints that the agents have to visit within prescribed time limits. In our ACO models, only agents that achieved tour under certain conditions defined in respective ACO models are allowed to modulate pheromone deposition. The agents in one model are allowed to deposit pheromone only if they achieve a tour satisfying strictly the above purpose. The agents in the other model is allowed to deposit pheromone not only if they achieve a tour satisfying strictly the above purpose, but also if they achieve a tour satisfying the above purpose in some degree. We compare performance of two developed ACO models by focusing on pheromone deposition. We confirm that the later model performs well to some TSP benchmark datasets from TSPLIB in comparison to the former and the traditional AS (Ant System) models. Furthermore, the agent exhibits critical properties; i.e., the system exhibits complex behaviors. These results suggest that the agents perform adaptive travels by coordinating some complex pheromone depositions.

Suggested Citation

  • Tomoko Sakiyama & Ikuo Arizono, 2018. "Coordination of Pheromone Deposition Might Solve Time-Constrained Travelling Salesman Problem," Complexity, Hindawi, vol. 2018, pages 1-5, December.
    • Handle: RePEc:hin:complx:6498218
    DOI: 10.1155/2018/6498218
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/8503/2018/6498218.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/8503/2018/6498218.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2018/6498218?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. W. Qin & J. Zhang & D. Song, 2018. "An improved ant colony algorithm for dynamic hybrid flow shop scheduling with uncertain processing time," Journal of Intelligent Manufacturing, Springer, vol. 29(4), pages 891-904, April.
    2. S. Zhang & T. N. Wong, 2018. "Integrated process planning and scheduling: an enhanced ant colony optimization heuristic with parameter tuning," Journal of Intelligent Manufacturing, Springer, vol. 29(3), pages 585-601, March.
    3. Donati, Alberto V. & Montemanni, Roberto & Casagrande, Norman & Rizzoli, Andrea E. & Gambardella, Luca M., 2008. "Time dependent vehicle routing problem with a multi ant colony system," European Journal of Operational Research, Elsevier, vol. 185(3), pages 1174-1191, March.
    4. Jean-Claude Picard & Maurice Queyranne, 1978. "The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling," Operations Research, INFORMS, vol. 26(1), pages 86-110, February.
    5. Roberto Wolfler Calvo, 2000. "A New Heuristic for the Traveling Salesman Problem with Time Windows," Transportation Science, INFORMS, vol. 34(1), pages 113-124, February.
    6. Yu, Bin & Yang, Zhong Zhen, 2011. "An ant colony optimization model: The period vehicle routing problem with time windows," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 47(2), pages 166-181, March.
    Full references (including those not matched with items on IDEAS)

    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. Nicolas Rincon-Garcia & Ben J. Waterson & Tom J. Cherrett, 2018. "Requirements from vehicle routing software: perspectives from literature, developers and the freight industry," Transport Reviews, Taylor & Francis Journals, vol. 38(1), pages 117-138, January.
    2. Jean-François Cordeau & Gianpaolo Ghiani & Emanuela Guerriero, 2014. "Analysis and Branch-and-Cut Algorithm for the Time-Dependent Travelling Salesman Problem," Transportation Science, INFORMS, vol. 48(1), pages 46-58, February.
    3. Liu, Yiming & Roberto, Baldacci & Zhou, Jianwen & Yu, Yang & Zhang, Yu & Sun, Wei, 2023. "Efficient feasibility checks and an adaptive large neighborhood search algorithm for the time-dependent green vehicle routing problem with time windows," European Journal of Operational Research, Elsevier, vol. 310(1), pages 133-155.
    4. Maskooki, Alaleh & Kallio, Markku, 2023. "A bi-criteria moving-target travelling salesman problem under uncertainty," European Journal of Operational Research, Elsevier, vol. 309(1), pages 271-285.
    5. Tao Zhang & W. Art Chaovalitwongse & Yuejie Zhang, 2014. "Integrated Ant Colony and Tabu Search approach for time dependent vehicle routing problems with simultaneous pickup and delivery," Journal of Combinatorial Optimization, Springer, vol. 28(1), pages 288-309, July.
    6. Akeb, Hakim & Moncef, Btissam & Durand, Bruno, 2018. "Building a collaborative solution in dense urban city settings to enhance parcel delivery: An effective crowd model in Paris," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 119(C), pages 223-233.
    7. Roberto Baldacci & Aristide Mingozzi & Roberto Roberti, 2012. "New State-Space Relaxations for Solving the Traveling Salesman Problem with Time Windows," INFORMS Journal on Computing, INFORMS, vol. 24(3), pages 356-371, August.
    8. de Lima, Vinícius L. & Alves, Cláudio & Clautiaux, François & Iori, Manuel & Valério de Carvalho, José M., 2022. "Arc flow formulations based on dynamic programming: Theoretical foundations and applications," European Journal of Operational Research, Elsevier, vol. 296(1), pages 3-21.
    9. Sahar Validi & Arijit Bhattacharya & P. J. Byrne, 2020. "Sustainable distribution system design: a two-phase DoE-guided meta-heuristic solution approach for a three-echelon bi-objective AHP-integrated location-routing model," Annals of Operations Research, Springer, vol. 290(1), pages 191-222, July.
    10. Silva, Marcos Melo & Subramanian, Anand & Vidal, Thibaut & Ochi, Luiz Satoru, 2012. "A simple and effective metaheuristic for the Minimum Latency Problem," European Journal of Operational Research, Elsevier, vol. 221(3), pages 513-520.
    11. Furini, Fabio & Persiani, Carlo Alfredo & Toth, Paolo, 2016. "The Time Dependent Traveling Salesman Planning Problem in Controlled Airspace," Transportation Research Part B: Methodological, Elsevier, vol. 90(C), pages 38-55.
    12. Abdessamad Ait El Cadi & Omar Souissi & Rabie Ben Atitallah & Nicolas Belanger & Abdelhakim Artiba, 2018. "Mathematical programming models for scheduling in a CPU/FPGA architecture with heterogeneous communication delays," Journal of Intelligent Manufacturing, Springer, vol. 29(3), pages 629-640, March.
    13. Ricardo Gatica & Pablo Miranda, 2011. "Special Issue on Latin-American Research: A Time Based Discretization Approach for Ship Routing and Scheduling with Variable Speed," Networks and Spatial Economics, Springer, vol. 11(3), pages 465-485, September.
    14. Fleming, Christopher L. & Griffis, Stanley E. & Bell, John E., 2013. "The effects of triangle inequality on the vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 224(1), pages 1-7.
    15. Izdebski, Mariusz & Jacyna-Gołda, Ilona & Gołda, Paweł, 2022. "Minimisation of the probability of serious road accidents in the transport of dangerous goods," Reliability Engineering and System Safety, Elsevier, vol. 217(C).
    16. Konstantinos S. Boulas & Georgios D. Dounias & Chrissoleon T. Papadopoulos, 2023. "A hybrid evolutionary algorithm approach for estimating the throughput of short reliable approximately balanced production lines," Journal of Intelligent Manufacturing, Springer, vol. 34(2), pages 823-852, February.
    17. Rahma Lahyani & Leandro C. Coelho & Jacques Renaud, 2018. "Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 40(1), pages 125-157, January.
    18. Thomas R. Visser & Remy Spliet, 2020. "Efficient Move Evaluations for Time-Dependent Vehicle Routing Problems," Transportation Science, INFORMS, vol. 54(4), pages 1091-1112, July.
    19. Wenkang Zhang & Yufan Zheng & Rafiq Ahmad, 2023. "The integrated process planning and scheduling of flexible job-shop-type remanufacturing systems using improved artificial bee colony algorithm," Journal of Intelligent Manufacturing, Springer, vol. 34(7), pages 2963-2988, October.
    20. Tang, Jiafu & Yu, Yang & Li, Jia, 2015. "An exact algorithm for the multi-trip vehicle routing and scheduling problem of pickup and delivery of customers to the airport," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 73(C), pages 114-132.

    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:hin:complx:6498218. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    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.