Pages that link to "Item:Q3771948"
From MaRDI portal
The following pages link to Pickup and Delivery of Partial Loads with “Soft” Time Windows (Q3771948):
Displaying 30 items.
- A column generation algorithm for the vehicle routing problem with soft time windows (Q538287) (← links)
- A vehicle routing problem with pickup and delivery time windows, and coordination of transportable resources (Q716354) (← links)
- A goal programming approach to vehicle routing problems with soft time windows (Q857306) (← links)
- Delivery itineraries and distribution capacity of a freight network with time slots (Q858262) (← links)
- An insertion heuristic for scheduling mobility allowance shuttle transit (MAST) services (Q880577) (← links)
- A branch-and-price algorithm for the multi-depot heterogeneous-fleet pickup and delivery problem with soft time windows (Q892384) (← links)
- Generalised pickup and delivery problem with dynamic time windows (Q973446) (← links)
- Vehicle routing problem with fuzzy time windows (Q1037889) (← links)
- The pickup and delivery problem with time windows (Q1179004) (← links)
- A matching-based approach for solving a delivery/pick-up vehicle routing problem with time constraints (Q1198141) (← links)
- New savings based algorithms for time constrained pickup and delivery of full truckloads. (Q1410309) (← links)
- Planning models for long-haul operations of postal and express shipment companies (Q1582188) (← links)
- Perturbation heuristics for the pickup and delivery traveling salesman problem (Q1603311) (← links)
- Multi-depot vehicle scheduling problems with time windows and waiting costs (Q1806860) (← links)
- A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives (Q1908288) (← links)
- Routing problems: A bibliography (Q1908308) (← links)
- Exact and heuristic dynamic programming algorithms for the traveling salesman problem with flexible time windows (Q2174903) (← links)
- Integrated order batching and vehicle routing operations in grocery retail -- a general adaptive large neighborhood search algorithm (Q2240047) (← links)
- Dynamic transportation of patients in hospitals (Q2267375) (← links)
- A dial-a-ride problem for client transportation in a health-care organization (Q2433383) (← links)
- Vehicle routing problems with simultaneous pick-up and delivery service. (Q2467847) (← links)
- Resource extension functions: properties, inversion, and generalization to segments (Q2480803) (← links)
- CP methods for scheduling and routing with~time-dependent task costs (Q2513747) (← links)
- A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service (Q2566927) (← links)
- An effective and fast heuristic for the dial-a-ride problem (Q2644373) (← links)
- Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: II. Routing (Q3755217) (← links)
- A Pricing Algorithm for the Vehicle Routing Problem with Soft Time Windows (Q5850940) (← links)
- Ship scheduling with soft time windows: An optimisation based approach (Q5935388) (← links)
- Point-to-point and milk run delivery scheduling: models, complexity results, and algorithms based on Benders decomposition (Q6099459) (← links)
- Étude comparative de divers modèles pour le problème de transport à la demande (Q6102816) (← links)
