Pages that link to "Item:Q3779986"

The following pages link to Survey Paper—Time Window Constrained Routing and Scheduling Problems (Q3779986):

Displaying 38 items.

• Generalized relax-and-fix heuristic (Q2108128) (← links)
• A hybrid algorithm for the vehicle routing problem with and/or precedence constraints and time windows (Q2147032) (← links)
• Integrated machine scheduling and vehicle routing with time windows (Q2253636) (← links)
• An iterative graph expansion approach for the scheduling and routing of airplanes (Q2337398) (← links)
• A tabu search for time-dependent multi-zone multi-trip vehicle routing problem with time windows (Q2356205) (← links)
• Fleet routing position-based model for inventory pickup under production shutdown (Q2356283) (← links)
• A parallel route building algorithm for the vehicle routing and scheduling problem with time windows (Q2367384) (← links)
• A dial-a-ride problem for client transportation in a health-care organization (Q2433383) (← links)
• New cutting-planes for the time- and/or precedence-constrained ATSP and directed VRP (Q2466786) (← links)
• Survey of research in the design and control of automated guided vehicle systems (Q2575559) (← links)
• Constraint-based robust planning and scheduling of airport apron operations through simheuristics (Q2678623) (← links)
• A heuristic algorithm for the multi-depot periodic vehicle routing problem (Q2764974) (← links)
• STRONG EQUILIBRIA IN THE VEHICLE ROUTING GAME (Q2941053) (← links)
• A soft time-windowed mechanism for vendor selection model (Q3113494) (← links)
• The vehicle routing problem with time windows and temporal dependencies (Q3113512) (← links)
• Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks (Q3150129) (← links)
• Technical Note—An Exact Algorithm for the Time-Constrained Traveling Salesman Problem (Q3342216) (← links)
• Les problèmes de tournées avec contraintes de fenêtres de temps, l'état de l'art (Q3484614) (← links)
• Probabilistic Analysis of a Vehicle Routing Problem with Time Windows (Q4305484) (← links)
• Algorithms for the Vehicle Routing Problems with Time Deadlines (Q4305486) (← links)
• Strong Coalitional Structure in an Open Vehicle Routing Game (Q4687470) (← links)
• Serving requests with on-line routing (Q5056164) (← links)
• Competitive algorithms for the on-line traveling salesman (Q5057434) (← links)
• Length-constrained cycle partition with an application to UAV routing* (Q5058406) (← links)
• Ship Traffic Optimization for the Kiel Canal (Q5126634) (← links)
• (Q5209472) (← links)
• Concentration inequalities for nonlinear matroid intersection (Q5252262) (← links)
• (Q5687193) (← links)
• (Q5743409) (← links)
• A two-phase approach for jointly determining the lot size and delivery policy in a vendor-buyer integrated system with rework (Q5891691) (← links)
• Recent progress of local search in handling the time window constraints of the vehicle routing problem (Q5893964) (← links)
• Recent progress of local search in handling the time window constraints of the vehicle routing problem (Q5919996) (← links)
• Disruption recovery for the pickup and delivery problem with time windows -- a scenario-based approach for online food delivery (Q6047877) (← links)
• A light‐touch routing optimization tool (RoOT) for vaccine and medical supply distribution in Mozambique (Q6092593) (← links)
• Minimizing earliness-tardiness costs in supplier networks -- a just-in-time truck routing problem (Q6106496) (← links)
• Route efficiency implications of time windows and vehicle capacities in first- and last-mile logistics (Q6168592) (← links)
• Switched max-plus linear-dual inequalities: cycle time analysis and applications (Q6544795) (← links)
• Earliest deadline first is a 2-approximation for DARP with time windows (Q6606221) (← links)