Pages that link to "Item:Q2892314"
From MaRDI portal
The following pages link to A Compressed-Annealing Heuristic for the Traveling Salesman Problem with Time Windows (Q2892314):
Displayed 12 items.
- Scheduled penalty variable neighborhood search (Q337204) (← links)
- A general VNS heuristic for the traveling salesman problem with time windows (Q429659) (← links)
- Annealing a genetic algorithm for constrained optimization (Q613595) (← links)
- An optimization approach for communal home meal delivery service: A case study (Q837090) (← links)
- Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines (Q958456) (← links)
- A stochastic dynamic traveling salesman problem with hard time windows (Q1042055) (← links)
- Operational aircraft maintenance routing problem with remaining time consideration (Q2256235) (← links)
- Beam-ACO for the travelling salesman problem with time windows (Q2270441) (← links)
- New State-Space Relaxations for Solving the Traveling Salesman Problem with Time Windows (Q2815450) (← links)
- An efficient GVNS for solving Traveling Salesman Problem with Time Windows (Q2840756) (← links)
- Performance evaluation of dynamic scheduling approaches in vehicle-based internal transport systems (Q3168926) (← links)
- New integer linear programming formulation for the traveling salesman problem with time windows: minimizing tour duration with waiting times (Q5746675) (← links)