Pages that link to "Item:Q1926856"
From MaRDI portal
The following pages link to A hybrid algorithm for the heterogeneous fleet vehicle routing problem (Q1926856):
Displaying 33 items.
- A matheuristic approach for the pollution-routing problem (Q319140) (← links)
- Thirty years of heterogeneous vehicle routing (Q320861) (← links)
- A hybrid algorithm for a class of vehicle routing problems (Q336559) (← links)
- A column-and-cut generation algorithm for planning of Canadian armed forces tactical logistics distribution (Q336705) (← links)
- An effective matheuristic for the capacitated total quantity discount problem (Q336744) (← links)
- Enhanced branch-cut-and-price algorithm for heterogeneous fleet vehicle routing problems (Q1651704) (← links)
- An exact hybrid method for the vehicle routing problem with time windows and multiple deliverymen (Q1652283) (← links)
- A hybrid GRASP+VND heuristic for the two-echelon vehicle routing problem arising in city logistics (Q1718582) (← links)
- A skewed general variable neighborhood search algorithm with fixed threshold for the heterogeneous fleet vehicle routing problem (Q1730626) (← links)
- A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet (Q1730643) (← links)
- The line-haul feeder vehicle routing problem: mathematical model formulation and heuristic approaches (Q1754738) (← links)
- A mathematical formulation and heuristic approach for the heterogeneous fixed fleet vehicle routing problem with simultaneous pickup and delivery (Q1983673) (← links)
- Reducing pollutant emissions in a waste collection vehicle routing problem using a variable neighborhood tabu search algorithm: a case study (Q2001870) (← links)
- A metaheuristic algorithm and structured analysis for the Line-haul Feeder vehicle routing problem with time windows (Q2033323) (← links)
- Collection of different types of milk with multi-tank tankers under uncertainty: a real case study (Q2121608) (← links)
- A variable neighborhood search approach to solve the order batching problem with heterogeneous pick devices (Q2171595) (← links)
- Formulations, branch-and-cut and a hybrid heuristic algorithm for an inventory routing problem with perishable products (Q2286968) (← links)
- Waste collection inventory routing with non-stationary stochastic demands (Q2333149) (← links)
- A matheuristic for the truck and trailer routing problem (Q2355939) (← links)
- Heuristics for multi-attribute vehicle routing problems: a survey and synthesis (Q2356202) (← links)
- A unified solution framework for multi-attribute vehicle routing problems (Q2514767) (← links)
- Implicit depot assignments and rotations in vehicle routing heuristics (Q2514807) (← links)
- MineReduce: an approach based on data mining for problem size reduction (Q2664324) (← links)
- Adaptive neighborhood simulated annealing for the heterogeneous fleet vehicle routing problem with multiple cross-docks (Q2668623) (← links)
- Adaptive large neighborhood search for vehicle routing problems with transshipment facilities arising in city logistics (Q2669614) (← links)
- Multi-fleet feeder vehicle routing problem using hybrid metaheuristic (Q2669759) (← links)
- An adaptive iterated local search heuristic for the heterogeneous fleet vehicle routing problem (Q2676358) (← links)
- Exact and Heuristic Algorithms for Capacitated Vehicle Routing Problems with Quadratic Costs Structure (Q2802246) (← links)
- A hybrid algorithm of local search for the heterogeneous fixed fleet vehicle routing problem (Q3186841) (← links)
- Hybrid data mining heuristics for the heterogeneous fleet vehicle routing problem (Q4611469) (← links)
- Iterative Column Generation Algorithm for Generalized Multi-Vehicle Covering Tour Problem (Q4689379) (← links)
- Simple heuristics for the multi-period fleet size and mix vehicle routing problem (Q5879646) (← links)
- Partial linear recharging strategy for the electric fleet size and mix vehicle routing problem with time windows and recharging stations (Q6112580) (← links)
