Journal ArticleDOI
Static pickup and delivery problems: a classification scheme and survey
TLDR
A general framework to model a large collection of pickup and delivery problems, as well as a three-field classification scheme for these problems, is introduced.Abstract:
Pickup and delivery problems constitute an important class of vehicle routing problems in which objects or people have to be collected and distributed. This paper introduces a general framework to model a large collection of pickup and delivery problems, as well as a three-field classification scheme for these problems. It surveys the methods used for solving them.read more
Citations
More filters
Journal ArticleDOI
An Adaptive Large Neighborhood Search for the Pickup and Delivery Problem with Transfers
TL;DR: This paper addresses a variant of the PDP where requests can change vehicle during their trip and proposes new heuristics capable of efficiently inserting requests through transfer points embedded into an Adaptive Large Neighborhood Search.
Journal ArticleDOI
An adaptive large neighborhood search heuristic for the Pickup and Delivery Problem with Time Windows and Scheduled Lines
TL;DR: An Adaptive Large Neighborhood Search (ALNS) heuristic algorithm is proposed to solve the PDPTW-SL and results show that the ALNS is highly effective in finding good-quality solutions on the generated PDP TW-SL instances with up to 100 freight requests that reasonably represent real life situations.
Journal ArticleDOI
Optimisation of maintenance routing and scheduling for offshore wind farms
TL;DR: An optimisation model and a solution method for maintenance routing and scheduling at offshore wind farms are proposed that finds the optimal schedule for maintaining the turbines and the optimal routes for the crew transfer vessels to service the turbines along with the number of technicians required for each vessel.
Journal ArticleDOI
Determining optimal locations for charging stations of electric car-sharing systems under stochastic demand
TL;DR: In this paper, a two-stage stochastic optimization problem suitable to solve strategic optimization problems of car-sharing systems that utilize electric cars is introduced and studied, and a time-dependent integer linear program and a heuristic algorithm for solving the considered optimization problem are developed and tested on real world instances from the city of Vienna, as well as on grid-graph-based instances.
Journal ArticleDOI
Introducing heterogeneous users and vehicles into models and algorithms for the dial-a-ride problem.
TL;DR: Staff seats, patient seats, stretchers and wheelchair places are introduced into state-of-the-art formulations and branch-and-cut algorithms for the standard dial-a-ride problem and a recent metaheuristic method is adapted to this new problem.
References
More filters
Book
Computers and Intractability: A Guide to the Theory of NP-Completeness
TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
Journal ArticleDOI
Self-organized formation of topologically correct feature maps
TL;DR: In this paper, the authors describe a self-organizing system in which the signal representations are automatically mapped onto a set of output responses in such a way that the responses acquire the same topological order as that of the primary events.