Skip to content
Publish & Distribute
Publishing Solutions
Distribution Solutions
Library Services
Subjects
Architecture and Design
Arts
Business and Economics
Chemistry
Classical and Ancient Near Eastern Studies
Computer Sciences
Cultural Studies
Engineering
General Interest
Geosciences
History
Industrial Chemistry
Jewish Studies
Law
Library and Information Science, Book Studies
Life Sciences
Linguistics and Semiotics
Literary Studies
Materials Sciences
Mathematics
Medicine
Music
Pharmacy
Philosophy
Physics
Social Sciences
Sports and Recreation
Theology and Religion
Publications
Journals
Books
Proceedings
Publishers
Journal Matcher
Blog
Contact
Search
English
English
Deutsch
Polski
Español
Français
Italiano
Cart
Home
Journals
Bulletin of the Polytechnic Institute of Iași. Electrical Engineering, Power Engineering, Electronics Section
Volume 69 (2023): Issue 3 (September 2023)
Open Access
Comparison Between an Exact and a Heuristic-Based Traveling Salesman Problem with Time Window Constraints
Mihaela-Alexandra Barb-Ciorbea
Mihaela-Alexandra Barb-Ciorbea
“Gheorghe Asachi” Technical University of Iași, Faculty of Automatic Control and Computer Engineering
Iași, Romania
Search for this author on
Sciendo
|
Google Scholar
Barb-Ciorbea, Mihaela-Alexandra
Nov 09, 2024
Bulletin of the Polytechnic Institute of Iași. Electrical Engineering, Power Engineering, Electronics Section
Volume 69 (2023): Issue 3 (September 2023)
About this article
Previous Article
Next Article
Abstract
References
Authors
Articles in this Issue
Preview
PDF
Cite
Share
Download Cover
Published Online:
Nov 09, 2024
Page range:
99 - 112
Received:
Jun 30, 2024
Accepted:
Aug 30, 2024
DOI:
https://doi.org/10.2478/bipie-2023-0017
Keywords
Travelling Salesman
,
optimization
,
ant colony
,
graph
,
time windows
© 2023 Mihaela-Alexandra Barb-Ciorbea, published by Sciendo
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
