Pages that link to "Item:Q4004741"

The following pages link to A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows (Q4004741):

Displaying 50 items.

• Branch-and-price for a class of nonconvex mixed-integer nonlinear programs (Q2052398) (← links)
• On solving the time window assignment vehicle routing problem via iterated local search (Q2056911) (← links)
• A column generation and a post optimization VNS heuristic for the vehicle routing problem with multiple time Windows (Q2070117) (← links)
• TLHSA and SACA: two heuristic algorithms for two variant VRP models (Q2084658) (← links)
• An efficient model-based branch-and-price algorithm for unrelated-parallel machine batching and scheduling problems (Q2093186) (← links)
• Robust vehicle routing under uncertainty via branch-price-and-cut (Q2101653) (← links)
• Time window optimization for attended home service delivery under multiple sources of uncertainties (Q2108142) (← links)
• Asynchronous optimization of part logistics routing problem (Q2124805) (← links)
• A branch-and-cut algorithm for the generalized traveling salesman problem with time windows (Q2189879) (← links)
• A column generation-based heuristic for the split delivery vehicle routing problem with time windows (Q2226483) (← links)
• Arc flow formulations based on dynamic programming: theoretical foundations and applications (Q2239929) (← links)
• A robust optimization approach with probe-able uncertainty (Q2239954) (← links)
• Ship routing using genetic algorithms (Q2241313) (← links)
• A multi-objective vehicle routing and scheduling problem with uncertainty in customers' request and priority (Q2251139) (← links)
• Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints (Q2256169) (← links)
• Improving set partitioning problem solutions by zooming around an improving direction (Q2288990) (← links)
• A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints (Q2339816) (← links)
• Solving the selective multi-category parallel-servicing problem (Q2341388) (← links)
• Elevator dispatching problem: a mixed integer linear programming formulation and polyhedral results (Q2343997) (← links)
• Fleet routing position-based model for inventory pickup under production shutdown (Q2356283) (← links)
• A heuristic for cumulative vehicle routing using column generation (Q2357169) (← links)
• Single vehicle routing with predefined client sequence and multiple warehouse returns: the case of two warehouses (Q2358165) (← links)
• An optimization algorithm for a capacitated vehicle routing problem with time windows (Q2363743) (← links)
• Three-stage approaches for optimizing some variations of the resource constrained shortest-path sub-problem in a column generation context (Q2371346) (← links)
• Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs (Q2384394) (← links)
• Improved branch-cut-and-price for capacitated vehicle routing (Q2398107) (← links)
• Reachability cuts for the vehicle routing problem with time windows (Q2432846) (← links)
• Build-pack planning for hard disk drive assembly with approved vendor matrices and stochastic demands (Q2433468) (← links)
• A branch-and-price approach for operational aircraft maintenance routing (Q2433558) (← links)
• Simultaneous column-and-row generation for large-scale linear programs with column-dependent-rows (Q2434985) (← links)
• Interior point stabilization for column generation (Q2465956) (← links)
• New cutting-planes for the time- and/or precedence-constrained ATSP and directed VRP (Q2466786) (← links)
• A model to optimize placement operations on dual-head placement machines (Q2467135) (← links)
• Formulations and exact algorithms for the vehicle routing problem with time windows (Q2468488) (← links)
• An exact algorithm for team orienteering problems (Q2477614) (← links)
• Grasp and delivery for moving objects on broken lines (Q2481562) (← links)
• The first \(K\) shortest unique-arc walks in a traffic-light network (Q2486756) (← links)
• A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems (Q2488912) (← links)
• Vehicle routing problem with elementary shortest path based column generation (Q2489135) (← links)
• Robust branch-and-cut-and-price for the capacitated vehicle routing problem (Q2492675) (← links)
• Lagrangian duality applied to the vehicle routing problem with time windows (Q2496037) (← links)
• Solving a class of stochastic mixed-integer programs with branch and price (Q2502208) (← links)
• Finding \(K\) shortest looping paths with waiting time in a time--window network (Q2504439) (← links)
• A hybrid multiobjective evolutionary algorithm for solving vehicle routing problem with time windows (Q2506187) (← links)
• Vehicle routing with soft time windows and stochastic travel times: a column generation and branch-and-price solution approach (Q2514731) (← links)
• Scatter search for the vehicle routing problem with time windows (Q2570159) (← links)
• A two-echelon inventory optimization model with demand time window considerations (Q2574100) (← links)
• Survey of research in the design and control of automated guided vehicle systems (Q2575559) (← links)
• Accelerated label setting algorithms for the elementary resource constrained shortest path problem (Q2583711) (← links)
• A column generation approach for a multi-attribute vehicle routing problem (Q2629734) (← links)