Pages that link to "Item:Q610992"

The following pages link to Routing problems with loading constraints (Q610992):

Displaying 50 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 hybrid algorithm for constrained order packing (Q301159) (← links)
• Hybrid algorithms for the vehicle routing problem with clustered backhauls and 3D loading constraints (Q319021) (← links)
• A variable neighborhood search for the capacitated vehicle routing problem with two-dimensional loading constraints (Q319206) (← links)
• The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: a branch-and-price approach (Q320623) (← 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 hybrid approach for the vehicle routing problem with three-dimensional loading constraints (Q336326) (← links)
• An effective tabu search approach with improved loading algorithms for the 3L-CVRP (Q337416) (← links)
• Exact algorithms for the double vehicle routing problem with multiple stacks (Q342039) (← links)
• Routing and scheduling in project shipping (Q367634) (← links)
• The tree representation for the pickup and delivery traveling salesman problem with LIFO loading (Q421561) (← links)
• Comments on: Routing Problems with loading constraints (Q610994) (← links)
• An adapted heuristic approach for a clustered traveling salesman problem with loading constraints (Q693154) (← links)
• Efficiently solving the traveling thief problem using hill climbing and simulated annealing (Q781909) (← links)
• An integrated approach to the vehicle routing and container loading problems (Q841582) (← links)
• Finished-vehicle transporter routing problem solved by loading pattern discovery (Q893051) (← links)
• A branch-price-and-cut algorithm for the vehicle routing problem with time windows and multiple deliverymen (Q1617109) (← links)
• Solving a large multicontainer loading problem in the car manufacturing industry (Q1652277) (← links)
• Formulations and algorithms for the pickup and delivery traveling salesman problem with multiple stacks (Q1652571) (← links)
• A simulated annealing algorithm for the capacitated vehicle routing problem with two-dimensional loading constraints (Q1681135) (← links)
• Formulations for the orienteering problem with additional constraints (Q1686508) (← links)
• Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review (Q1730669) (← links)
• Energy-efficient rail guided vehicle routing for two-sided loading/unloading automated freight handling system (Q1751731) (← links)
• The value of integrating loading and routing (Q1752774) (← links)
• A new load balance methodology for container loading problem in road transportation (Q1754193) (← links)
• Inventory routing with pickups and deliveries (Q1754327) (← links)
• The traveling salesman problem with draft limits (Q1761142) (← 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)
• Metaheuristics for the traveling salesman problem with pickups, deliveries and handling costs (Q1762084) (← links)
• Heuristics and memetic algorithm for the two-dimensional loading capacitated vehicle routing problem with time windows (Q1788902) (← links)
• Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints (Q1926986) (← links)
• Vehicle routing problems with loading constraints: state-of-the-art and future directions (Q2018104) (← links)
• Exact solution techniques for two-dimensional cutting and packing (Q2029021) (← links)
• The split heterogeneous vehicle routing problem with three-dimensional loading constraints on a large scale (Q2077944) (← links)
• Efficiently solving the thief orienteering problem with a max-min ant colony optimization approach (Q2080825) (← links)
• The pickup and delivery problem with time windows, multiple stacks, and handling operations (Q2140213) (← links)
• Multi-objective vehicle routing and loading with time window constraints: a real-life application (Q2196102) (← links)
• The split delivery vehicle routing problem with three-dimensional loading constraints (Q2282545) (← links)
• Pickup and delivery problem with incompatibility constraints (Q2333153) (← links)
• Constraints in container loading -- a state-of-the-art review (Q2355797) (← 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)
• Solving the 3-D yard allocation problem for break bulk cargo via variable neighborhood search branching (Q2631277) (← links)
• A weighted-sum method for solving the bi-objective traveling thief problem (Q2669668) (← links)
• The pallet-loading vehicle routing problem with stability constraints (Q2672112) (← links)
• Cutting uncertain stock and vehicle routing in a sustainability forestry harvesting problem (Q2701176) (← links)