Pages that link to "Item:Q429659"

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

Displaying 26 items.

• Scheduled penalty variable neighborhood search (Q337204) (← links)
• Two level general variable neighborhood search for attractive traveling salesman problem (Q337241) (← 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 neighborhood search for vehicle routing problem with multiple time windows (Q1791961) (← 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)
• A metaheuristic for the delivery man problem with time windows (Q2045024) (← links)
• Iterated maximum large neighborhood search for the traveling salesman problem with time windows and its time-dependent version (Q2108179) (← links)
• Deep policy dynamic programming for vehicle routing problems (Q2170197) (← 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)
• Mathematical formulations and solution methods for the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem (Q2691195) (← links)
• A generalized insertion heuristic for the travelling salesman problem with time windows (Q2781094) (← links)
• A new heuristic for the traveling salesman problem with time windows. (Q2783879) (← links)
• An efficient GVNS for solving traveling salesman problem with time windows (Q2840756) (← links)
• A compressed-annealing heuristic for the traveling salesman problem with time windows (Q2892314) (← links)
• (Q5314401) (← links)
• New integer linear programming formulation for the traveling salesman problem with time windows: minimizing tour duration with waiting times (Q5746675) (← links)
• Mixed integer programming formulations for the generalized traveling salesman problem with time windows (Q6057720) (← links)
• Exact and anytime approach for solving the time dependent traveling salesman problem with time windows (Q6096613) (← links)
• A general variable neighborhood search for the traveling salesman problem with time windows under various objectives (Q6153469) (← links)
• Integrating driver behavior into last-mile delivery routing: combining machine learning and optimization in a hybrid decision support framework (Q6168609) (← links)
• A hybrid mathematical model for flying sidekick travelling salesman problem with time windows (Q6200792) (← links)
• A comprehensive survey on the generalized traveling salesman problem (Q6556079) (← links)