Making the most of fleets: a profit-maximizing multi-vehicle pickup and delivery selection problem

DOI10.1016/j.ejor.2016.10.010zbMath1394.90124OpenAlexW2530927020MaRDI QIDQ1751783

Dirk Neumann, Stefan Feuerriegel, Xiaoqiu Qiu

Publication date: 25 May 2018

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/20.500.11850/182391

zbMATH Keywords

decision support systemsheuristicstransportationbranch and boundlogistics

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (2)

Solving a selective dial-a-ride problem with logic-based Benders decomposition ⋮ A selective adaptive large neighborhood search heuristic for the profitable tour problem with simultaneous pickup and delivery services

Uses Software

• Gurobi
• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows
• Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints
• An efficient column-generation-based algorithm for solving a pickup-and-delivery problem
• The orienteering problem: a survey
• An adaptive insertion algorithm for the single-vehicle dial-a-ride problem with narrow time windows
• The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm
• A general vehicle routing problem
• A branch-and-price algorithm for the vehicle routing problem with deliveries, selective pickups and time windows
• The multi-commodity one-to-one pickup-and-delivery traveling salesman problem
• The attractive traveling salesman problem
• A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem
• The single vehicle routing problem with deliveries and selective pickups
• The dial-a-ride problem: Models and algorithms
• 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)
• The Vehicle Routing Problem
• The multi-commodity pickup-and-delivery traveling salesman problem
• Dynamic Programming-Based Column Generation on Time-Expanded Networks: Application to the Dial-a-Flight Problem
• The Multi-Commodity One-to-One Pickup-and-Delivery Traveling Salesman Problem: A Matheuristic
• An Exact Algorithm for the Pickup and Delivery Problem with Time Windows
• A heuristic for the Stacker Crane Problem on trees which is almost surely exact
• Asymptotically Optimal Algorithms for One-to-One Pickup and Delivery Problems With Applications to Transportation Systems
• The one‐commodity pickup‐and‐delivery traveling salesman problem: Inequalities and algorithms
• A Primer in Column Generation
• An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading

This page was built for publication: Making the most of fleets: a profit-maximizing multi-vehicle pickup and delivery selection problem