ew 20(27): e5

Research Article

Solution Strategy for One-to-One Pickup and Delivery Problem Using the Cyclic Transfer Approach

Download126 downloads
  • @ARTICLE{10.4108/eai.13-7-2018.164110,
        author={R. Dupas and I. Grebennik and I. Litvinchev and T. Romanova and O. Chorna},
        title={Solution Strategy for One-to-One Pickup and Delivery Problem Using the Cyclic Transfer Approach},
        journal={EAI Endorsed Transactions on Energy Web},
        volume={7},
        number={27},
        publisher={EAI},
        journal_a={EW},
        year={2020},
        month={4},
        keywords={pickup and delivery problem, vehicle routing, 3D loading constraints, combinatorial optimization, cyclic transfer},
        doi={10.4108/eai.13-7-2018.164110}
    }
    
  • R. Dupas
    I. Grebennik
    I. Litvinchev
    T. Romanova
    O. Chorna
    Year: 2020
    Solution Strategy for One-to-One Pickup and Delivery Problem Using the Cyclic Transfer Approach
    EW
    EAI
    DOI: 10.4108/eai.13-7-2018.164110
R. Dupas1, I. Grebennik2, I. Litvinchev3, T. Romanova2,4,*, O. Chorna2
  • 1: IMS, Univ. of Bordeaux, Bordeaux INP, CNRS (UMR 5218), France
  • 2: Kharkiv National University of Radio Electronics, Ukraine
  • 3: Nuevo Leon State University (UANL), Mexico
  • 4: Institute for Mechanical Engineering Problems of the National Academy of Sciences of Ukraine, Ukraine
*Contact email: tetiana.romanova@nure.ua

Abstract

One-to-one Pickup and Delivery Problem (PDP) with loading constraints is studied. Mathematical model is presented using combinatorial configurations approach for pickup and delivery and the phi-function technique for loading constraints. Two-stage solution strategy is used. The first stage has two levels: a) clustering the set of pickup and delivery points regarding to the set of vehicles and b) solving the PDP problem with 3D loading constraints for each vehicle within the appropriate cluster. The second stage improves the solution found at the previous stage and is based on the cyclic transfer approach and cyclic permutations. Computational results are presented to support efficiency of the approach.