Pages that link to "Item:Q2573013"
From MaRDI portal
The following pages link to Fast local search algorithms for the handicapped persons transportation problem (Q2573013):
Displaying 29 items.
- An iterated local search algorithm for a place scheduling problem (Q474475) (← links)
- LS(graph): a constraint-based local search for constraint optimization on trees and paths (Q487640) (← links)
- Local search algorithms for multiple-depot vehicle routing and for multiple traveling salesman problems with proved performance guarantees (Q489718) (← links)
- Industrial aspects and literature survey: fleet composition and routing (Q991360) (← links)
- General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic (Q1043852) (← links)
- A simulation based restricted dynamic programming approach for the green time dependent vehicle routing problem (Q1651558) (← links)
- Large multiple neighborhood search for the clustered vehicle-routing problem (Q1754733) (← links)
- Restricted dynamic programming: a flexible framework for solving realistic VRPs (Q1762058) (← links)
- Vehicle routing under time-dependent travel times: the impact of congestion avoidance (Q1762059) (← links)
- MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems (Q1948529) (← links)
- A risk-constrained time-dependent cash-in-transit routing problem in multigraph under uncertainty (Q2030315) (← links)
- On the one-to-one pickup-and-delivery problem with time windows and trailers (Q2051215) (← links)
- Two-stage vehicle routing problem with arc time windows: a mixed integer programming formulation and a heuristic approach (Q2356026) (← links)
- Heuristics for multi-attribute vehicle routing problems: a survey and synthesis (Q2356202) (← links)
- Data mining-based dispatching system for solving the local pickup and delivery problem (Q2393491) (← links)
- Solution of real-world postman problems (Q2482818) (← links)
- The exponential multi-insertion neighborhood for the vehicle routing problem with unit demands (Q2664291) (← links)
- Large multiple neighborhood search for the soft-clustered vehicle-routing problem (Q2668597) (← links)
- Dynamic dispatching for interbay automated material handling with lot targeting using improved parallel multiple-objective genetic algorithm (Q2668694) (← links)
- In-depth analysis of granular local search for capacitated vehicle routing (Q2686133) (← links)
- A characterization of odd-hole inequalities related to Latin squares (Q2868928) (← links)
- Robust Optimization of a Broad Class of Heterogeneous Vehicle Routing Problems Under Demand Uncertainty (Q3386790) (← links)
- Vehicle Routing Problems with Inter-Tour Resource Constraints (Q3564369) (← 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)
- Dynamic programming based metaheuristics for the dial-a-ride problem (Q5963101) (← links)
- A constraint programming model for the scheduling and workspace layout design of a dual-arm multi-tool assembly robot (Q6073303) (← links)
- Adaptive large variable neighborhood search for a multiperiod vehicle and technician routing problem (Q6092661) (← links)
- Inter-depot moves and dynamic-radius search for multi-depot vehicle routing problems (Q6153465) (← links)
