Pages that link to "Item:Q2390996"

The following pages link to A unified exact method for solving different classes of vehicle routing problems (Q2390996):

Displaying 50 items.

• An integrative cooperative search framework for multi-decision-attribute combinatorial optimization: application to the MDPVRP (Q319782) (← links)
• The fleet size and mix location-routing problem with time windows: formulations and a heuristic algorithm (Q320620) (← 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 approach for the vehicle routing problem with three-dimensional loading constraints (Q336326) (← links)
• A branch-and-cut algorithm for the hub location and routing problem (Q337094) (← links)
• A hybrid evolutionary algorithm for heterogeneous fleet vehicle routing problems with time windows (Q342060) (← links)
• Multi-neighborhood local search optimization for machine reassignment problem (Q342289) (← links)
• Multi-depot multiple TSP: a polyhedral study and computational results (Q367624) (← links)
• A branch\&price\&cut algorithm for the vehicle routing problem with intermediate replenishment facilities (Q510949) (← links)
• Routing problems with loading constraints (Q610992) (← links)
• Comments on: Routing Problems with loading constraints (Q610994) (← links)
• Exact algorithms for routing problems under vehicle capacity constraints (Q970191) (← links)
• An exact solution framework for a broad class of vehicle routing problems (Q993700) (← links)
• The electric two-echelon vehicle routing problem (Q1634075) (← links)
• Enhanced branch-cut-and-price algorithm for heterogeneous fleet vehicle routing problems (Q1651704) (← links)
• Integral simplex using decomposition with primal cutting planes (Q1683694) (← links)
• Resource constrained routing and scheduling: review and research prospects (Q1694813) (← links)
• Lifted polynomial size formulations for the homogeneous and heterogeneous vehicle routing problems (Q1694814) (← links)
• A survey of the standard location-routing problem (Q1698292) (← links)
• Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem (Q1703462) (← links)
• A skewed general variable neighborhood search algorithm with fixed threshold for the heterogeneous fleet vehicle routing problem (Q1730626) (← links)
• An efficient computational method for large scale surgery scheduling problems with chance constraints (Q1744896) (← links)
• A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints (Q1761159) (← links)
• Exact algorithms for the chance-constrained vehicle routing problem (Q1800993) (← links)
• A hybrid algorithm for the heterogeneous fleet vehicle routing problem (Q1926856) (← links)
• A lower bound for the adaptive two-echelon capacitated vehicle routing problem (Q2012880) (← links)
• An exact solution method for a rich helicopter flight scheduling problem arising in offshore oil and gas logistics (Q2027044) (← links)
• Two-echelon vehicle routing problems: a literature review (Q2079391) (← links)
• A memory-based iterated local search algorithm for the multi-depot open vehicle routing problem (Q2178077) (← links)
• A new matheuristic approach for the multi-depot vehicle routing problem with inter-depot routes (Q2178911) (← links)
• A generic exact solver for vehicle routing and related problems (Q2196312) (← links)
• Waste collection inventory routing with non-stationary stochastic demands (Q2333149) (← links)
• An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem (Q2337401) (← links)
• A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints (Q2339816) (← links)
• Heuristics for multi-attribute vehicle routing problems: a survey and synthesis (Q2356202) (← links)
• A hybrid genetic algorithm for the multi-depot open vehicle routing problem (Q2454370) (← links)
• A unified solution framework for multi-attribute vehicle routing problems (Q2514767) (← links)
• Implicit depot assignments and rotations in vehicle routing heuristics (Q2514807) (← links)
• A column generation approach for a multi-attribute vehicle routing problem (Q2629734) (← links)
• A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem (Q2630221) (← links)
• Adaptive neighborhood simulated annealing for the heterogeneous fleet vehicle routing problem with multiple cross-docks (Q2668623) (← links)
• An efficient variable neighborhood search with tabu shaking for a class of multi-depot vehicle routing problems (Q2668773) (← links)
• An adaptive iterated local search heuristic for the heterogeneous fleet vehicle routing problem (Q2676358) (← links)
• Exact Algorithms for the Chance-Constrained Vehicle Routing Problem (Q3186494) (← links)
• A hybrid algorithm of local search for the heterogeneous fixed fleet vehicle routing problem (Q3186841) (← links)
• Robust Optimization of a Broad Class of Heterogeneous Vehicle Routing Problems Under Demand Uncertainty (Q3386790) (← links)
• Multistart Branch and Bound for Large Asymmetric Distance-Constrained Vehicle Routing Problem (Q4596148) (← links)
• Hybrid data mining heuristics for the heterogeneous fleet vehicle routing problem (Q4611469) (← links)
• Asymmetric Multidepot Vehicle Routing Problems: Valid Inequalities and a Branch-and-Cut Algorithm (Q4994165) (← links)