Pages that link to "Item:Q1410309"

The following pages link to New savings based algorithms for time constrained pickup and delivery of full truckloads. (Q1410309):

Displaying 13 items.

• Effective truckload dispatch decision methods with incomplete advance load information (Q322842) (← links)
• A local search heuristic for the pre- and end-haulage of intermodal container terminals (Q1017451) (← links)
• Two-phase heuristic algorithms for full truckloads multi-depot capacitated vehicle routing problem in carrier collaboration (Q1046714) (← links)
• An adaptive large neighborhood search for the full truckload pickup and delivery problem with resource synchronization (Q1651513) (← links)
• Scatter search for the stochastic travel-time vehicle routing problem with simultaneous pick-ups and deliveries (Q1761164) (← links)
• Integrated planning of loaded and empty container movements (Q1944871) (← links)
• Combined strip and discharge delivery of containers in heterogeneous fleets with time windows (Q2027011) (← links)
• Mixed-integer linear optimization for full truckload pickup and delivery (Q2047182) (← links)
• The vehicle allocation problem: alternative formulation and branch-and-price method (Q2147070) (← links)
• A Benders decomposition approach for a real case supply chain network design with capacity acquisition and transporter planning: wheat distribution network (Q2196095) (← links)
• A multiperiod drayage problem with customer-dependent service periods (Q2668610) (← links)
• Routing and scheduling field service operation by P-graph (Q2669568) (← links)
• Using Logic-Based Benders Decomposition to Solve the Capacity- and Distance-Constrained Plant Location Problem (Q2815453) (← links)