TSP solution using an exact model based on the branch flow formulation and automatic cases generation via the Julia software
The traveling salesman problem (TSP) is a classical optimization problem with practical applications in logistics, transportation, and network design. This research proposes an efficient mixed-integer linear programming (MILP) model based on the branch flow formulation which prevents the formation o...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Elsevier
2024-12-01
|
| Series: | Results in Control and Optimization |
| Subjects: | |
| Online Access: | http://www.sciencedirect.com/science/article/pii/S266672072400136X |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|