Pages that link to "Item:Q1926856"

The following pages link to A hybrid algorithm for the heterogeneous fleet vehicle routing problem (Q1926856):

Displaying 50 items.

• A matheuristic approach for the pollution-routing problem (Q319140) (← links)
• Thirty years of heterogeneous vehicle routing (Q320861) (← links)
• An ILS-based algorithm to solve a large-scale real heterogeneous fleet VRP with multi-trips and docking constraints (Q322469) (← 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)
• An exact algorithm and a metaheuristic for the generalized vehicle routing problem with flexible fleet size (Q336876) (← links)
• A hybrid evolutionary algorithm for heterogeneous fleet vehicle routing problems with time windows (Q342060) (← links)
• A hybrid algorithm for large-scale service network design considering a heterogeneous fleet (Q666955) (← links)
• A new intuitional algorithm for solving heterogeneous fixed fleet routing problems: passenger pickup algorithm (Q856161) (← links)
• A column generation approach to the heterogeneous fleet vehicle routing problem (Q868147) (← links)
• A record-to-record travel algorithm for solving the heterogeneous fleet vehicle routing problem (Q875419) (← links)
• A reactive variable neighborhood tabu search for the heterogeneous fleet vehicle routing problem with time windows (Q953316) (← links)
• A tabu search heuristic for the heterogeneous fleet vehicle routing problem (Q1302554) (← 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 sweep-based algorithm for the fleet size and mix vehicle routing problem (Q1848592) (← links)
• A mathematical formulation and heuristic approach for the heterogeneous fixed fleet vehicle routing problem with simultaneous pickup and delivery (Q1983673) (← links)
• Multiobjective mathematical models and solution approaches for heterogeneous fixed fleet vehicle routing problems (Q1983754) (← 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)
• The heterogeneous fleet location routing problem with simultaneous pickup and delivery and overloads (Q2321672) (← 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 hybrid simulated annealing for capacitated vehicle routing problems with the independent route length (Q2495966) (← 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)
• The heterogeneous flexible periodic vehicle routing problem: mathematical formulations and solution algorithms (Q2669729) (← 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 heuristic algorithm for optimal fleet composition with vehicle routing considerations (Q2815505) (← links)
• A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem (Q3057116) (← links)
• A hybrid algorithm of local search for the heterogeneous fixed fleet vehicle routing problem (Q3186841) (← links)
• (Q3186848) (← links)
• (Q4452651) (← links)
• A heuristic column generation method for the heterogeneous fleet VRP (Q4511603) (← links)
• Hybrid data mining heuristics for the heterogeneous fleet vehicle routing problem (Q4611469) (← links)
• A list based threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem (Q4678127) (← links)