Using decomposition-based multi-objective algorithm to solve selective pickup and delivery problems with time windows
DOI10.1016/J.COR.2022.105867OpenAlexW4280564599MaRDI QIDQ2147164FDOQ2147164
Authors: Asma Ben-Said, A. Moukrim, Rym Nesrine Guibadj, Jérôme Verny 
Publication date: 22 June 2022
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2022.105867
Recommendations
- A lexicographic approach for the bi-objective selective pickup and delivery problem with time windows and paired demands
- A decomposition based memetic algorithm for multi-objective vehicle routing problem with time windows
- A branch-and-price algorithm for the vehicle routing problem with deliveries, selective pickups and time windows
- The multi-pickup and delivery problem with time windows
- An improved ant colony algorithm for multi-objective vehicle routing problem with simultaneous pickup and delivery
multi-objective optimizationmeta-heuristicsdecomposition algorithmPareto local searchselective pickup and delivery problem
Cites Work
- The pickup and delivery problem with time windows
- Title not available (Why is that?)
- Nonlinear multiobjective optimization
- Multi-objective optimization using evolutionary algorithms
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- Design and analysis of stochastic local search for the multiobjective traveling salesman problem
- Two-phase Pareto local search for the biobjective traveling salesman problem
- The Vehicle Routing Problem with Time Windows Part I: Tabu Search
- A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems
- A discussion of scalarization techniques for multiple objective integer programming
- Multi-objective vehicle routing problems
- The General Pickup and Delivery Problem
- On spanning tree problems with multiple objectives
- Anytime Pareto local search
- Title not available (Why is that?)
- A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows
- Adaptive large neighborhood search for the pickup and delivery problem with time windows, profits, and reserved requests
- Typology and literature review for dial-a-ride problems
- The multi-pickup and delivery problem with time windows
- The pickup and delivery problem with time windows and occasional drivers
- A heuristic algorithm for the asymmetric capacitated vehicle routing problem
- A study on the pickup and delivery problem with time windows: matheuristics and new instances
- Perturbed decomposition algorithm applied to the multi-objective traveling salesman problem
- A large neighborhood search for the pickup and delivery problem with time windows, split loads and transshipments
- The multi-vehicle profitable pickup and delivery problem
- A lexicographic approach for the bi-objective selective pickup and delivery problem with time windows and paired demands
- A grouping genetic algorithm for multi depot pickup and delivery problems with time windows and heterogeneous vehicle fleets
- Effective neighborhood search with optimal splitting and adaptive memory for the team orienteering problem with time windows
- Fundamentals of Computation Theory
Cited In (1)
Uses Software
This page was built for publication: Using decomposition-based multi-objective algorithm to solve selective pickup and delivery problems with time windows
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2147164)
