The multi-vehicle profitable pickup and delivery problem

DOI10.1007/S00291-016-0454-YMaRDI QIDQ2362250zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Margaretha Gansterer, Murat Küçüktepe, Richard F. Hartl

Publication date 6 July 2017

Published in OR Spectrum (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s00291-016-0454-y

zbMATH Keywords

metaheuristicspickup and deliveryprofitable tour problem

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Making the most of fleets: a profit-maximizing multi-vehicle pickup and delivery selection problem
• A selective adaptive large neighborhood search heuristic for the profitable tour problem with simultaneous pickup and delivery services
• The multi-pickup and delivery problem with time windows
• A pick-up and delivery problem for logistics e-marketplace services
• The single vehicle routing problem with deliveries and selective pickups

Cites work

• A branch-and-cut algorithm for the capacitated profitable tour problem
• A branch-and-cut-and-price approach for the pickup and delivery problem with shuttle routes
• A collaborative planning approach for intermodal freight transportation
• A general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem
• A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem
• A guided local search metaheuristic for the team orienteering problem
• A heuristic algorithm for the truckload and less-than-truckload problem
• A heuristic for the multiple tour maximum collection problem
• A method for solving traveling-salesman problems
• A multi-commodity, capacitated pickup and delivery problem: the single and two-vehicle cases
• A path relinking approach for the team orienteering problem
• A perturbation metaheuristic for the vehicle routing problem with private fleet and common carriers
• A simulated annealing heuristic for the team orienteering problem with time windows
• A TABU search heuristic for the team orienteering problem
• Adaptive large neighborhood search for the pickup and delivery problem with time windows, profits, and reserved requests
• Addendum to ``Heuristics for the multi-period orienteering problem with multiple time windows
• An exact algorithm for team orienteering problems
• An iterative three-component heuristic for the team orienteering problem with time windows
• Approximating the asymmetric profitable tour
• Benchmark Suite for Industrial and Tramp Ship Routing and Scheduling Problems
• Collaborating freight forwarding enterprises
• Dynamic pickup and delivery problems
• Horizontal cooperation among freight carriers: request allocation and profit sharing
• Iterated local search for the team orienteering problem with time windows
• New mixed integer-programming model for the pickup-and-delivery problem with transshipment
• Optimal solutions for routing problems with profits
• Rich vehicle routing problems: from a taxonomy to a definition
• Shipper collaboration
• Solving a vehicle-routing problem arising in soft-drink distribution
• Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
• The capacitated team orienteering and profitable tour problems
• The General Pickup and Delivery Problem
• The selective travelling salesman problem
• The single vehicle routing problem with deliveries and selective pickups
• The team orienteering problem
• The team orienteering problem with time windows: an LP-based granular variable neighborhood search
• The vehicle routing problem
• Variable neighborhood search
• Variable neighborhood search for the dial-a-ride problem
• Variable neighbourhood search: Methods and applications
• Vehicle Routing

Cited in

(15)

• Solving a selective dial-a-ride problem with logic-based Benders decomposition
• A profit-maximization location-routing-pricing problem: a branch-and-price algorithm
• Optimization of vehicle routing with pickup based on multibatch production
• Making the most of fleets: a profit-maximizing multi-vehicle pickup and delivery selection problem
• Exact solutions for the collaborative pickup and delivery problem
• The collaborative consistent vehicle routing problem with workload balance
• A pick-up and delivery problem for logistics e-marketplace services
• Mixed-integer linear optimization for full truckload pickup and delivery
• Using decomposition-based multi-objective algorithm to solve selective pickup and delivery problems with time windows
• EFFICIENT NEIGHBORHOOD SEARCH FOR THE PROBABILISTIC MULTI-VEHICLE PICKUP AND DELIVERY PROBLEM
• A selective adaptive large neighborhood search heuristic for the profitable tour problem with simultaneous pickup and delivery services
• Delivery systems with crowd‐sourced drivers: A pickup and delivery problem with transfers
• Route efficiency implications of time windows and vehicle capacities in first- and last-mile logistics
• Integrating shift planning and pick-up and delivery problems under limited Courier availability
• A novel robust decomposition algorithm for a profit-oriented production routing problem with backordering, uncertain prices, and service level constraints

Describes a project that uses

Uses Software

• VRP

This page was built for publication: The multi-vehicle profitable pickup and delivery problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2362250)