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
Proceedings ArticleDOI
An evolutionary approach for the selective pickup and delivery problem
Xin-Lan Liao,Chuan-Kang Ting +1 more
TL;DR: This study formulates a new problem, called the selective pickup and delivery problem (SPDP), by relaxing the constraint that all pickup nodes must be visited, and proposes a genetic algorithm (GA) to resolve the SPDP.
Journal ArticleDOI
A branch-and-cut algorithm for the preemptive swapping problem
TL;DR: This article investigates the preemptive version of the SP in which the objects are allowed to be dropped at temporary locations along the route, modeled as a mixed integer linear program which is solved by branch-and-cut.
Journal ArticleDOI
Reoptimization strategies for a dynamic vehicle routing problem with mixed backhauls
George Ninikas,Ioannis Minis +1 more
TL;DR: To solve the reoptimization problem, a branch‐and‐price approach and a novel insertion heuristic which is based on column generation and provides near optimal solutions in an efficient manner are proposed.
Dissertation
Optimizing Logistics Processes in Cash Supply Chains
TL;DR: In this paper, the authors present five distinct yet interrelated research studies that provide solutions for managing ATM inventories and cash deliveries in order to improve the cost-efficiency of cash supply chains, user satisfaction, and the security of cash logistics.
Journal ArticleDOI
An adaptive tabu search algorithm embedded with iterated local search and route elimination for the bike repositioning and recycling problem
TL;DR: This study investigates the static repositioning and recycling problem of a bike-sharing system, which is formulated as an integer linear programming model, and develops an adaptive tabu search (ATS) algorithm combined with six neighborhood structures.
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.