Skip to main content
Have a personal or library account? Click to login
Comparison Between an Exact and a Heuristic-Based Traveling Salesman Problem with Time Window Constraints Cover

Comparison Between an Exact and a Heuristic-Based Traveling Salesman Problem with Time Window Constraints

Bulletin of the Polytechnic Institute of Iași. Electrical Engineering, Power Engineering, Electronics Section
Volume 69 (2023): Issue 3 (September 2023)
By:   
Open Access
|Nov 2024
Download

Download Article

Download the full article as a PDF file.

DOI: https://doi.org/10.2478/bipie-2023-0017 | Journal eISSN: 2537-2726 | Journal ISSN: 1223-8139
Journal RSS Feed
Language: English
Page range: 99 - 112
Submitted on: Jun 30, 2024
Accepted on: Aug 30, 2024
Published on: Nov 9, 2024
Published by: Gheorghe Asachi Technical University of Iasi
In partnership with: Paradigm Publishing Services
Publication frequency: 4 issues per year
Keywords:
Travelling Salesman,
optimization,
ant colony,
graph,
time windows
Related subjects:
Engineering,
Electrical engineering,
Fundamentals of electrical engineering,
Automation,
Electronics,
Energy engineering

© 2024 Mihaela-Alexandra Barb-Ciorbea, published by Gheorghe Asachi Technical University of Iasi
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

Volume 69 (2023): Issue 3 (September 2023)
Previous article
Next article