Pages that link to "Item:Q1039772"

The following pages link to The school bus routing problem: a review (Q1039772):

Displaying 38 items.

• A column generation approach for a school bus routing problem with resource constraints (Q340259) (← links)
• The school bus problem on trees (Q378249) (← links)
• A post-improvement procedure for the mixed load school bus routing problem (Q439357) (← links)
• A school bus scheduling problem (Q439545) (← links)
• A multi-objective capacitated rural school bus routing problem with heterogeneous fleet and mixed loads (Q681292) (← links)
• On constructing a family of student delivery routes in minimal time (Q893919) (← links)
• A heuristic algorithm for finding cost-effective solutions to real-world school bus routing problems (Q1711659) (← links)
• The demand weighted vehicle routing problem (Q1754023) (← links)
• Solving school bus routing using the multiple vehicle traveling purchaser problem: a branch-and-cut approach (Q1761989) (← links)
• An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem (Q1762031) (← links)
• Finding the nucleolus of the vehicle routing game with time windows (Q1988954) (← links)
• A relation of dominance for the bicriterion bus routing problem (Q2012147) (← links)
• A constant-factor approximation for directed latency in quasi-polynomial time (Q2119400) (← links)
• A branch-and-price algorithm for the ring-tree facility location problem (Q2132327) (← links)
• A variable neighborhood search based matheuristic for a waste cooking oil collection network design problem (Q2140329) (← links)
• A concise guide to existing and emerging vehicle routing problem variants (Q2184128) (← links)
• Column generation-based stochastic school bell time and bus scheduling optimization (Q2189900) (← links)
• Branch-cut-and-price for scheduling deliveries with time windows in a direct shipping network (Q2197321) (← links)
• Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints (Q2256169) (← links)
• Capacitated ring arborescence problems with profits (Q2284638) (← links)
• A tabu search for time-dependent multi-zone multi-trip vehicle routing problem with time windows (Q2356205) (← links)
• Fleet management: a vehicle and driver assignment model (Q2424765) (← links)
• Generating feasible schedules for a pick-up and delivery problem (Q2741264) (← links)
• The Surgical Patient Routing Problem: A Central Planner Approach (Q2960361) (← links)
• Optimization of blood sample collection with timing and quality constraints (Q4608254) (← links)
• The school bus routing and scheduling problem with transfers (Q4642460) (← links)
• School bus routing—a column generation approach (Q4980002) (← links)
• Modified differential evolution algorithms for multi-vehicle allocation and route optimization for employee transportation (Q5059399) (← links)
• A Constant-Factor Approximation for Directed Latency in Quasi-Polynomial Time (Q5874522) (← links)
• The time‐consistent dial‐a‐ride problem (Q6065902) (← links)
• The static on‐demand bus routing problem: large neighborhood search for a dial‐a‐ride problem with bus station assignment (Q6071075) (← links)
• The school bus routing problem with student choice: a bilevel approach and a simple and effective metaheuristic (Q6079878) (← links)
• Public transport for smart cities: recent innovations and future challenges (Q6106754) (← links)
• Real-time passenger bus routing problems with preferences and tradeoffs (Q6113072) (← links)
• Efficient feasibility checks and an adaptive large neighborhood search algorithm for the time-dependent green vehicle routing problem with time windows (Q6113315) (← links)
• Multi-Zone Multi-Trip Vehicle Routing Problem with Time Windows (Q6160120) (← links)
• The cumulative school bus routing problem: Polynomial‐size formulations (Q6180039) (← links)
• Optimizing extracurricular activities assignment and related logistical deployment cost between collaborating schools (Q6659107) (← links)