English

Complexity Analysis of the Parallel Guided Ejection Search for the Pickup and Delivery Problem with Time Windows

Data Structures and Algorithms 2017-04-25 v1 Distributed, Parallel, and Cluster Computing
Authors: Miroslaw Blocho , Jakub Nalepa
View on arXiv ↗ PDF ↗

Abstract

This paper presents the pessimistic time complexity analysis of the parallel algorithm for minimizing the fleet size in the pickup and delivery problem with time windows. We show how to estimate the pessimistic complexity step by step. This approach can be easily adopted to other parallel algorithms for solving complex transportation problems.

Keywords

parallel algorithm optimization algorithm traffic engineering

Cite

@article{arxiv.1704.06724,
  title  = {Complexity Analysis of the Parallel Guided Ejection Search for the Pickup and Delivery Problem with Time Windows},
  author = {Miroslaw Blocho and Jakub Nalepa},
  journal= {arXiv preprint arXiv:1704.06724},
  year   = {2017}
}

Comments

4 pages, presented at the Work in Progress Session at PDP 2017

Related papers

View all related →
Distributed, Parallel, and Cluster Computing · Computer Science
A Parallel Memetic Algorithm to Solve the Vehicle Routing Problem with Time Windows
Jakub Nalepa, Zbigniew J. Czech
2014-02-28
Distributed, Parallel, and Cluster Computing · Computer Science
Weighted completion time minimization for capacitated parallel machines
Ilan Reuven Cohen, Izack Cohen, Iyar Zaks
2022-06-28
Optimization and Control · Mathematics
Solution of a bilevel optimistic scheduling problem on parallel machines
Quentin Schau, Olivier Ploton, Vincent T'kindt, Han Hoogeveen +2
2026-03-06
Distributed, Parallel, and Cluster Computing · Computer Science
Multi-GPU parallel memetic algorithm for capacitated vehicle routing problem
Michał Karpiński, Maciej Pacut
2017-03-07
Optimization and Control · Mathematics
The pickup and delivery problem with time windows and scheduling on the edges
Vítor A. Barbosa, Sunil Tiwari, Rafael A. Melo
2025-11-12
Data Structures and Algorithms · Computer Science
Minimizing Completion Times of Stochastic Jobs on Parallel Machines is Hard
Benjamin Moseley, Kirk Pruhs, Marc Uetz, Rudy Zhou
2026-01-27
Optimization and Control · Mathematics
Exact resolution of a simultaneous vehicle routing and crew scheduling problem in long-haul transport
Mauro Lucci, Daniel Severin, Paula Zabala
2024-05-31
Artificial Intelligence · Computer Science
Rolling Horizon based Temporal Decomposition for the Offline Pickup and Delivery Problem with Time Windows
Youngseo Kim, Danushka Edirimanna, Michael Wilbur, Philip Pugliese +3
2023-03-08
Data Structures and Algorithms · Computer Science
Approximation algorithms for the Transportation Problem with Market Choice and related models
Karen Aardal, Pierre Le Bodic
2016-08-23
Data Structures and Algorithms · Computer Science
Sequential and Parallel Algorithms for Mixed Packing and Covering
Neal E. Young
2016-01-19
Data Structures and Algorithms · Computer Science
Multi-objective Optimization For The Dynamic Multi-Pickup and Delivery Problem with Time Windows
Imen Harbaoui Dridi, Ryan Kammarti, Pierre Borne, Mekki Ksouri
2013-02-03
Optimization and Control · Mathematics
A simple parallelizable method for the approximate solution of a quadratic transportation problem of large dimension with additional constraints
S. V. Rotin, I. V. Gusakov, V. Ya. Gusakov
2019-09-06
Distributed, Parallel, and Cluster Computing · Computer Science
Parallel Multi-Hypothesis Algorithm for Criticality Estimation in Traffic and Collision Avoidance
Eduardo Sánchez Morales, Richard Membarth, Andreas Gaull, Philipp Slusallek +4
2020-05-15
Data Structures and Algorithms · Computer Science
Approximation Algorithms for the Traveling Repairman and Speeding Deliveryman Problems
Greg N. Frederickson, Barry Wittman
2009-05-28
Systems and Control · Electrical Eng. & Systems
A Set Cover Mapping Heuristic for Demand-Robust Fleet Size Vehicle Routing Problem with Time Windows and Compatibility Constraints
Jordan Makansi
2024-06-13
Data Structures and Algorithms · Computer Science
Split Algorithm in Linear Time for the Vehicle Routing Problem with Simultaneous Pickup and Delivery and Time Windows
Ethan Gibbons, Mario Ventresca, Beatrice M. Ombuki-Berman
2026-01-27
Optimization and Control · Mathematics
Enhancements of Fragment Based Algorithms for Vehicle Routing Problems
Lucas Sippel, Michael Forbes
2024-11-21
Neural and Evolutionary Computing · Computer Science
A Genetic Algorithm for the Multi-Pickup and Delivery Problem with time windows
Imen Harbaoui Dridi, Ryan Kammarti, Mekki Ksouri, Pierre Borne
2010-09-28
Data Structures and Algorithms · Computer Science
Approximation Algorithms for the Maximum Profit Pick-up Problem with Time Windows and Capacity Constraint
Bogdan Armaselu, Ovidiu Daescu
2016-12-06
Optimization and Control · Mathematics
Simulation Strategies for an Efficient Local Search to solve Stochastic Scheduling Problems
Philip de Bruin, Bram Elderhorst, Marjan van den Akker, Han Hoogeveen
2026-05-25
Optimization and Control · Mathematics
Embedding Assignment Routing Constraints through Multi Dimensional Network Construction for Solving the Multi Vehicle Routing Problem with Pickup and Delivery with Time Windows
Monirehalsadat Mahmoudi, Junhua Chen, Xuesong Zhou
2016-07-07
Artificial Intelligence · Computer Science
Airlift Challenge: A Competition for Optimizing Cargo Delivery
Adis Delanovic, Carmen Chiu, John F. Kolen, Marvin Gülhan +2
2025-04-22
Databases · Computer Science
Worst-Case Optimal Algorithms for Parallel Query Processing
Paul Beame, Paraschos Koutris, Dan Suciu
2016-04-08
Operating Systems · Computer Science
Integrating Job Parallelism in Real-Time Scheduling Theory
S. Collette, L. Cucu, J. Goossens
2008-05-22
Artificial Intelligence · Computer Science
Parallel Strategies Selection
Anthony Palmieri, Jean-Charles Régin, Pierre Schaus
2016-04-25
R2 v1 2026-06-22T19:24:22.169Z