We consider the multi-vehicle one-to-one pickup and delivery problem with split loads, a NP-hard problem linked with a variety of applications for bulk product transportation, bike-sharing systems and inventory re-balancing. This problem is notoriously difficult due to the interaction of two challenging vehicle routing attributes, “pickups and deliveries” and “split deliveries”. This possibly l...

The double travelling salesman problem with multiple stacks (DTSPMS) is a pickup and delivery problem in which all pickups must be completed before any deliveries can be made. The problem originates from a real-life application where a 40 foot container (configured as 3 columns of 11 rows) is used to transport up to 33 pallets from a set of pickup customers to a set of delivery customers. The p...

This paper studies the vehicle routing and scheduling problem with time windows in the pickup and delivery service for customers via vehicles. After discussing the collaborative pattern of vehicles and defining the isolated customer point, we derive the model and strategy of single-pass multiple vehicle collaborations. And then we propose a heuristic algorithm based on single-pass multiple vehi...

This paper modeled and solved an integrated multi-depot vehicle routing problem (MDVRP) with simultaneous pickup delivery (SPD) package layout under unpredictable pickup, delivery, transfer costs. The model described in this is divided into two stages. In the first stage, SCA algorithm used to optimize dimensions (a collection of commodities consumers need). NSGA II MOALO algorithms are second ...

Price inflation in the U.S. has been slow to pick up last two decades. We show that this missing can be traced a growing disconnect between unemployment and core goods inflation. exploit rich industry-level data weakening pass-through from wages prices goods-producing sector is an important source of pickup. develop theory where markups depend on firms' market shares increased import competitio...