Pages that link to "Item:Q319206"

The following pages link to A variable neighborhood search for the capacitated vehicle routing problem with two-dimensional loading constraints (Q319206):

Displaying 27 items.

• 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 variable neighborhood search for the capacitated arc routing problem with intermediate facilities (Q953311) (← links)
• A simulated annealing algorithm for the capacitated vehicle routing problem with two-dimensional loading constraints (Q1681135) (← links)
• Appointment scheduling and routing optimization of attended home delivery system with random customer behavior (Q1683134) (← 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)
• Cooperative versus non-cooperative parallel variable neighborhood search strategies: a case study on the capacitated vehicle routing problem (Q2022213) (← 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)
• Scheduling unrelated additive manufacturing machines with practical constraints (Q2147124) (← links)
• Minimizing late deliveries in a truck loading problem (Q2189887) (← links)
• Multi-objective vehicle routing and loading with time window constraints: a real-life application (Q2196102) (← links)
• A mathematical model and algorithms for the aircraft hangar maintenance scheduling problem (Q2307234) (← links)
• An efficient variable neighborhood search with tabu shaking for a class of multi-depot vehicle routing problems (Q2668773) (← links)
• An exact approach for the green vehicle routing problem with two-dimensional loading constraints and split delivery (Q2669556) (← links)
• Solving the capacitated dispersion problem with variable neighborhood search approaches: from basic to skewed VNS (Q2669792) (← links)
• The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers (Q2691324) (← links)
• A theoretical and experimental study of fast lower bounds for the two-dimensional bin packing problem (Q4553880) (← links)
• Robust Data-Driven Vehicle Routing with Time Windows (Q4994169) (← links)
• An improved matheuristic for solving the electric vehicle routing problem with time windows and synchronized mobile charging/battery swapping (Q6047843) (← links)
• The bus sightseeing problem (Q6080627) (← links)
• A variable neighborhood search heuristic algorithm for the double vehicle routing problem with multiple stacks (Q6088235) (← links)
• Integrating driver behavior into last-mile delivery routing: combining machine learning and optimization in a hybrid decision support framework (Q6168609) (← links)
• A branch‐and‐price‐based heuristic for the vehicle routing problem with two‐dimensional loading constraints and time windows (Q6187233) (← links)
• A variable neighborhood search for the green vehicle routing problem with two-dimensional loading constraints and split delivery (Q6565397) (← links)