IDEAS home Printed from https://ideas.repec.org/a/eee/proeco/v141y2013i1p199-211.html
   My bibliography  Save this article

The selective pickup and delivery problem: Formulation and a memetic algorithm

Author

Listed:
  • Ting, Chuan-Kang
  • Liao, Xin-Lan

Abstract

The pickup and delivery problem addresses the real-world issues in logistic industry and establishes an important category of vehicle routing problems. The problem is to find the shortest route to collect and distribute commodities under the assumption that the total supply and the total demand are in equilibrium. This study presents a novel problem formulation, called the selective pickup and delivery problem (SPDP), by relaxing the constraint that all pickup nodes must be visited. Specifically, the SPDP aims to find the shortest route that can supply delivery nodes with required commodities from some pickup nodes. This problem can substantially reduce the transportation cost and fits real-world logistic scenarios. Furthermore, this study proves that the SPDP is NP-hard and proposes a memetic algorithm (MA) based on genetic algorithm and local search to resolve the problem. A novel representation of candidate solutions is designed for the selection of pickup nodes. The related operators are also devised for the MA; in particular, it adapts the 2-opt operator to the sub-routes of the SPDP for enhancement of visiting order. The experimental results on several SPDP instances validate that the proposed MA can significantly outperform genetic algorithm and tabu search in terms of solution quality and convergence speed. In addition, the reduced route lengths on the test instances and the real-world application to rental bikes distribution demonstrate the benefit of the SPDP in logistics.

