The multi-pickup and delivery problem with time windows

DOI10.1016/J.EJOR.2018.01.035MaRDI QIDQ1744529zbMATH OpenOpenAlexFDO

Authors Salma Naccache, Jean-François Côté, Leandro C. Coelho

Publication date 23 April 2018

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

Full work available at URL https://doi.org/10.1016/j.ejor.2018.01.035

zbMATH Keywords

multi-pickup and delivery problemsequential ordering problemvehicle routing problem

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06)

Recommendations

• The pickup and delivery problem with time windows
• Multi-trip pickup and delivery problem with time windows and synchronization
• Exact algorithms for the multi-pickup and delivery problem with time windows
• The pickup and delivery problem with time windows and handling operations
• The Pickup And Delivery Problem With Time Windows And Transshipment
• The pickup and delivery problem with time windows, multiple stacks, and handling operations
• The pickup and delivery problem with alternative locations and overlapping time windows
• The pickup and delivery problem with time windows and scheduled lines
• The pickup and delivery problem with time windows and occasional drivers
• Generalised pickup and delivery problem with dynamic time windows

Cites work

• A branch \& cut algorithm for the asymmetric traveling salesman problem with precedence constraints
• A general heuristic for vehicle routing problems
• A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times
• A hybrid method for the probabilistic maximal covering location-allocation problem
• A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery
• A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery
• An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization
• An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics
• An efficient implementation of local search algorithms for constrained routing problems
• An exact algorithm for the pickup and delivery problem with time windows
• An inexact algorithm for the sequential ordering problem
• scientific article; zbMATH DE number 2013522 (Why is no real title available?)
• scientific article; zbMATH DE number 1749228 (Why is no real title available?)
• Hybrid algorithms for the vehicle routing problem with clustered backhauls and 3D loading constraints
• Load-dependent and precedence-based models for pickup and delivery problems
• Local search procedures for improving feasible solutions to the sequential ordering problem
• Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
• On dual based lower bounds for the sequential ordering problem with precedences and due dates
• Road-based goods transportation: a survey of real-world logistics applications from 2000 to 2015
• Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
• Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem
• The inventory-routing problem with transshipment
• The multi-commodity one-to-one pickup-and-delivery traveling salesman problem
• The precedence-constrained asymmetric traveling salesman polytope
• Vehicle Routing

Cited in

(34)

• A multi-depot pickup and delivery problem with a single hub and heterogeneous vehicles
• Multi-trip pickup and delivery problem with time windows and synchronization
• Capacitated vehicle routing problem with pick-up and alternative delivery (CVRPPAD): model and implementation using hybrid approach
• Models and algorithms for the delivery and installation routing problem
• A two-stage hybrid heuristic solution for the container drayage problem with trailer reposition
• The pickup and delivery problem with alternative locations and overlapping time windows
• Using decomposition-based multi-objective algorithm to solve selective pickup and delivery problems with time windows
• Exact algorithms for the multi-pickup and delivery problem with time windows
• The multi-vehicle profitable pickup and delivery problem
• A hybrid adaptive large neighborhood search heuristic for the team orienteering problem
• A study on the pickup and delivery problem with time windows: matheuristics and new instances
• A survey of adaptive large neighborhood search algorithms and applications
• The team orienteering pick-up and delivery problem with time windows and its applications in fleet sizing
• Adaptive large neighborhood search for the pickup and delivery problem with time windows, profits, and reserved requests
• Pickup and Delivery of Partial Loads with “Soft” Time Windows
• The delivery man problem with time windows
• Multidepot pickup and delivery problems in multiple regions: a typology and integrated model
• Exact and heuristic methods for a full-load, multi-terminal, vehicle scheduling problem with backhauling and time windows
• A decomposition approach for commodity pickup and delivery with time-windows under uncertainty
• scientific article; zbMATH DE number 7267210 (Why is no real title available?)
• A combined approach to solve the pickup and delivery selection problem
• Computational Science – ICCS 2005
• The Pickup And Delivery Problem With Time Windows And Transshipment
• Covering delivery problem with electric vehicle and parcel lockers: variable neighborhood search approach
• Waiting and Buffering Strategies for the Dynamic Pickup and Delivery Problem with Time Windows
• Branch and price algorithm for route optimization on customized bus service
• Operations optimization for third-party e-grocery platforms
• A multicommodity pickup and delivery problem with time windows and handling time in the omni-channel last-mile delivery
• Stochastic scheduling and routing decisions in online meal delivery platforms with mixed force
• A vehicle routing problem with pickup and delivery time windows, and coordination of transportable resources
• A memory-enhanced greedy randomized adaptive search procedure for the multi-pickup and delivery problem with time windows
• Supermarket-chain grocery delivery optimization through courier coordination
• Pickup and delivery with time windows and two-dimensional loading for shipbuilding block transportation
• Generalised pickup and delivery problem with dynamic time windows

Describes a project that uses

Uses Software

• VRP

This page was built for publication: The multi-pickup and delivery problem with time windows

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