Pages that link to "Item:Q697581"

The following pages link to Models, relaxations and exact approaches for the capacitated vehicle routing problem (Q697581):

Displaying 50 items.

• A new novel local search integer-programming-based heuristic for PCB assembly on collect-and-place machines (Q266405) (← links)
• The vehicle rescheduling problem (Q336901) (← links)
• A hybrid evolutionary algorithm for heterogeneous fleet vehicle routing problems with time windows (Q342060) (← links)
• Efficient techniques for the multi-period vehicle routing problem with time windows within a branch and price framework (Q363544) (← links)
• A robust optimization approach to dispatching technicians under stochastic service times (Q375999) (← links)
• A simple model of optimal clearance of improvised explosive devices (Q378771) (← links)
• On the kidney exchange problem: cardinality constrained cycle and chain problems on directed graphs: a survey of integer programming approaches (Q512864) (← links)
• A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for the capacitated vehicle routing problem (Q596294) (← links)
• Routing problems with loading constraints (Q610992) (← links)
• Comments on: Routing Problems with loading constraints (Q610994) (← links)
• Heuristic and exact algorithms for the multi-pile vehicle routing problem (Q657060) (← links)
• Location-routing: issues, models and methods (Q856260) (← links)
• Genetic algorithms for supply-chain scheduling: a case study in the distribution of ready-mixed concrete (Q857351) (← links)
• An application of special ordered sets to a periodic milk collection problem (Q869614) (← links)
• Competitiveness based on logistic management: a real case study (Q889527) (← links)
• Honey bees mating optimization algorithm for large scale vehicle routing problems (Q968387) (← links)
• Exact algorithms for routing problems under vehicle capacity constraints (Q970191) (← links)
• A solution approach from an analytic model to heuristic algorithm for special case of vehicle routing problem with stochastic demands (Q1023176) (← links)
• Local improvement in planar facility location using vehicle routing (Q1026598) (← links)
• An approximate dynamic programming approach for the vehicle routing problem with stochastic demands (Q1027533) (← links)
• Two-phase heuristic algorithms for full truckloads multi-depot capacitated vehicle routing problem in carrier collaboration (Q1046714) (← links)
• A decision support system for a real vehicle routing problem. (Q1420384) (← links)
• D-Ants: Savings Based Ants divide and conquer the vehicle routing problem. (Q1427099) (← links)
• Managing platelet supply through improved routing of blood collection vehicles (Q1651648) (← links)
• A node current-based 2-index formulation for the fixed-destination multi-depot travelling salesman problem (Q1681265) (← links)
• A matheuristic for the asymmetric capacitated vehicle routing problem (Q1686058) (← links)
• A variable neighborhood search algorithm for the capacitated vehicle routing problem (Q1687688) (← links)
• Probabilistic time-dependent vehicle routing problem (Q1788926) (← links)
• The close-open mixed vehicle routing problem (Q1926744) (← links)
• A computational study of solution approaches for the resource constrained elementary shortest path problem (Q1945074) (← links)
• MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems (Q1948529) (← links)
• Hybrid particle swarm optimization with genetic algorithm for solving capacitated vehicle routing problem with fuzzy demand - a case study on garbage collection system (Q2017925) (← links)
• \textsc{Conjure}: automatic generation of constraint models from problem specifications (Q2163883) (← links)
• A hybrid adaptive iterated local search with diversification control to the capacitated vehicle routing problem (Q2240058) (← links)
• An inverse optimization approach for a capacitated vehicle routing problem (Q2242401) (← links)
• Application of a fuzzy ant colony system to solve the dynamic vehicle routing problem with uncertain service time (Q2281749) (← links)
• Heuristics for the lexicographic Max-ordering vehicle routing problem (Q2461267) (← links)
• Formulations and valid inequalities for the heterogeneous vehicle routing problem (Q2490341) (← links)
• Minimizing the total cost in an integrated vendor-managed inventory system (Q2491326) (← links)
• Robust branch-and-cut-and-price for the capacitated vehicle routing problem (Q2492675) (← links)
• A new VRPPD model and a hybrid heuristic solution approach for e-tailing (Q2514740) (← links)
• A heuristic approach for a real-world electric vehicle routing problem (Q2632520) (← links)
• Medical waste collection considering transportation and storage risk (Q2664296) (← links)
• Optimal fleet deployment for electric vehicle sharing systems with the consideration of demand uncertainty (Q2669538) (← links)
• A conditional-logic interpretation for Miller-Tucker-Zemlin inequalities and extensions (Q2688908) (← links)
• Routing Optimization Under Uncertainty (Q2806069) (← links)
• Linear temporal logic vehicle routing with applications to multi-UAV mission planning (Q2903986) (← links)
• Applying an Intensification Strategy on Vehicle Routing Problem (Q3564531) (← links)
• (Q4577928) (← links)
• Strong Coalitional Structure in an Open Vehicle Routing Game (Q4687470) (← links)