The following pages link to (Q4656643):
Displaying 32 items.
- Inter-school bus scheduling under stochastic travel times (Q264322) (← links)
- A multi-start algorithm for a balanced real-world open vehicle routing problem (Q296700) (← links)
- Operational research in education (Q319179) (← links)
- The bi-objective mixed capacitated general routing problem with different route balance criteria (Q322701) (← links)
- Improved load balancing and resource utilization for the skill vehicle routing problem (Q395849) (← links)
- A post-improvement procedure for the mixed load school bus routing problem (Q439357) (← links)
- Solution algorithms for unrelated machines minmax regret scheduling problem with interval processing times and the total flow time criterion (Q490241) (← links)
- FEMOEA: a fast and efficient multi-objective evolutionary algorithm (Q522100) (← links)
- A multi-objective capacitated rural school bus routing problem with heterogeneous fleet and mixed loads (Q681292) (← links)
- Scatter search for the fleet size and mix vehicle routing problem with time windows (Q940820) (← links)
- A multi-stop routing problem (Q940857) (← links)
- Solving a school bus scheduling problem with integer programming (Q954937) (← links)
- The school bus routing problem: a review (Q1039772) (← links)
- Scatter search for a real-life heterogeneous fleet vehicle routing problem with time windows and split deliveries in Brazil (Q1042225) (← links)
- Three-phase methodology incorporating scatter search for integrated production, inventory, and distribution routing problem (Q1665302) (← links)
- Column generation-based stochastic school bell time and bus scheduling optimization (Q2189900) (← links)
- City-courier routing and scheduling problems (Q2253369) (← links)
- Solving two location models with few facilities by using a hybrid heuristic: a real health resources case (Q2387294) (← links)
- Multi-objective vehicle routing problems (Q2480968) (← links)
- A genetic algorithm for a bi-objective capacitated arc routing problem (Q2496047) (← links)
- A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem (Q2514732) (← links)
- Scatter search --- wellsprings and challenges (Q2570140) (← links)
- A scatter search method for bi-criteria \(\{0,1\}\)-knapsack problems (Q2570142) (← links)
- Scatter search for the vehicle routing problem with time windows (Q2570159) (← links)
- The index selection problem with configurations and memory limitation: a scatter search approach (Q2668806) (← links)
- A generic branch-and-cut algorithm for multiobjective optimization problems: application to the multilabel traveling salesman problem (Q2815467) (← links)
- From Single-Objective to Multi-Objective Vehicle Routing Problems: Motivations, Case Studies, and Methods (Q3564370) (← links)
- A Fast, Network-based, Hybrid Heuristic for the Assignment of Students to Schools (Q4735023) (← links)
- Multi‐objective optimization using metaheuristics: non‐standard algorithms (Q4918257) (← links)
- The Humanitarian Pickup and Distribution Problem (Q4971575) (← links)
- A matheuristic for the MinMax capacitated open vehicle routing problem (Q6066715) (← links)
- Public transport for smart cities: recent innovations and future challenges (Q6106754) (← links)
