Pages that link to "Item:Q955597"

The following pages link to Ant colony optimization for the two-dimensional loading vehicle routing problem (Q955597):

Displaying 45 items.

• Integrated distribution and loading planning via a compact metaheuristic algorithm (Q257219) (← links)
• Rich vehicle routing problems: from a taxonomy to a definition (Q299767) (← links)
• A variable neighborhood search for the capacitated vehicle routing problem with two-dimensional loading constraints (Q319206) (← links)
• The vehicle routing problem with simultaneous pick-ups and deliveries and two-dimensional loading constraints (Q322687) (← links)
• A hybrid algorithm for the vehicle routing problem with pickup and delivery and three-dimensional loading constraints (Q323423) (← links)
• A biased-randomised large neighbourhood search for the two-dimensional vehicle routing problem with backhauls (Q323548) (← links)
• A two-phase scheduling method with the consideration of task clustering for Earth observing satellites (Q336398) (← links)
• An effective tabu search approach with improved loading algorithms for the 3L-CVRP (Q337416) (← 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)
• 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)
• Ant colony optimization for the two-dimensional loading vehicle routing problem (Q955597) (← links)
• Metaheuristics for vehicle routing problems with three-dimensional loading constraints (Q1038331) (← 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)
• The value of integrating loading and routing (Q1752774) (← 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 vehicle routing problem with heterogeneous locker boxes (Q2033310) (← 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)
• Heuristics for multi-attribute vehicle routing problems: a survey and synthesis (Q2356202) (← links)
• Two-dimensional strip packing with unloading constraints (Q2448886) (← links)
• Route optimization cold chain logistic distribution using greedy search method (Q2656558) (← links)
• Routing and scheduling field service operation by P-graph (Q2669568) (← links)
• The pallet-loading vehicle routing problem with stability constraints (Q2672112) (← 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)
• Vehicle routing problem based on a fuzzy customer clustering approach for logistics network optimization (Q2988479) (← links)
• A theoretical and experimental study of fast lower bounds for the two-dimensional bin packing problem (Q4553880) (← links)
• Large neighborhood search for the pickup and delivery traveling salesman problem with multiple stacks (Q4648688) (← links)
• A biased‐randomized algorithm for the two‐dimensional vehicle routing problem with and without item rotations (Q4979997) (← links)
• Learning-Based Branch-and-Price Algorithms for the Vehicle Routing Problem with Time Windows and Two-Dimensional Loading Constraints (Q5087714) (← links)
• A branch‐and‐cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks (Q5326770) (← links)
• A branch‐and‐bound algorithm for the double travelling salesman problem with two stacks (Q5326779) (← links)
• Using biased randomization for solving the two-dimensional loading vehicle routing problem with heterogeneous fleet (Q5963103) (← 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)
• A branch‐and‐price‐based heuristic for the vehicle routing problem with two‐dimensional loading constraints and time windows (Q6187233) (← links)