Pages that link to "Item:Q1266514"

The following pages link to A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem (Q1266514):

Displaying 39 items.

• Time-dependent routing problems: a review (Q342083) (← links)
• Integrated ant colony and tabu search approach for time dependent vehicle routing problems with simultaneous pickup and delivery (Q405689) (← links)
• Evolutionary algorithms for solving multi-objective travelling salesman problem (Q656058) (← links)
• A tabu search heuristic for a sequence-dependent and time-dependent scheduling problem on a single machine (Q835634) (← links)
• An iterated local search algorithm for the time-dependent vehicle routing problem with time windows (Q951117) (← links)
• A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem (Q1266514) (← links)
• A dynamic programming heuristic for the \(P\)-median problem (Q1278985) (← links)
• A combined multistart random constructive heuristic and set partitioning based formulation for the vehicle routing problem with time dependent travel times (Q1651555) (← links)
• A simulation based restricted dynamic programming approach for the green time dependent vehicle routing problem (Q1651558) (← links)
• The time-dependent capacitated profitable tour problem with time windows and precedence constraints (Q1681438) (← links)
• Dispersion with connectivity in wireless mesh networks (Q1716989) (← links)
• A comparison of algorithms for finding an efficient theme park tour (Q1741683) (← links)
• Restricted dynamic programming: a flexible framework for solving realistic VRPs (Q1762058) (← links)
• Vehicle routing under time-dependent travel times: the impact of congestion avoidance (Q1762059) (← links)
• A dynamic vehicle routing problem with time-dependent travel times (Q1781571) (← links)
• Vehicle dispatching with time-dependent travel times (Q1869392) (← links)
• Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization (Q1991103) (← links)
• Multi-trip time-dependent vehicle routing problem with soft time windows and overtime constraints (Q2005939) (← links)
• A risk-constrained time-dependent cash-in-transit routing problem in multigraph under uncertainty (Q2030315) (← links)
• An ALNS algorithm for the static dial-a-ride problem with ride and waiting time minimization (Q2125364) (← links)
• Deep policy dynamic programming for vehicle routing problems (Q2170197) (← links)
• An enhanced lower bound for the time-dependent travelling salesman problem (Q2333147) (← links)
• A queueing framework for routing problems with time-dependent travel times (Q2369970) (← links)
• Vehicle routing with dynamic travel times: a queueing approach (Q2426527) (← links)
• Optimal toll design: a lower bound framework for the asymmetric traveling salesman problem (Q2452379) (← links)
• Optimality conditions to the acyclic travelling salesman problem. (Q2467841) (← links)
• A branch-and-cut algorithm for a production scheduling problem with sequence-dependent and time-dependent setup times (Q2471235) (← links)
• An asymmetric TSP with time windows and with time-dependent travel times and costs: an exact solution through a graph transformation (Q2482754) (← links)
• On path ranking in time-dependent graphs (Q2669544) (← links)
• Heuristic Approaches to Minimize Tour Duration for the TSP with Multiple Time Windows (Q5240195) (← links)
• Improving dynamic programming for travelling salesman with precedence constraints: parallel Morin–Marsten bounding (Q5865336) (← links)
• Dynamic programming based metaheuristics for the dial-a-ride problem (Q5963101) (← links)
• Matheuristics: survey and synthesis (Q6056873) (← links)
• Exact and anytime approach for solving the time dependent traveling salesman problem with time windows (Q6096613) (← links)
• Efficient feasibility checks and an adaptive large neighborhood search algorithm for the time-dependent green vehicle routing problem with time windows (Q6113315) (← links)
• The Synchronized Dynamic Vehicle Dispatching Problem (Q6160388) (← links)
• A bi-criteria moving-target travelling salesman problem under uncertainty (Q6167752) (← links)
• An adaptive variable neighbourhood search approach for the dynamic vehicle routing problem (Q6551141) (← links)
• Vehicle routing with time-dependent travel times: theory, practice, and benchmarks (Q6602334) (← links)