Pages that link to "Item:Q342083"

The following pages link to Time-dependent routing problems: a review (Q342083):

Displaying 44 items.

• A branch-and-bound algorithm for the time-dependent rural postman problem (Q1628130) (← links)
• An integer programming approach for the time-dependent traveling salesman problem with time windows (Q1651554) (← 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 traveling purchaser problem with time-dependent quantities (Q1652259) (← links)
• Vehicle routing with backhauls: review and research perspectives (Q1652540) (← links)
• Optimizing the composite cost involved in road motor-transporting trucks by taking into account traffic condition (Q1727293) (← links)
• Electric vehicle routing problem with time-dependent waiting times at recharging stations (Q1738821) (← links)
• The complexity of routing with collision avoidance (Q1741493) (← links)
• A comparison of algorithms for finding an efficient theme park tour (Q1741683) (← links)
• Solving the stochastic time-dependent orienteering problem with time windows (Q1751260) (← links)
• Hybrid optimization methods for time-dependent sequencing problems (Q1751901) (← links)
• Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization (Q1991103) (← links)
• A hybrid algorithm for time-dependent vehicle routing problem with time windows (Q2027083) (← links)
• Tabu search for the time-dependent vehicle routing problem with time windows on a road network (Q2028848) (← links)
• A branch and cut algorithm for the time-dependent profitable tour problem with resource constraints (Q2029262) (← links)
• Multi-trip time-dependent vehicle routing problem with time windows (Q2029965) (← links)
• A risk-constrained time-dependent cash-in-transit routing problem in multigraph under uncertainty (Q2030315) (← links)
• Time-dependent stochastic vehicle routing problem with random requests: application to online police patrol management in Brussels (Q2030456) (← links)
• NP-hardness of shortest path problems in networks with non-FIFO time-dependent travel times (Q2094362) (← links)
• An assign-and-route matheuristic for the time-dependent inventory routing problem (Q2116930) (← links)
• Scheduling activities with time-dependent durations and resource consumptions (Q2140190) (← links)
• Dealing with time in the multiple traveling salespersons problem with moving targets (Q2155136) (← links)
• A concise guide to existing and emerging vehicle routing problem variants (Q2184128) (← links)
• Endogenous stochastic optimisation for relief distribution assisted with unmanned aerial vehicles (Q2215567) (← links)
• The time-dependent vehicle routing problem with time windows and road-network information (Q2226499) (← links)
• A hybrid reactive GRASP heuristic for the risk-averse \(k\)-traveling repairman problem with profits (Q2289922) (← links)
• An enhanced lower bound for the time-dependent travelling salesman problem (Q2333147) (← links)
• Time-dependent asymmetric traveling salesman problem with time windows: properties and an exact algorithm (Q2414451) (← links)
• Ants can orienteer a thief in their robbery (Q2661549) (← links)
• A review of vehicle routing with simultaneous pickup and delivery (Q2664320) (← links)
• The secure time-dependent vehicle routing problem with uncertain demands (Q2668686) (← links)
• On path ranking in time-dependent graphs (Q2669544) (← links)
• Adaptive large neighborhood search for the time-dependent profitable dial-a-ride problem (Q2676342) (← links)
• Optimal routing in problemsof sequential traversal of megapolises in the presence of constraints (Q5040957) (← links)
• Dynamic Programming for the Time-Dependent Traveling Salesman Problem with Time Windows (Q5060801) (← links)
• A Repeated Route-then-Schedule Approach to Coordinated Vehicle Platooning: Algorithms, Valid Inequalities and Computation (Q5106379) (← links)
• A simheuristic algorithm for time-dependent waste collection management with stochastic travel times (Q5158698) (← links)
• Comments on: ``Perspectives on integer programming for time-dependent models'' (Q5970688) (← links)
• Comments on: ``Perspectives on integer programming for time-dependent models'' (Q5970689) (← links)
• A branch-cut-and-price algorithm for the time-dependent electric vehicle routing problem with time windows (Q6087498) (← links)
• The mixed capacitated general routing problem with <scp>time‐dependent</scp> demands (Q6092639) (← links)
• Linear edge costs and labeling algorithms: The case of the time‐dependent vehicle routing problem with time windows (Q6092647) (← links)
• Exact and anytime approach for solving the time dependent traveling salesman problem with time windows (Q6096613) (← links)