The multi-pickup and delivery problem with time windows
From MaRDI portal
Publication:1744529
DOI10.1016/J.EJOR.2018.01.035zbMATH Open1431.90021OpenAlexW2790850281MaRDI QIDQ1744529FDOQ1744529
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
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
- An inexact algorithm for the sequential ordering problem
- A general heuristic for vehicle routing problems
- A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery
- The multi-commodity one-to-one pickup-and-delivery traveling salesman problem
- The inventory-routing problem with transshipment
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
- An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics
- Title not available (Why is that?)
- A branch \& cut algorithm for the asymmetric traveling salesman problem with precedence constraints
- Vehicle Routing
- An exact algorithm for the pickup and delivery problem with time windows
- Hybrid algorithms for the vehicle routing problem with clustered backhauls and 3D loading constraints
- Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
- A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery
- The precedence-constrained asymmetric traveling salesman polytope
- Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem
- An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization
- Load-dependent and precedence-based models for pickup and delivery problems
- Road-based goods transportation: a survey of real-world logistics applications from 2000 to 2015
- A hybrid method for the probabilistic maximal covering location-allocation problem
- A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times
- An efficient implementation of local search algorithms for constrained routing problems
- Title not available (Why is that?)
- On dual based lower bounds for the sequential ordering problem with precedences and due dates
- Local search procedures for improving feasible solutions to the sequential ordering problem
Cited In (30)
- Computational Science – ICCS 2005
- Using decomposition-based multi-objective algorithm to solve selective pickup and delivery problems with time windows
- Generalised pickup and delivery problem with dynamic time windows
- Title not available (Why is that?)
- A study on the pickup and delivery problem with time windows: matheuristics and new instances
- Models and algorithms for the delivery and installation routing problem
- A vehicle routing problem with pickup and delivery time windows, and coordination of transportable resources
- Operations optimization for third-party e-grocery platforms
- Multi-trip pickup and delivery problem with time windows and synchronization
- Exact algorithms for the multi-pickup and delivery problem with time windows
- Adaptive large neighborhood search for the pickup and delivery problem with time windows, profits, and reserved requests
- A survey of adaptive large neighborhood search algorithms and applications
- The delivery man problem with time windows
- The pickup and delivery problem with alternative locations and overlapping time windows
- The Pickup And Delivery Problem With Time Windows And Transshipment
- The multi-vehicle profitable pickup and delivery problem
- Waiting and Buffering Strategies for the Dynamic Pickup and Delivery Problem with Time Windows
- A hybrid adaptive large neighborhood search heuristic for the team orienteering problem
- A decomposition approach for commodity pickup and delivery with time-windows under uncertainty
- Pickup and Delivery of Partial Loads with “Soft” Time Windows
- The team orienteering pick-up and delivery problem with time windows and its applications in fleet sizing
- A multi-depot pickup and delivery problem with a single hub and heterogeneous vehicles
- A multicommodity pickup and delivery problem with time windows and handling time in the omni-channel last-mile delivery
- Covering delivery problem with electric vehicle and parcel lockers: variable neighborhood search approach
- A two-stage hybrid heuristic solution for the container drayage problem with trailer reposition
- Multidepot pickup and delivery problems in multiple regions: a typology and integrated model
- Branch and price algorithm for route optimization on customized bus service
- Capacitated vehicle routing problem with pick-up and alternative delivery (CVRPPAD): model and implementation using hybrid approach
- A combined approach to solve the pickup and delivery selection problem
- Exact and heuristic methods for a full-load, multi-terminal, vehicle scheduling problem with backhauling and time windows
Uses Software
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)
