Pages that link to "Item:Q4836837"

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

Displaying 50 items.

• 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)
• A comparison of two meta-heuristics for the pickup and delivery problem with transshipment (Q1782171) (← links)
• Taxi-sharing: parameterized complexity and approximability of the dial-a-ride problem with money as an incentive (Q1786606) (← links)
• An efficient genetic algorithm for the traveling salesman problem with precedence constraints (Q1848588) (← links)
• Routing problems: A bibliography (Q1908308) (← links)
• A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem (Q1926735) (← links)
• A column generation approach for location-routing problems with pickup and delivery (Q1991113) (← links)
• An on-demand same-day delivery service using direct peer-to-peer transshipment strategies (Q2005834) (← links)
• Pickup and delivery problem with recharging for material handling systems utilising autonomous mobile robots (Q2029292) (← links)
• Preemptive stacker crane problem: extending tree-based properties and construction heuristics (Q2030604) (← links)
• A grouping genetic algorithm for multi depot pickup and delivery problems with time windows and heterogeneous vehicle fleets (Q2057127) (← links)
• Van-based robot hybrid pickup and delivery routing problem (Q2076867) (← links)
• Time window optimization for attended home service delivery under multiple sources of uncertainties (Q2108142) (← links)
• A dynamic tree algorithm for peer-to-peer ridesharing matching (Q2129373) (← links)
• The pickup and delivery problem with alternative locations and overlapping time windows (Q2147021) (← links)
• A hybrid algorithm for the vehicle routing problem with and/or precedence constraints and time windows (Q2147032) (← links)
• Using decomposition-based multi-objective algorithm to solve selective pickup and delivery problems with time windows (Q2147164) (← links)
• Cargo routing and scheduling problem in deep-sea transportation: case study from a fertilizer company (Q2177829) (← links)
• Optimization for dynamic ride-sharing: a review (Q2253345) (← links)
• New mixed integer-programming model for the pickup-and-delivery problem with transshipment (Q2256318) (← links)
• Industrial aspects and literature survey: Combined inventory management and routing (Q2270436) (← links)
• An optimization-driven dynamic vehicle routing algorithm for on-demand meal delivery using drones (Q2273650) (← links)
• Recovery management for a dial-a-ride system with real-time disruptions (Q2327632) (← links)
• An iterative graph expansion approach for the scheduling and routing of airplanes (Q2337398) (← links)
• The paired many-to-many pickup and delivery problem: an application (Q2343076) (← links)
• Designing vehicle routes for a mix of different request types, under time windows and loading constraints (Q2355860) (← links)
• Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care (Q2356017) (← links)
• A truck scheduling problem arising in intermodal container transportation (Q2356036) (← links)
• Workforce routing and scheduling for electricity network maintenance with downtime minimization (Q2356225) (← links)
• Fleet routing position-based model for inventory pickup under production shutdown (Q2356283) (← links)
• An algorithm for the one commodity pickup and delivery traveling salesman problem with restricted depot (Q2357926) (← links)
• A hybrid heuristic approach for the multi-commodity one-to-one pickup-and-delivery traveling salesman problem (Q2359136) (← links)
• The multi-vehicle profitable pickup and delivery problem (Q2362250) (← links)
• A new insertion-based construction heuristic for solving the pickup and delivery problem with time windows (Q2433432) (← links)
• Mobility allowance shuttle transit (MAST) services: MIP formulation and strengthening with logic constraints (Q2455613) (← links)
• Steiner diagrams and \(k\)-star hubs (Q2466026) (← links)
• Vehicle routing problems with simultaneous pick-up and delivery service. (Q2467847) (← links)
• A new algorithm for finding the shortest paths using PCNNs (Q2477251) (← links)
• Indirect search for the vehicle routing problem with pickup and delivery and time windows (Q2480796) (← links)
• A columnar competitive model for solving multi-traveling salesman problem (Q2482590) (← links)
• Hybrid adaptive predictive control for the multi-vehicle dynamic pick-up and delivery problem based on genetic algorithms and fuzzy clustering (Q2483486) (← links)
• Dynamic optimization of the operation of single-car elevator systems with destination hall call registration. II: The solution algorithm (Q2485348) (← links)
• A generic view of Dantzig--Wolfe decomposition in mixed integer programming (Q2494825) (← links)
• A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service (Q2566927) (← links)
• A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows (Q2571182) (← links)
• Fast local search algorithms for the handicapped persons transportation problem (Q2573013) (← links)
• Survey of research in the design and control of automated guided vehicle systems (Q2575559) (← links)
• A review of design and control of automated guided vehicle systems (Q2576242) (← links)