Pages that link to "Item:Q1652321"

The following pages link to A matheuristic based on large neighborhood search for the vehicle routing problem with cross-docking (Q1652321):

Displaying 18 items.

• Vehicle dispatching for minimizing arrival conflicts in multi-supplier logistics network (Q1640629) (← links)
• An efficient matheuristic for the robust multiple allocation \(p\)-hub median problem under polyhedral demand uncertainty (Q1652700) (← links)
• Integrated scheduling and assignment of trucks at unit-load cross-dock terminals with mixed service mode dock doors (Q1999616) (← links)
• The pickup and delivery problem with split loads and transshipments: a branch-and-cut solution approach (Q2029026) (← links)
• Meta-analysis of metaheuristics: quantifying the effect of adaptiveness in adaptive large neighborhood search (Q2030591) (← links)
• Collaborative optimization of dock door assignment and vehicle scheduling in cross-docking (Q2223274) (← links)
• New decomposition methods for home care scheduling with predefined visits (Q2289923) (← links)
• A branch-and-cut-and-price algorithm for the multi-trip separate pickup and delivery problem with time windows at customers and facilities (Q2315637) (← links)
• A multi-modal competitive hub location pricing problem with customer loyalty and elastic demand (Q2664382) (← links)
• A multi-tiered vehicle routing problem with global cross-docking (Q2669633) (← links)
• An M/M/c queue model for vehicle routing problem in multi-door cross-docking environments (Q2669657) (← links)
• A hub-and-spoke architecture for a parcel delivery system using the cross-docking distribution strategy (Q6048039) (← links)
• Hybridizing adaptive large neighborhood search with kernel search: a new solution approach for the nurse routing problem with incompatible services and minimum demand (Q6056092) (← links)
• The rendezvous vehicle routing problem (Q6057627) (← links)
• The time‐consistent dial‐a‐ride problem (Q6065902) (← links)
• Adaptive large neighborhood search for the vehicle routing problem with synchronization constraints at the delivery location (Q6068533) (← links)
• An efficient environmentally friendly transportation network design via dry ports: a bi-level programming approach (Q6160968) (← links)
• A continuous‐time service network design and vehicle routing problem (Q6196874) (← links)