Pages that link to "Item:Q1885978"
From MaRDI portal
The following pages link to An improved heuristic for the period traveling salesman problem (Q1885978):
Displaying 16 items.
- Nested simulated annealing approach to periodic routing problem of a retail distribution system (Q336657) (← links)
- A set-covering based heuristic algorithm for the periodic vehicle routing problem (Q406496) (← links)
- Heuristic algorithms for the 2-period balanced travelling salesman problem in Euclidean graphs (Q621695) (← links)
- The indefinite period traveling salesman problem (Q724039) (← links)
- A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem (Q857330) (← links)
- Scheduling periodic customer visits for a traveling salesperson (Q863999) (← links)
- A multiperiod traveling salesman problem: Heuristic algorithms (Q1195106) (← links)
- A computational study of smoothing heuristics for the traveling salesman problem (Q1576330) (← links)
- The period traveling salesman problem: A new heuristic algorithm (Q1603331) (← links)
- A new heuristic for the period traveling salesman problem (Q1894732) (← links)
- A variable neighborhood search heuristic for periodic routing problems (Q2378420) (← links)
- Exact and heuristic algorithms for the vehicle routing problem with multiple interdependent time windows (Q2475859) (← links)
- A heuristic algorithm for optimal fleet composition with vehicle routing considerations (Q2815505) (← links)
- (Q4861868) (← links)
- A new heuristic for the traveling salesman problem (Q5202515) (← links)
- Improvements to the Or-opt heuristic for the symmetric travelling salesman problem (Q5428949) (← links)