Pages that link to "Item:Q429659"

The following pages link to A general VNS heuristic for the traveling salesman problem with time windows (Q429659):

Displayed 10 items.

• Scheduled penalty variable neighborhood search (Q337204) ‎ (← links)
• A variable iterated greedy algorithm for the traveling salesman problem with time windows (Q506326) ‎ (← links)
• A variable neighborhood search heuristic for the maximum ratio clique problem (Q1652431) ‎ (← links)
• Variable neighbourhood structures for cycle location problems (Q1926979) ‎ (← links)
• Solving the traveling salesman problem with time windows through dynamically generated time-expanded networks (Q2011598) ‎ (← links)
• The hybrid electric vehicle-traveling salesman problem with time windows (Q2178092) ‎ (← links)
• Multi-objective vehicle routing and loading with time window constraints: a real-life application (Q2196102) ‎ (← links)
• Combinatorial GVNS (general variable neighborhood search) optimization for dynamic garbage collection (Q2331437) ‎ (← links)
• An efficient GVNS for solving Traveling Salesman Problem with Time Windows (Q2840756) ‎ (← links)
• New integer linear programming formulation for the traveling salesman problem with time windows: minimizing tour duration with waiting times (Q5746675) ‎ (← links)