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

DOI10.1016/J.EJOR.2016.10.010MaRDI QIDQ1751783zbMATH OpenOpenAlexFDO

Authors Xiaoqiu Qiu, Stefan Feuerriegel, Dirk Neumann

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

branch and bounddecision support systemsheuristicslogisticstransportation

Mathematics Subject Classification ID

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

Recommendations

• The multi-vehicle profitable pickup and delivery problem
• A selective adaptive large neighborhood search heuristic for the profitable tour problem with simultaneous pickup and delivery services
• A combined approach to solve the pickup and delivery selection problem
• The single vehicle routing problem with deliveries and selective pickups
• A pick-up and delivery problem for logistics e-marketplace services

Cites work

• A branch-and-cut-and-price approach for the pickup and delivery problem with shuttle routes
• A branch-and-price algorithm for the vehicle routing problem with deliveries, selective pickups and time windows
• A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem
• A general vehicle routing problem
• A heuristic for the Stacker Crane Problem on trees which is almost surely exact
• A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows
• A Primer in Column Generation
• An adaptive insertion algorithm for the single-vehicle dial-a-ride problem with narrow time windows
• An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading
• An efficient column-generation-based algorithm for solving a pickup-and-delivery problem
• An exact algorithm for the pickup and delivery problem with time windows
• Asymptotically Optimal Algorithms for One-to-One Pickup and Delivery Problems With Applications to Transportation Systems
• Combinatorial auctions. Foreword by Vernon L. Smith.
• Dynamic programming-based column generation on time-expanded networks: application to the dial-a-flight problem
• scientific article; zbMATH DE number 2130496 (Why is no real title available?)
• Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints
• Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
• The attractive traveling salesman problem
• The dial-a-ride problem: Models and algorithms
• The multi-commodity one-to-one pickup-and-delivery traveling salesman problem
• The multi-commodity one-to-one pickup-and-delivery traveling salesman problem: A matheuristic
• The multi-commodity pickup-and-delivery traveling salesman problem
• The one‐commodity pickup‐and‐delivery traveling salesman problem: Inequalities and algorithms
• The orienteering problem: a survey
• The single vehicle routing problem with deliveries and selective pickups
• The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm
• The vehicle routing problem

Cited in

(8)

• Solving a selective dial-a-ride problem with logic-based Benders decomposition
• Optimization of vehicle routing with pickup based on multibatch production
• A pick-up and delivery problem for logistics e-marketplace services
• The multi-vehicle profitable pickup and delivery problem
• A selective adaptive large neighborhood search heuristic for the profitable tour problem with simultaneous pickup and delivery services
• Branch and price algorithm for route optimization on customized bus service
• Integrating shift planning and pick-up and delivery problems under limited Courier availability
• Data-driven dynamic police patrolling: an efficient Monte Carlo tree search

Describes a project that uses

Uses Software

• Gurobi
• VRP

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

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