Pages that link to "Item:Q4836837"

The following pages link to The General Pickup and Delivery Problem (Q4836837):

Displaying 50 items.

• Heuristics for routes generation in pickup and delivery problem (Q300807) (← links)
• Alternative approaches to the crude oil tanker routing and scheduling problem with split pickup and split delivery (Q319010) (← links)
• Non-myopic vehicle and route selection in dynamic DARP with travel time and workload objectives (Q339640) (← links)
• History-dependent scheduling: models and algorithms for scheduling with general precedence and sequence dependence (Q342093) (← links)
• Models for the single-vehicle preemptive pickup and delivery problem (Q421257) (← links)
• A lookahead partitioning heuristic for a new assignment and scheduling problem in a distribution system (Q421661) (← links)
• On the complexity of the Eulerian closed walk with precedence path constraints problem (Q441867) (← links)
• The directed orienteering problem (Q547309) (← links)
• Heuristic and exact algorithms for a min-max selective vehicle routing problem (Q622161) (← links)
• Local search heuristics for the probabilistic dial-a-ride problem (Q657055) (← links)
• A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery (Q705506) (← links)
• Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries (Q707138) (← links)
• Reverse logistics: simultaneous design of delivery routes and returns strategies (Q850304) (← links)
• An approximation algorithm for the pickup and delivery vehicle routing problem on trees (Q860395) (← links)
• Improved modeling and solution methods for the multi-resource routing problem (Q872121) (← 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)
• A general vehicle routing problem (Q932181) (← links)
• Real-time split-delivery pickup and delivery time window problems with transfers (Q940817) (← links)
• A multi-stop routing problem (Q940857) (← links)
• A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem (Q959510) (← links)
• The single vehicle pickup and delivery problem with time windows: Intelligent operators for heuristic and metaheuristic algorithms (Q972640) (← links)
• Operative transportation planning in consumer goods supply chains (Q973062) (← links)
• A branch-and-price algorithm for placement routing for a multi-head beam-type component placement tool (Q991821) (← links)
• A local search heuristic for the pre- and end-haulage of intermodal container terminals (Q1017451) (← links)
• The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches (Q1027598) (← links)
• The pickup and delivery problem with transfers: formulation and a branch-and-cut solution method (Q1044088) (← links)
• Real-time control of freight forwarder transportation networks by integrating multimodal transport chains (Q1044090) (← links)
• The pickup and delivery problem: Faces and branch-and-cut algorithm (Q1368475) (← links)
• New savings based algorithms for time constrained pickup and delivery of full truckloads. (Q1410309) (← links)
• Operational planning of a large-scale multi-modal transportation system. (Q1426685) (← links)
• A heuristic for the pickup and delivery traveling salesman problem (Q1571039) (← 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)
• Perturbation heuristics for the pickup and delivery traveling salesman problem (Q1603311) (← 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)
• The pickup and delivery problem with time windows and handling operations (Q1652028) (← links)
• A two-stage simulated annealing algorithm for the many-to-many milk-run routing problem with pipeline inventory cost (Q1665650) (← links)
• A node current-based 2-index formulation for the fixed-destination multi-depot travelling salesman problem (Q1681265) (← links)
• Multi-trip pickup and delivery problem with time windows and synchronization (Q1695786) (← links)
• Optimization of vehicle routing with pickup based on multibatch production (Q1727038) (← links)
• Pickup and delivery problem with time windows: a new compact two-index formulation (Q1728253) (← links)
• A lexicographic approach for the bi-objective selective pickup and delivery problem with time windows and paired demands (Q1730662) (← links)
• Dynamic courier routing for a food delivery service (Q1738833) (← links)
• Feasibility recovery for the unit-capacity constrained permutation problem (Q1751174) (← links)
• Moving products between location pairs: cross-docking versus direct-shipping (Q1752263) (← links)
• The unit-capacity constrained permutation problem (Q1754340) (← links)
• Scatter search for the stochastic travel-time vehicle routing problem with simultaneous pick-ups and deliveries (Q1761164) (← links)
• A GRASP with adaptive large neighborhood search for pickup and delivery problems with transshipment (Q1761180) (← links)