Pages that link to "Item:Q1744529"

The following pages link to The multi-pickup and delivery problem with time windows (Q1744529):

Displaying 29 items.

• Adaptive large neighborhood search for the pickup and delivery problem with time windows, profits, and reserved requests (Q322826) (← links)
• The delivery man problem with time windows (Q429673) (← links)
• A decomposition approach for commodity pickup and delivery with time-windows under uncertainty (Q490359) (← links)
• A vehicle routing problem with pickup and delivery time windows, and coordination of transportable resources (Q716354) (← links)
• Generalised pickup and delivery problem with dynamic time windows (Q973446) (← links)
• A multi-depot pickup and delivery problem with a single hub and heterogeneous vehicles (Q1582189) (← links)
• Multi-trip pickup and delivery problem with time windows and synchronization (Q1695786) (← links)
• Capacitated vehicle routing problem with pick-up and alternative delivery (CVRPPAD): model and implementation using hybrid approach (Q1730665) (← links)
• Models and algorithms for the delivery and installation routing problem (Q2029957) (← links)
• A two-stage hybrid heuristic solution for the container drayage problem with trailer reposition (Q2077914) (← links)
• The pickup and delivery problem with alternative locations and overlapping time windows (Q2147021) (← links)
• Using decomposition-based multi-objective algorithm to solve selective pickup and delivery problems with time windows (Q2147164) (← links)
• Exact algorithms for the multi-pickup and delivery problem with time windows (Q2178121) (← links)
• The multi-vehicle profitable pickup and delivery problem (Q2362250) (← links)
• A hybrid adaptive large neighborhood search heuristic for the team orienteering problem (Q2664363) (← links)
• A study on the pickup and delivery problem with time windows: matheuristics and new instances (Q2664415) (← links)
• A survey of adaptive large neighborhood search algorithms and applications (Q2676311) (← links)
• The team orienteering pick-up and delivery problem with time windows and its applications in fleet sizing (Q2826662) (← links)
• Pickup and Delivery of Partial Loads with “Soft” Time Windows (Q3771948) (← links)
• Multidepot pickup and delivery problems in multiple regions: a typology and integrated model (Q4642119) (← links)
• Exact and heuristic methods for a full-load, multi-terminal, vehicle scheduling problem with backhauling and time windows (Q4678239) (← links)
• (Q5128116) (← links)
• Computational Science – ICCS 2005 (Q5709620) (← links)
• The Pickup And Delivery Problem With Time Windows And Transshipment (Q6043232) (← links)
• Covering delivery problem with electric vehicle and parcel lockers: variable neighborhood search approach (Q6106570) (← links)
• Waiting and Buffering Strategies for the Dynamic Pickup and Delivery Problem with Time Windows (Q6160362) (← links)
• Branch and price algorithm for route optimization on customized bus service (Q6546992) (← links)
• Operations optimization for third-party e-grocery platforms (Q6596982) (← links)
• A multicommodity pickup and delivery problem with time windows and handling time in the omni-channel last-mile delivery (Q6659827) (← links)