This paper presents multiple readings to solve a vehicle routing problem with pickup and delivery (VRPPD) based on real-life case study. Compared theoretical problems, ones are more difficult address due their richness complexity. To handle points of view in modeling our problem, we developed three different Mixed Integer Linear Programming (MILP) models, where each model covers particular cons...

We have modeled the injection and acceleration of pickup ions at the solar wind termination shock and investigated the parameters needed to produce the observed Anomalous Cosmic Ray (ACR) fluxes. A non-linear Monte Carlo technique was employed which in effect solves the Boltzmann equation and is not restricted to near isotropic particle distribution functions. This technique models the injectio...

In the present study we test a compact disk pickup as the cantilever position sensor in an atomic force microscope ~AFM!. The pickup is placed on top of the optical microscope used for the visual inspection and alignment of the specimen. The AFM is also equipped with its own cantilever movement sensor system. Both the built-in and the new detection devices are simultaneously active for comparis...

This paper introduces a special kind of multi-depot pickup and delivery problem. In contrast to the general pickup and delivery problem (GPDP, see e.g. [19, 31]) all requests have to be picked up at or delivered to one central location which has the function of a hub or consolidation point. In hub transportation networks routes between customers and the hub are often short, i.e. involve only on...

Solving the Vehicle Routing Problem (VRP) and its related variants is significant for optimizing logistic planning. One important variant of the VRP is the Pickup and Delivery Problem with Time Windows (PDPTW), where it is assumed that a client may request one of two service types, a pickup or a delivery. It is required to find a set of minimum cost routes for a fleet of vehicles, while observi...

The double traveling salesman problem with multiple stacks is a variant of the pickup and delivery traveling salesman problem in which all pickups must be completed before any of the deliveries. In addition, items can be loaded on multiple stacks in the vehicle and each stack must obey the last-in-first-out policy. The problem consists in finding the shortest Hamiltonian cycles covering all pic...