The multi-vehicle profitable pickup and delivery problem

DOI10.1007/s00291-016-0454-yzbMath1371.90024OpenAlexW2466673901WikidataQ59389553 ScholiaQ59389553MaRDI QIDQ2362250

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

Publication date: 6 July 2017

Published in: OR Spectrum (Search for Journal in Brave)

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)

Related Items (8)

Using decomposition-based multi-objective algorithm to solve selective pickup and delivery problems with time windows ⋮ Solving a selective dial-a-ride problem with logic-based Benders decomposition ⋮ A profit-maximization location-routing-pricing problem: a branch-and-price algorithm ⋮ Route efficiency implications of time windows and vehicle capacities in first- and last-mile logistics ⋮ A selective adaptive large neighborhood search heuristic for the profitable tour problem with simultaneous pickup and delivery services ⋮ The collaborative consistent vehicle routing problem with workload balance ⋮ Exact solutions for the collaborative pickup and delivery problem ⋮ A pick-up and delivery problem for logistics e-marketplace services

Uses Software

• VRP

Cites Work

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

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