Using decomposition-based multi-objective algorithm to solve selective pickup and delivery problems with time windows

DOI10.1016/J.COR.2022.105867MaRDI QIDQ2147164zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

multi-objective optimizationmeta-heuristicsdecomposition algorithmPareto local searchselective pickup and delivery problem

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

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

Cites work

• scientific article; zbMATH DE number 2102231 (Why is no real title available?)
• scientific article; zbMATH DE number 956787 (Why is no real title available?)
• A discussion of scalarization techniques for multiple objective integer programming
• A grouping genetic algorithm for multi depot pickup and delivery problems with time windows and heterogeneous vehicle fleets
• A heuristic algorithm for the asymmetric capacitated vehicle routing problem
• A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems
• A large neighborhood search for the pickup and delivery problem with time windows, split loads and transshipments
• A lexicographic approach for the bi-objective selective pickup and delivery problem with time windows and paired demands
• A study on the pickup and delivery problem with time windows: matheuristics and new instances
• 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
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• Anytime Pareto local search
• Design and analysis of stochastic local search for the multiobjective traveling salesman problem
• Effective neighborhood search with optimal splitting and adaptive memory for the team orienteering problem with time windows
• Fundamentals of Computation Theory
• Multi-objective optimization using evolutionary algorithms
• Multi-objective vehicle routing problems
• Nonlinear multiobjective optimization
• On spanning tree problems with multiple objectives
• Perturbed decomposition algorithm applied to the multi-objective traveling salesman problem
• The General Pickup and Delivery Problem
• The Vehicle Routing Problem with Time Windows Part I: Tabu Search
• The multi-pickup and delivery problem with time windows
• The multi-vehicle profitable pickup and delivery problem
• The pickup and delivery problem with time windows
• The pickup and delivery problem with time windows and occasional drivers
• Two-phase Pareto local search for the biobjective traveling salesman problem
• Typology and literature review for dial-a-ride problems

Cited in

(2)

• A lexicographic approach for the bi-objective selective pickup and delivery problem with time windows and paired demands
• A decomposition approach for commodity pickup and delivery with time-windows under uncertainty

Describes a project that uses

Uses Software

• MOEA/D

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)