Pages that link to "Item:Q506326"
From MaRDI portal
The following pages link to A variable iterated greedy algorithm for the traveling salesman problem with time windows (Q506326):
Displaying 8 items.
- A general VNS heuristic for the traveling salesman problem with time windows (Q429659) (← links)
- Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times (Q1735381) (← links)
- Iterated maximum large neighborhood search for the traveling salesman problem with time windows and its time-dependent version (Q2108179) (← links)
- Multi-objective vehicle routing and loading with time window constraints: a real-life application (Q2196102) (← links)
- Toward solving the Steiner travelling salesman problem on urban road maps using the branch decomposition of graphs (Q2282284) (← links)
- An efficient GVNS for solving traveling salesman problem with time windows (Q2840756) (← links)
- A general variable neighborhood search for the traveling salesman problem with time windows under various objectives (Q6153469) (← links)
- Generalised formulations for minimum distance trajectory in patrolling problems (Q6598761) (← links)