The General Pickup and Delivery Problem
From MaRDI portal
Publication:4836837
DOI10.1287/trsc.29.1.17zbMath0826.90049OpenAlexW2063659595MaRDI QIDQ4836837
Savelsbergh, Martin W. P., Marc Sol
Publication date: 21 June 1995
Published in: Transportation Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/trsc.29.1.17
Related Items
Heuristics for electric taxi fleet management at Teo Taxi, A near-exact method for solving the log-truck scheduling problem, Performance evaluation of dynamic scheduling approaches in vehicle-based internal transport systems, Synchronizing transportation of people with reduced mobility through airport terminals, Adaptive neighborhood simulated annealing for the heterogeneous fleet vehicle routing problem with multiple cross-docks, A multi-tiered vehicle routing problem with global cross-docking, A column generation and combinatorial Benders decomposition algorithm for the selective dial-a-ride-problem, An integrated ride-matching and vehicle-rebalancing model for shared mobility on-demand services, New valid inequalities for the symmetric vehicle routing problem with simultaneous pickup and deliveries, Optimal routing of multimodal mobility systems with ride‐sharing, A variable neighborhood search heuristic algorithm for the double vehicle routing problem with multiple stacks, Diagnosis of intermittent faults in multi-agent systems: an SFL approach, Delivery systems with crowd‐sourced drivers: A pickup and delivery problem with transfers, Waiting and Buffering Strategies for the Dynamic Pickup and Delivery Problem with Time Windows, Route efficiency implications of time windows and vehicle capacities in first- and last-mile logistics, Solving a pickup and delivery routing problem for fourth‐party logistics providers, EFFICIENT NEIGHBORHOOD SEARCH FOR THE PROBABILISTIC MULTI-VEHICLE PICKUP AND DELIVERY PROBLEM, A solution approach for log truck scheduling based on composite pricing and branch and bound, Unnamed Item, A heuristic two-phase solution approach for the multi-objective dial-a-ride problem, A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading, Strong Coalitional Structure in an Open Vehicle Routing Game, On-line single-server dial-a-ride problems, Distribution of waiting time for dynamic pickup and delivery problems, Extension and Application of a General Pickup and Delivery Model for Evaluating the Impact of Bundling Goods in an Urban Environment, The multi-commodity pickup-and-delivery traveling salesman problem, Using Logic-Based Benders Decomposition to Solve the Capacity- and Distance-Constrained Plant Location Problem, An MDD-Based Lagrangian Approach to the Multicommodity Pickup-and-Delivery TSP, Sequential Resource Allocation for Nonprofit Operations, An algorithm for the one commodity pickup and delivery traveling salesman problem with restricted depot, A hybrid heuristic approach for the multi-commodity one-to-one pickup-and-delivery traveling salesman problem, The multi-vehicle profitable pickup and delivery problem, A dynamic tree algorithm for peer-to-peer ridesharing matching, Heuristics for routes generation in pickup and delivery problem, Mathematical formulations for a 1-full-truckload pickup-and-delivery problem, Alternative approaches to the crude oil tanker routing and scheduling problem with split pickup and split delivery, The pickup and delivery problem with alternative locations and overlapping time windows, A hybrid algorithm for the vehicle routing problem with and/or precedence constraints and time windows, Using decomposition-based multi-objective algorithm to solve selective pickup and delivery problems with time windows, Reverse logistics: simultaneous design of delivery routes and returns strategies, Coordinating technician allocation and maintenance routing for offshore wind farms, An effective and fast heuristic for the dial-a-ride problem, Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder), A traveling salesman problem with pickups and deliveries, time windows and draft limits: case study from chemical shipping, The pickup and delivery problem with time windows and handling operations, Non-myopic vehicle and route selection in dynamic DARP with travel time and workload objectives, History-dependent scheduling: models and algorithms for scheduling with general precedence and sequence dependence, An approximation algorithm for the pickup and delivery vehicle routing problem on trees, Routing problems: A bibliography, The pickup and delivery problem: Faces and branch-and-cut algorithm, A two-stage simulated annealing algorithm for the many-to-many milk-run routing problem with pipeline inventory cost, Improved modeling and solution methods for the multi-resource routing problem, Quota travelling salesman problem with passengers, incomplete ride and collection time optimization by ant-based algorithms, A study on the pickup and delivery problem with time windows: matheuristics and new instances, Cargo routing and scheduling problem in deep-sea transportation: case study from a fertilizer company, An insertion heuristic for scheduling mobility allowance shuttle transit (MAST) services, A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem, A node current-based 2-index formulation for the fixed-destination multi-depot travelling salesman problem, A branch-and-price algorithm for the multi-depot heterogeneous-fleet pickup and delivery problem with soft time windows, Heuristic and exact algorithms for a min-max selective vehicle routing problem, Multi-trip pickup and delivery problem with time windows and synchronization, Models for the single-vehicle preemptive pickup and delivery problem, A lookahead partitioning heuristic for a new assignment and scheduling problem in a distribution system, New savings based algorithms for time constrained pickup and delivery of full truckloads., A new insertion-based construction heuristic for solving the pickup and delivery problem with time windows, On the complexity of the Eulerian closed walk with precedence path constraints problem, Operational planning of a large-scale multi-modal transportation system., Local search heuristics for the probabilistic dial-a-ride problem, Optimization of vehicle routing with pickup based on multibatch production, Pickup and delivery problem with time windows: a new compact two-index formulation, A general vehicle routing problem, A lexicographic approach for the bi-objective selective pickup and delivery problem with time windows and paired demands, Mobility allowance shuttle transit (MAST) services: MIP formulation and strengthening with logic constraints, Real-time split-delivery pickup and delivery time window problems with transfers, A multi-stop routing problem, Dynamic courier routing for a food delivery service, Steiner diagrams and \(k\)-star hubs, Vehicle routing problems with simultaneous pick-up and delivery service., A column generation approach for location-routing problems with pickup and delivery, Feasibility recovery for the unit-capacity constrained permutation problem, Moving products between location pairs: cross-docking versus direct-shipping, The unit-capacity constrained permutation problem, A new algorithm for finding the shortest paths using PCNNs, A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem, Optimization for dynamic ride-sharing: a review, Indirect search for the vehicle routing problem with pickup and delivery and time windows, A columnar competitive model for solving multi-traveling salesman problem, New mixed integer-programming model for the pickup-and-delivery problem with transshipment, Scatter search for the stochastic travel-time vehicle routing problem with simultaneous pick-ups and deliveries, A GRASP with adaptive large neighborhood search for pickup and delivery problems with transshipment, Hybrid adaptive predictive control for the multi-vehicle dynamic pick-up and delivery problem based on genetic algorithms and fuzzy clustering, An on-demand same-day delivery service using direct peer-to-peer transshipment strategies, Dynamic optimization of the operation of single-car elevator systems with destination hall call registration. II: The solution algorithm, The directed orienteering problem, The single vehicle pickup and delivery problem with time windows: Intelligent operators for heuristic and metaheuristic algorithms, Operative transportation planning in consumer goods supply chains, A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery, Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries, A generic view of Dantzig--Wolfe decomposition in mixed integer programming, Industrial aspects and literature survey: Combined inventory management and routing, An optimization-driven dynamic vehicle routing algorithm for on-demand meal delivery using drones, A branch-and-price algorithm for placement routing for a multi-head beam-type component placement tool, Pickup and delivery problem with recharging for material handling systems utilising autonomous mobile robots, Taxi-sharing: parameterized complexity and approximability of the dial-a-ride problem with money as an incentive, Preemptive stacker crane problem: extending tree-based properties and construction heuristics, A local search heuristic for the pre- and end-haulage of intermodal container terminals, A grouping genetic algorithm for multi depot pickup and delivery problems with time windows and heterogeneous vehicle fleets, The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches, A heuristic for the pickup and delivery traveling salesman problem, Van-based robot hybrid pickup and delivery routing problem, Recovery management for a dial-a-ride system with real-time disruptions, The pickup and delivery problem with transfers: formulation and a branch-and-cut solution method, Real-time control of freight forwarder transportation networks by integrating multimodal transport chains, A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service, Planning models for long-haul operations of postal and express shipment companies, A multi-depot pickup and delivery problem with a single hub and heterogeneous vehicles, A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows, Fast local search algorithms for the handicapped persons transportation problem, An efficient genetic algorithm for the traveling salesman problem with precedence constraints, An iterative graph expansion approach for the scheduling and routing of airplanes, Survey of research in the design and control of automated guided vehicle systems, A review of design and control of automated guided vehicle systems, Time window optimization for attended home service delivery under multiple sources of uncertainties, Perturbation heuristics for the pickup and delivery traveling salesman problem, Designing vehicle routes for a mix of different request types, under time windows and loading constraints, Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care, A truck scheduling problem arising in intermodal container transportation, Workforce routing and scheduling for electricity network maintenance with downtime minimization, Fleet routing position-based model for inventory pickup under production shutdown
