Pages that link to "Item:Q1179004"

The following pages link to The pickup and delivery problem with time windows (Q1179004):

Displaying 50 items.

• The shortest path problem with forbidden paths (Q146692) (← links)
• A comparison of column-generation approaches to the synchronized pickup and delivery problem (Q319923) (← links)
• A long-haul freight transportation problem: synchronizing resources to deliver requests passing through multiple transshipment locations (Q320708) (← links)
• A branch-price-and-cut method for a ship routing and scheduling problem with split loads (Q339703) (← links)
• History-dependent scheduling: models and algorithms for scheduling with general precedence and sequence dependence (Q342093) (← links)
• A lookahead partitioning heuristic for a new assignment and scheduling problem in a distribution system (Q421661) (← links)
• A post-improvement procedure for the mixed load school bus routing problem (Q439357) (← links)
• A decomposition approach for commodity pickup and delivery with time-windows under uncertainty (Q490359) (← links)
• An efficient column-generation-based algorithm for solving a pickup-and-delivery problem (Q547107) (← links)
• An adaptive insertion algorithm for the single-vehicle dial-a-ride problem with narrow time windows (Q617511) (← links)
• Large neighborhood-based metaheuristic and branch-and-price for the pickup and delivery problem with split loads (Q724007) (← links)
• The flexible and real-time commute trip sharing problems (Q823767) (← links)
• Managing large fixed costs in vehicle routing and crew scheduling problems solved by column generation (Q856697) (← links)
• Improved modeling and solution methods for the multi-resource routing problem (Q872121) (← links)
• A branch-and-price algorithm for the multi-depot heterogeneous-fleet pickup and delivery problem with soft time windows (Q892384) (← links)
• An optimization approach for planning daily drayage operations (Q926343) (← links)
• Real-time vehicle rerouting problems with time windows (Q958553) (← links)
• A branch-and-price algorithm for placement routing for a multi-head beam-type component placement tool (Q991821) (← links)
• An exact solution framework for a broad class of vehicle routing problems (Q993700) (← links)
• Transportation planning in freight forwarding companies: Tabu search algorithm for the integrated operational transportation planning problem (Q1014990) (← links)
• A local search heuristic for the pre- and end-haulage of intermodal container terminals (Q1017451) (← links)
• The pickup and delivery problem with transfers: formulation and a branch-and-cut solution method (Q1044088) (← links)
• A genetic algorithm for service level based vehicle scheduling (Q1268204) (← links)
• Critical path in an activity network with time constraints (Q1278077) (← links)
• Single-vehicle scheduling with time window constraints (Q1297696) (← links)
• Solving binary cutting stock problems by column generation and branch- and-bound (Q1326509) (← links)
• The pickup and delivery problem: Faces and branch-and-cut algorithm (Q1368475) (← links)
• Expected part delays as a secondary layout criterion in automated manufacturing systems (Q1374180) (← links)
• New savings based algorithms for time constrained pickup and delivery of full truckloads. (Q1410309) (← links)
• Shipping problems with body clock constraints. (Q1423446) (← links)
• Operational planning of a large-scale multi-modal transportation system. (Q1426685) (← links)
• Planning models for long-haul operations of postal and express shipment companies (Q1582188) (← links)
• A multi-depot pickup and delivery problem with a single hub and heterogeneous vehicles (Q1582189) (← links)
• Current modeling practices in bank courier scheduling (Q1590431) (← links)
• Perturbation heuristics for the pickup and delivery traveling salesman problem (Q1603311) (← links)
• Daily aircraft routing for amphibious ready groups (Q1639311) (← links)
• An adaptive large neighborhood search for the full truckload pickup and delivery problem with resource synchronization (Q1651513) (← links)
• Coordinating technician allocation and maintenance routing for offshore wind farms (Q1651656) (← links)
• A traveling salesman problem with pickups and deliveries, time windows and draft limits: case study from chemical shipping (Q1652016) (← links)
• A two-phase heuristic for an in-port ship routing problem with tank allocation (Q1652535) (← links)
• A branch-and-price approach to the feeder network design problem (Q1681514) (← links)
• Solving a closed-loop location-inventory-routing problem with mixed quality defects returns in e-commerce by hybrid ant colony optimization algorithm (Q1727471) (← links)
• Minimizing the maximal ergonomic burden in intra-hospital patient transportation (Q1734337) (← links)
• Optimisation of maintenance routing and scheduling for offshore wind farms (Q1752172) (← links)
• Moving products between location pairs: cross-docking versus direct-shipping (Q1752263) (← links)
• The demand weighted vehicle routing problem (Q1754023) (← links)
• Bidirectional labeling in column-generation algorithms for pickup-and-delivery problems (Q1754114) (← links)
• A GRASP with adaptive large neighborhood search for pickup and delivery problems with transshipment (Q1761180) (← links)
• Taxi-sharing: parameterized complexity and approximability of the dial-a-ride problem with money as an incentive (Q1786606) (← links)
• Exact solutions for the collaborative pickup and delivery problem (Q1787916) (← links)