scispace - formally typeset
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

General solutions to the single vehicle routing problem with pickups and deliveries

TL;DR: A mixed integer linear programming model for the single vehicle routing problem with pickups and deliveries is proposed and the concept of general solution is introduced which encompasses known solution shapes such as Hamiltonian, double-path and lasso.
Journal ArticleDOI

A two-phase optimization model for the demand-responsive customized bus network design

TL;DR: A new optimization model for the network design problem of the demand-responsive customized bus (CB) is proposed and a hierarchical decision-making model is proposed to describe the interactive manner between operator and passengers.
Journal ArticleDOI

A Partition-Based Match Making Algorithm for Dynamic Ridesharing

TL;DR: The presented approach exceeds the mileage savings achieved by a greedy heuristic by 6% while requiring 30% lower computational efforts, and is applied to investigate the potential for taxi sharing in Singapore.
Journal ArticleDOI

Rich routing problems arising in supply chain management

TL;DR: Basic models for highly relevant extensions of the classical vehicle routing problem in the context of supply chain management with respect to lotsizing, scheduling, packing, batching, inventory and intermodality are provided.
Journal ArticleDOI

A destroy and repair algorithm for the Bike sharing Rebalancing Problem

TL;DR: This paper tackles the BRP with a destroy and repair metaheuristic algorithm, which makes use of a new effective constructive heuristic and of several local search procedures, and improves several best-known solutions, providing high quality results on both problem variants.
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.