Pickup and Delivery Problem with Two Dimensional Loading/Unloading Constraints

摘要: This article addresses the Pickup and Delivery Problem with Two Dimensional Loading/Unloading Constraints. In this problem, we are given a weighted complete graph 2n + 1 vertices, collection \({\mathcal S} = \{S_1, \ldots, S_n\}\) of sets rectangular items bin B width W height H. Vertex 0 is depot remaining vertices grouped into n pairs (p i ,d ), ≤ representing pickup delivery point for each costumer. Each set S corresponds to that have be transported from p d . As in well-known Problem, find shortest Hamiltonian cycle (route) such vertex visited before n, but here additional constraint there must exist feasible packing all S}\) satisfying loading unloading constraints. These constraints ensure exists free way insert/remove into/from along route. To best our knowledge first work address which considers practical Our main contribution proposal two exact algorithms GRASP heuristic providing an extensive computational experiment these showing they can effectively used solve problem.