Pages that link to "Item:Q2378414"

The following pages link to A guided tabu search for the vehicle routing problem with two-dimensional loading constraints (Q2378414):

Displaying 46 items.

• Integrated distribution and loading planning via a compact metaheuristic algorithm (Q257219) (← links)
• Tabu search for the real-world carpooling problem (Q306096) (← links)
• A variable neighborhood search for the capacitated vehicle routing problem with two-dimensional loading constraints (Q319206) (← links)
• Thirty years of heterogeneous vehicle routing (Q320861) (← links)
• The vehicle routing problem with simultaneous pick-ups and deliveries and two-dimensional loading constraints (Q322687) (← links)
• A biased-randomised large neighbourhood search for the two-dimensional vehicle routing problem with backhauls (Q323548) (← links)
• An effective tabu search approach with improved loading algorithms for the 3L-CVRP (Q337416) (← links)
• An optimization algorithm for solving the rich vehicle routing problem based on variable neighborhood search and tabu search metaheuristics (Q491075) (← links)
• A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem (Q609809) (← links)
• Routing problems with loading constraints (Q610992) (← links)
• The transit route arc-node service maximization problem (Q621660) (← links)
• Heuristic and exact algorithms for the multi-pile vehicle routing problem (Q657060) (← links)
• Extended guided tabu search and a new packing algorithm for the two-dimensional loading vehicle routing problem (Q709128) (← links)
• Finished-vehicle transporter routing problem solved by loading pattern discovery (Q893051) (← links)
• Metaheuristics for vehicle routing problems with three-dimensional loading constraints (Q1038331) (← links)
• A branch-and-price algorithm for the vehicle routing problem with 2-dimensional loading constraints (Q1680068) (← links)
• A simulated annealing algorithm for the capacitated vehicle routing problem with two-dimensional loading constraints (Q1681135) (← links)
• Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review (Q1730669) (← links)
• Column generation based primal heuristics for routing and loading problems (Q1742212) (← links)
• The value of integrating loading and routing (Q1752774) (← links)
• A two-stage tabu search algorithm with enhanced packing heuristics for the 3L-CVRP and M3L-CVRP (Q1761144) (← links)
• A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints (Q1761159) (← links)
• Efficient algorithms for the double traveling salesman problem with multiple stacks (Q1762078) (← links)
• Heuristics and memetic algorithm for the two-dimensional loading capacitated vehicle routing problem with time windows (Q1788902) (← links)
• Vehicle routing problems with loading constraints: state-of-the-art and future directions (Q2018104) (← links)
• The pickup and delivery problem with time windows, multiple stacks, and handling operations (Q2140213) (← links)
• A branch-and-cut algorithm for the vehicle routing problem with two-dimensional loading constraints (Q2140338) (← links)
• Multi-objective vehicle routing and loading with time window constraints: a real-life application (Q2196102) (← links)
• Designing vehicle routes for a mix of different request types, under time windows and loading constraints (Q2355860) (← links)
• Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care (Q2356017) (← links)
• An inventory-routing problem with the objective of travel time minimization (Q2514745) (← links)
• An exact approach for the green vehicle routing problem with two-dimensional loading constraints and split delivery (Q2669556) (← links)
• An optimization model for the vehicle routing problem with practical three-dimensional loading constraints (Q2862156) (← links)
• A hybrid genetic algorithm for the vehicle routing problem with three-dimensional loading constraints (Q2893344) (← links)
• The enhanced tabu search algorithm for solving low-carbon vehicle routing problem with two-dimensional box constraints (Q3131629) (← links)
• A guided tabu search for the heterogeneous vehicle routeing problem (Q3612218) (← links)
• A theoretical and experimental study of fast lower bounds for the two-dimensional bin packing problem (Q4553880) (← links)
• A biased‐randomized algorithm for the two‐dimensional vehicle routing problem with and without item rotations (Q4979997) (← links)
• Metaheuristics for the vehicle routing problem with loading constraints (Q5295486) (← links)
• Erratum: A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints (Q5449670) (← links)
• A new heuristic scheduling method for the make-pack-route problem in make-to-order supply chains (Q5884367) (← links)
• Using biased randomization for solving the two-dimensional loading vehicle routing problem with heterogeneous fleet (Q5963103) (← links)
• Variable neighborhood search algorithms for the vehicle routing problem with two‐dimensional loading constraints and mixed linehauls and backhauls (Q6066723) (← links)
• A flow based formulation and a reinforcement learning based strategic oscillation for cross-dock door assignment (Q6090150) (← links)
• Modelling and heuristically solving many-to-many heterogeneous vehicle routing problem with cross-docking and two-dimensional loading constraints (Q6106775) (← links)
• Modeling soft unloading constraints in the multi-drop container loading problem (Q6167417) (← links)