Pages that link to "Item:Q1388930"

The following pages link to A new extension of local search applied to the Dial-A-Ride problem (Q1388930):

Displaying 25 items.

• Integrating stochastic time-dependent travel speed in solution methods for the dynamic dial-a-ride problem (Q296680) (← links)
• Hybrid column generation and large neighborhood search for the dial-a-ride problem (Q339608) (← links)
• The tree representation for the pickup and delivery traveling salesman problem with LIFO loading (Q421561) (← links)
• Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports (Q547122) (← links)
• Local search heuristics for the probabilistic dial-a-ride problem (Q657055) (← links)
• The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm (Q847836) (← links)
• The single vehicle pickup and delivery problem with time windows: Intelligent operators for heuristic and metaheuristic algorithms (Q972640) (← links)
• The pickup and delivery traveling salesman problem with first-in-first-out loading (Q1000960) (← links)
• The multi-commodity one-to-one pickup-and-delivery traveling salesman problem (Q1041945) (← links)
• Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading (Q1046716) (← links)
• A heuristic for the pickup and delivery traveling salesman problem (Q1571039) (← links)
• Perturbation heuristics for the pickup and delivery traveling salesman problem (Q1603311) (← links)
• An efficient implementation of a static move descriptor-based local search heuristic (Q1652594) (← links)
• Typology and literature review for dial-a-ride problems (Q1698288) (← links)
• The pickup and delivery traveling salesman problem with handling costs (Q1752776) (← links)
• Metaheuristics: A bibliography (Q1919858) (← links)
• Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints (Q1926986) (← links)
• Comparison of anticipatory algorithms for a dial-a-ride problem (Q2140208) (← links)
• Pricing and allocation algorithm designs in dynamic ridesharing system (Q2283011) (← links)
• Optimal charging and repositioning of electric vehicles in a free-floating carsharing system (Q2333127) (← links)
• A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem (Q2433528) (← links)
• The study of a dynamic dial-a-ride problem under time-dependent and stochastic environments (Q2455616) (← links)
• A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints (Q2503082) (← links)
• EFFICIENT NEIGHBORHOOD SEARCH FOR THE PROBABILISTIC MULTI-VEHICLE PICKUP AND DELIVERY PROBLEM (Q3580197) (← links)
• An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading (Q6160334) (← links)