Pages that link to "Item:Q4021780"

The following pages link to Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms (Q4021780):

Displaying 24 items.

• A branch-and-cut algorithm for a production scheduling problem with sequence-dependent and time-dependent setup times (Q2471235) (← links)
• Resource extension functions: properties, inversion, and generalization to segments (Q2480803) (← links)
• An asymmetric TSP with time windows and with time-dependent travel times and costs: an exact solution through a graph transformation (Q2482754) (← links)
• CP methods for scheduling and routing with~time-dependent task costs (Q2513747) (← links)
• The secure time-dependent vehicle routing problem with uncertain demands (Q2668686) (← links)
• The aquaculture service vessel routing problem with time dependent travel times and synchronization constraints (Q2669481) (← links)
• A scatter search algorithm for time-dependent prize-collecting arc routing problems (Q2669496) (← links)
• On path ranking in time-dependent graphs (Q2669544) (← links)
• The multi-period \(p\)-center problem with time-dependent travel times (Q2669591) (← links)
• Adaptive large neighborhood search for the time-dependent profitable dial-a-ride problem (Q2676342) (← links)
• The time-dependent rural postman problem: polyhedral results (Q2867412) (← links)
• On-orbit servicing: a time-dependent, moving-target traveling salesman problem (Q3422374) (← links)
• Hierarchical Chinese postman problem with fuzzy travel times (Q5084174) (← links)
• A simheuristic algorithm for time-dependent waste collection management with stochastic travel times (Q5158698) (← links)
• An efficient two-phase metaheuristic algorithm for the time dependent traveling Salesman problem (Q5242274) (← links)
• On-Line Vehicle Routing and Scheduling With Time-Varying Travel Speeds (Q5485097) (← links)
• The time-dependent shortest path and vehicle routing problem (Q5889200) (← links)
• Combinatorial optimization and green logistics (Q5900891) (← links)
• Combinatorial optimization and green logistics (Q5925286) (← links)
• The mixed capacitated general routing problem with <scp>time‐dependent</scp> demands (Q6092639) (← 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)
• Waiting and Buffering Strategies for the Dynamic Pickup and Delivery Problem with Time Windows (Q6160362) (← links)
• A bi-criteria moving-target travelling salesman problem under uncertainty (Q6167752) (← links)