Suggested Citation

  • Ting, Chuan-Kang & Liao, Xin-Lan, 2013. "The selective pickup and delivery problem: Formulation and a memetic algorithm," International Journal of Production Economics, Elsevier, vol. 141(1), pages 199-211.
    • Handle: RePEc:eee:proeco:v:141:y:2013:i:1:p:199-211
    DOI: 10.1016/j.ijpe.2012.06.009
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S092552731200237X
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ijpe.2012.06.009?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Cheung, Bernard K.-S. & Choy, K.L. & Li, Chung-Lun & Shi, Wenzhong & Tang, Jian, 2008. "Dynamic routing model and solution methods for fleet management with mobile technologies," International Journal of Production Economics, Elsevier, vol. 113(2), pages 694-705, June.
    2. Zhang, Ruiyou & Yun, Won Young & Moon, Ilkyeong, 2009. "A reactive tabu search algorithm for the multi-depot container truck transportation problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 45(6), pages 904-914, November.
    3. Gerardo Berbeglia & Jean-François Cordeau & Irina Gribkovskaia & Gilbert Laporte, 2007. "Rejoinder on: Static pickup and delivery problems: a classification scheme and survey," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 15(1), pages 45-47, July.
    4. Roberto Baldacci & Enrico Bartolini & Aristide Mingozzi, 2011. "An Exact Algorithm for the Pickup and Delivery Problem with Time Windows," Operations Research, INFORMS, vol. 59(2), pages 414-426, April.
    5. Pang, King-Wah & Xu, Zhou & Li, Chung-Lun, 2011. "Ship routing problem with berthing time clash avoidance constraints," International Journal of Production Economics, Elsevier, vol. 131(2), pages 752-762, June.
    6. Gerardo Berbeglia & Jean-François Cordeau & Irina Gribkovskaia & Gilbert Laporte, 2007. "Static pickup and delivery problems: a classification scheme and survey," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 15(1), pages 1-31, July.
    7. Gonzalez-Torre, Pilar L. & Adenso-Diaz, B. & Artiba, Hakim, 2004. "Environmental and reverse logistics policies in European bottling and packaging firms," International Journal of Production Economics, Elsevier, vol. 88(1), pages 95-104, March.
    8. Paolo Toth & Daniele Vigo, 1997. "An Exact Algorithm for the Vehicle Routing Problem with Backhauls," Transportation Science, INFORMS, vol. 31(4), pages 372-385, November.
    9. Gutiérrez-Jarpa, Gabriel & Desaulniers, Guy & Laporte, Gilbert & Marianov, Vladimir, 2010. "A branch-and-price algorithm for the Vehicle Routing Problem with Deliveries, Selective Pickups and Time Windows," European Journal of Operational Research, Elsevier, vol. 206(2), pages 341-349, October.
    10. Stefan Ropke & Jean-François Cordeau, 2009. "Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows," Transportation Science, INFORMS, vol. 43(3), pages 267-286, August.
    11. Cortés, Cristián E. & Matamala, Martín & Contardo, Claudio, 2010. "The pickup and delivery problem with transfers: Formulation and a branch-and-cut solution method," European Journal of Operational Research, Elsevier, vol. 200(3), pages 711-724, February.
    12. Hoff, Arild & Gribkovskaia, Irina & Laporte, Gilbert & Løkketangen, Arne, 2009. "Lasso solution strategies for the vehicle routing problem with pickups and deliveries," European Journal of Operational Research, Elsevier, vol. 192(3), pages 755-766, February.
    13. Gribkovskaia, Irina & Halskau, Oyvind sr. & Laporte, Gilbert & Vlcek, Martin, 2007. "General solutions to the single vehicle routing problem with pickups and deliveries," European Journal of Operational Research, Elsevier, vol. 180(2), pages 568-584, July.
    14. Christophe Duhamel & Jean-Yves Potvin & Jean-Marc Rousseau, 1997. "A Tabu Search Heuristic for the Vehicle Routing Problem with Backhauls and Time Windows," Transportation Science, INFORMS, vol. 31(1), pages 49-59, February.
    15. Zhang, Ruiyou & Yun, Won Young & Moon, Il Kyeong, 2011. "Modeling and optimization of a container drayage problem with resource constraints," International Journal of Production Economics, Elsevier, vol. 133(1), pages 351-359, September.
    16. Psaraftis, Harilaos N., 2011. "A multi-commodity, capacitated pickup and delivery problem: The single and two-vehicle cases," European Journal of Operational Research, Elsevier, vol. 215(3), pages 572-580, December.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Szeto, W.Y. & Shui, C.S., 2018. "Exact loading and unloading strategies for the static multi-vehicle bike repositioning problem," Transportation Research Part B: Methodological, Elsevier, vol. 109(C), pages 176-211.
    2. Abdulkader, M.M.S. & Gajpal, Yuvraj & ElMekkawy, Tarek Y., 2018. "Vehicle routing problem in omni-channel retailing distribution systems," International Journal of Production Economics, Elsevier, vol. 196(C), pages 43-55.
    3. Ramaekers Katrien & Caris An & Maes Tabitha & Janssens Gerrit K., 2015. "Pickup and Delivery Selection: Problem Formulation and Extension to Problem Variants," Information Technology and Management Science, Sciendo, vol. 18(1), pages 84-90, December.
    4. Z. Al Chami & H. Manier & M.-A. Manier, 2019. "A lexicographic approach for the bi-objective selective pickup and delivery problem with time windows and paired demands," Annals of Operations Research, Springer, vol. 273(1), pages 237-255, February.
    5. Guo, Zhaoxia & Shi, Leyuan & Chen, Longchao & Liang, Yong, 2017. "A harmony search-based memetic optimization model for integrated production and transportation scheduling in MTO manufacturing," Omega, Elsevier, vol. 66(PB), pages 327-343.
    6. Jeong, Ho Young & Song, Byung Duk & Lee, Seokcheon, 2019. "Truck-drone hybrid delivery routing: Payload-energy dependency and No-Fly zones," International Journal of Production Economics, Elsevier, vol. 214(C), pages 220-233.
    7. Julio C. Londoño & Rafael D. Tordecilla & Leandro do C. Martins & Angel A. Juan, 2021. "A biased-randomized iterated local search for the vehicle routing problem with optional backhauls," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 29(2), pages 387-416, July.
    8. Iassinovskaia, Galina & Limbourg, Sabine & Riane, Fouad, 2017. "The inventory-routing problem of returnable transport items with time windows and simultaneous pickup and delivery in closed-loop supply chains," International Journal of Production Economics, Elsevier, vol. 183(PB), pages 570-582.
    9. Margaretha Gansterer & Murat Küçüktepe & Richard F. Hartl, 2017. "The multi-vehicle profitable pickup and delivery problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(1), pages 303-319, January.
    10. Zhang, Ruiyou & Zhao, Haishu & Moon, Ilkyeong, 2018. "Range-based truck-state transition modeling method for foldable container drayage services," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 118(C), pages 225-239.
    11. Zhen, Lu & Wu, Yiwei & Wang, Shuaian & Yi, Wen, 2021. "Crowdsourcing mode evaluation for parcel delivery service platforms," International Journal of Production Economics, Elsevier, vol. 235(C).
    12. Qiu, Xiaoqiu & Feuerriegel, Stefan & Neumann, Dirk, 2017. "Making the most of fleets: A profit-maximizing multi-vehicle pickup and delivery selection problem," European Journal of Operational Research, Elsevier, vol. 259(1), pages 155-168.
    13. Ho, Sin C. & Szeto, W.Y., 2014. "Solving a static repositioning problem in bike-sharing systems using iterated tabu search," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 69(C), pages 180-198.
    14. Yu, Junfang & Dong, Yuanyuan, 2013. "Maximizing profit for vehicle routing under time and weight constraints," International Journal of Production Economics, Elsevier, vol. 145(2), pages 573-583.
    15. Ho, Sin C. & Szeto, W.Y., 2017. "A hybrid large neighborhood search for the static multi-vehicle bike-repositioning problem," Transportation Research Part B: Methodological, Elsevier, vol. 95(C), pages 340-363.
    16. Zhang, Ruiyou & Lu, Jye-Chyi & Wang, Dingwei, 2014. "Container drayage problem with flexible orders and its near real-time solution strategies," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 61(C), pages 235-251.
    17. Zhang, Jie & Meng, Meng & Wong, Yiik Diew & Ieromonachou, Petros & Wang, David Z.W., 2021. "A data-driven dynamic repositioning model in bicycle-sharing systems," International Journal of Production Economics, Elsevier, vol. 231(C).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Neves-Moreira, F. & Amorim, P. & Guimarães, L. & Almada-Lobo, B., 2016. "A long-haul freight transportation problem: Synchronizing resources to deliver requests passing through multiple transshipment locations," European Journal of Operational Research, Elsevier, vol. 248(2), pages 487-506.
    2. Luciano Costa & Claudio Contardo & Guy Desaulniers, 2019. "Exact Branch-Price-and-Cut Algorithms for Vehicle Routing," Transportation Science, INFORMS, vol. 53(4), pages 946-985, July.
    3. Song, Yujian & Zhang, Jiantong & Liang, Zhe & Ye, Chunming, 2017. "An exact algorithm for the container drayage problem under a separation mode," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 106(C), pages 231-254.
    4. Masson, Renaud & Ropke, Stefan & Lehuédé, Fabien & Péton, Olivier, 2014. "A branch-and-cut-and-price approach for the pickup and delivery problem with shuttle routes," European Journal of Operational Research, Elsevier, vol. 236(3), pages 849-862.
    5. Qiu, Xiaoqiu & Feuerriegel, Stefan & Neumann, Dirk, 2017. "Making the most of fleets: A profit-maximizing multi-vehicle pickup and delivery selection problem," European Journal of Operational Research, Elsevier, vol. 259(1), pages 155-168.
    6. Gutiérrez-Jarpa, Gabriel & Desaulniers, Guy & Laporte, Gilbert & Marianov, Vladimir, 2010. "A branch-and-price algorithm for the Vehicle Routing Problem with Deliveries, Selective Pickups and Time Windows," European Journal of Operational Research, Elsevier, vol. 206(2), pages 341-349, October.
    7. Albert H. Schrotenboer & Evrim Ursavas & Iris F. A. Vis, 2019. "A Branch-and-Price-and-Cut Algorithm for Resource-Constrained Pickup and Delivery Problems," Transportation Science, INFORMS, vol. 53(4), pages 1001-1022, July.
    8. Capelle, Thomas & Cortés, Cristián E. & Gendreau, Michel & Rey, Pablo A. & Rousseau, Louis-Martin, 2019. "A column generation approach for location-routing problems with pickup and delivery," European Journal of Operational Research, Elsevier, vol. 272(1), pages 121-131.
    9. Maria João Santos & Pedro Amorim & Alexandra Marques & Ana Carvalho & Ana Póvoa, 2020. "The vehicle routing problem with backhauls towards a sustainability perspective: a review," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 28(2), pages 358-401, July.
    10. Maria Battarra & Güneş Erdoğan & Gilbert Laporte & Daniele Vigo, 2010. "The Traveling Salesman Problem with Pickups, Deliveries, and Handling Costs," Transportation Science, INFORMS, vol. 44(3), pages 383-399, August.
    11. Sophie N. Parragh & Jorge Pinho de Sousa & Bernardo Almada-Lobo, 2015. "The Dial-a-Ride Problem with Split Requests and Profits," Transportation Science, INFORMS, vol. 49(2), pages 311-334, May.
    12. Julio C. Londoño & Rafael D. Tordecilla & Leandro do C. Martins & Angel A. Juan, 2021. "A biased-randomized iterated local search for the vehicle routing problem with optional backhauls," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 29(2), pages 387-416, July.
    13. Phuong Khanh Nguyen & Teodor Gabriel Crainic & Michel Toulouse, 2017. "Multi-trip pickup and delivery problem with time windows and synchronization," Annals of Operations Research, Springer, vol. 253(2), pages 899-934, June.
    14. Ali Mehsin Alyasiry & Michael Forbes & Michael Bulmer, 2019. "An Exact Algorithm for the Pickup and Delivery Problem with Time Windows and Last-in-First-out Loading," Transportation Science, INFORMS, vol. 53(6), pages 1695-1705, November.
    15. Liu, Ran & Xie, Xiaolan & Augusto, Vincent & Rodriguez, Carlos, 2013. "Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care," European Journal of Operational Research, Elsevier, vol. 230(3), pages 475-486.
    16. Roel G. van Anholt & Leandro C. Coelho & Gilbert Laporte & Iris F. A. Vis, 2016. "An Inventory-Routing Problem with Pickups and Deliveries Arising in the Replenishment of Automated Teller Machines," Transportation Science, INFORMS, vol. 50(3), pages 1077-1091, August.
    17. Cherkesly, Marilène & Gschwind, Timo, 2022. "The pickup and delivery problem with time windows, multiple stacks, and handling operations," European Journal of Operational Research, Elsevier, vol. 301(2), pages 647-666.
    18. Qian, Fubin & Gribkovskaia, Irina & Laporte, Gilbert & Halskau sr., Øyvind, 2012. "Passenger and pilot risk minimization in offshore helicopter transportation," Omega, Elsevier, vol. 40(5), pages 584-593.
    19. Yildiz, Hakan & Ravi, R. & Fairey, Wayne, 2010. "Integrated optimization of customer and supplier logistics at Robert Bosch LLC," European Journal of Operational Research, Elsevier, vol. 207(1), pages 456-464, November.
    20. Bolor Jargalsaikhan & Ward Romeijnders & Kees Jan Roodbergen, 2021. "A Compact Arc-Based ILP Formulation for the Pickup and Delivery Problem with Divisible Pickups and Deliveries," Transportation Science, INFORMS, vol. 55(2), pages 336-352, March.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:proeco:v:141:y:2013:i:1:p:199-211. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/ijpe .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.