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
A transport based clearing system for dynamic carpooling business services
TL;DR: Both the carpooling system and the underlying utility services have been prototyped, using the Netlogo simulator, to prove not only the efficiency of WiSafeCar at reducing the congestion in cities; but also to validate the business models to be implemented and more precisely the clearing algorithm.
Journal ArticleDOI
Exact approaches for the pickup and delivery problem with loading cost
TL;DR: The computational results showed that the branch-and-price algorithm outperformed the branch and-cut algorithm by a large margin, and can solve instances with 40 requests to optimality in a reasonable time frame.
Journal ArticleDOI
An integrated model for ship routing and berth allocation
Chung Lun Li,King Wah Pang +1 more
TL;DR: A mathematical model to support joint decisions for container ship routing and container terminal berth allocation is presented and computational experiments are conducted to investigate the potential cost-saving benefits attainable by the integrated operations.
Journal ArticleDOI
A set-covering formulation for a drayage problem with single and double container loads
TL;DR: This paper addresses a drayage problem, which is motivated by the case study of a real carrier, and proposes a set-covering formulation for this problem where all possible routes are enumerated, significantly outperforming a previously proposed node-arc formulation.
Journal ArticleDOI
Pushing frontiers in auction-based transport collaborations
TL;DR: This study shows that bundles built by the auctioneer under incomplete information can yield significantly higher collaboration profits, and allow for a lower number of bundles to be generated, and introduces a new profit sharing method, which is computationally tractable, guarantees individual rationality and does not require that critical information is revealed.
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.