Modeling Vehicle Routing Problem with Pair Pickup-Delivery Operations

The problem of vehicle routing problem (VRP) with pair operations of pick up and delivery are well-known in real applications in logistics networks, as in planning the routes for automatic guided vehicles (AGVs) in an automatic container terminal (ACT), warehouses or in some just-in-time services. This paper will present a formulation to modeling the problem mathematically which can be used to generate optimal routes of carried vehicles in the field to reduce the incurred cost of moving goods. This selected model could be used in (semi-)automatic short-term planning systems for vehicle fleet working in ACT, or in modern warehouses which the long list of requests is parted and sorted in preprocessing orders systems.