IDEAS home Printed from https://ideas.repec.org/a/spr/joheur/v26y2020i1d10.1007_s10732-019-09420-1.html
   My bibliography  Save this article

A coordinated production and transportation scheduling problem with minimum sum of order delivery times

Author

Listed:
  • Ling Liu

    (Yunnan University of Finance and Economics)

  • Wenli Li

    (Huazhong University of Science and Technology)

  • Kunpeng Li

    (Huazhong University of Science and Technology)

  • Xuxia Zou

    (Huazhong University of Science and Technology)

Abstract

In this paper, a coordinated production scheduling and vehicle routing problem aiming at minimizing the sum of order delivery times is considered, where there are a single machine for production and limited number of homogenous capacitated vehicles for transportation. Given the complexity of the studied problem, a variable neighborhood search (VNS) algorithm is proposed to address this problem. To construct initial solution, vehicle routing is determined with nearest insertion first, whereby the order batch production sequence is determined based on three propositions. Moreover, ten neighborhood structures are designed and a local search algorithm based on tabu search algorithm is proposed for intensification. The effectiveness of the proposed VNS algorithm is validated by comparing it with CPLEX and two heuristic algorithms in the existing literature. The computational results show that the proposed VNS algorithm can obtain optimal or near optimal solutions of the problem and is superior to the two heuristic algorithms proposed in the existing literature.

Suggested Citation

  • Ling Liu & Wenli Li & Kunpeng Li & Xuxia Zou, 2020. "A coordinated production and transportation scheduling problem with minimum sum of order delivery times," Journal of Heuristics, Springer, vol. 26(1), pages 33-58, February.
    • Handle: RePEc:spr:joheur:v:26:y:2020:i:1:d:10.1007_s10732-019-09420-1
    DOI: 10.1007/s10732-019-09420-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10732-019-09420-1
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10732-019-09420-1?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. Lysgaard, Jens & Wøhlk, Sanne, 2014. "A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 236(3), pages 800-810.
    2. Niklas Kohl & Oli B. G. Madsen, 1997. "An Optimization Algorithm for the Vehicle Routing Problem with Time Windows Based on Lagrangian Relaxation," Operations Research, INFORMS, vol. 45(3), pages 395-406, June.
    3. Stefan Ropke & David Pisinger, 2006. "An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows," Transportation Science, INFORMS, vol. 40(4), pages 455-472, November.
    4. Luo, Zhixing & Qin, Hu & Lim, Andrew, 2014. "Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints," European Journal of Operational Research, Elsevier, vol. 234(1), pages 49-60.
    5. Chen, Bo & Lee, Chung-Yee, 2008. "Logistics scheduling with batching and transportation," European Journal of Operational Research, Elsevier, vol. 189(3), pages 871-876, September.
    6. Pierre Hansen & Nenad Mladenović & Raca Todosijević & Saïd Hanafi, 2017. "Variable neighborhood search: basics and variants," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 5(3), pages 423-454, September.
    7. Mladenović, Nenad & Urošević, Dragan & Hanafi, Saı¨d & Ilić, Aleksandar, 2012. "A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem," European Journal of Operational Research, Elsevier, vol. 220(1), pages 270-285.
    8. Van Buer, Michael G. & Woodruff, David L. & Olson, Rick T., 1999. "Solving the medium newspaper production/distribution problem," European Journal of Operational Research, Elsevier, vol. 115(2), pages 237-253, June.
    9. Boudia, M. & Prins, C., 2009. "A memetic algorithm with dynamic population management for an integrated production-distribution problem," European Journal of Operational Research, Elsevier, vol. 195(3), pages 703-715, June.
    10. Ciancimino, Elena & Cannella, Salvatore & Bruccoleri, Manfredi & Framinan, Jose M., 2012. "On the Bullwhip Avoidance Phase: The Synchronised Supply Chain," European Journal of Operational Research, Elsevier, vol. 221(1), pages 49-63.
    11. Lee, Jongsung & Kim, Byung-In & Johnson, Andrew L. & Lee, Kiho, 2014. "The nuclear medicine production and delivery problem," European Journal of Operational Research, Elsevier, vol. 236(2), pages 461-472.
    12. Juan Rivera & H. Afsar & Christian Prins, 2015. "A multistart iterated local search for the multitrip cumulative capacitated vehicle routing problem," Computational Optimization and Applications, Springer, vol. 61(1), pages 159-187, May.
    13. Demir, Emrah & Bektaş, Tolga & Laporte, Gilbert, 2012. "An adaptive large neighborhood search heuristic for the Pollution-Routing Problem," European Journal of Operational Research, Elsevier, vol. 223(2), pages 346-359.
    14. Zhi-Long Chen, 2010. "Integrated Production and Outbound Distribution Scheduling: Review and Extensions," Operations Research, INFORMS, vol. 58(1), pages 130-148, February.
    15. Ann Melissa Campbell & Dieter Vandenbussche & William Hermann, 2008. "Routing for Relief Efforts," Transportation Science, INFORMS, vol. 42(2), pages 127-145, May.
    16. H. Neil Geismar & Gilbert Laporte & Lei Lei & Chelliah Sriskandarajah, 2008. "The Integrated Production and Transportation Scheduling Problem for a Product with a Short Lifespan," INFORMS Journal on Computing, INFORMS, vol. 20(1), pages 21-33, February.
    17. Ullrich, Christian A., 2013. "Integrated machine scheduling and vehicle routing with time windows," European Journal of Operational Research, Elsevier, vol. 227(1), pages 152-165.
    18. Leiyang Wang & Zhaohui Liu, 2013. "Single Machine Scheduling With Batch Delivery To Multiple Customers In A Star-Shaped Network," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 30(01), pages 1-9.
    19. İsmail Karaoğlan & Saadettin Erhan Kesen, 2017. "The coordinated production and transportation scheduling problem with a time-sensitive product: a branch-and-cut algorithm," International Journal of Production Research, Taylor & Francis Journals, vol. 55(2), pages 536-557, January.
    20. Xuxia Zou & Ling Liu & Kunpeng Li & Wenli Li, 2018. "A coordinated algorithm for integrated production scheduling and vehicle routing problem," International Journal of Production Research, Taylor & Francis Journals, vol. 56(15), pages 5005-5024, August.
    21. Fleszar, Krzysztof & Osman, Ibrahim H. & Hindi, Khalil S., 2009. "A variable neighbourhood search algorithm for the open vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 195(3), pages 803-809, June.
    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. Alexis Robbes & Yannick Kergosien & Virginie André & Jean-Charles Billaut, 2022. "Efficient heuristics to minimize the total tardiness of chemotherapy drug production and delivery," Flexible Services and Manufacturing Journal, Springer, vol. 34(3), pages 785-820, September.
    2. Berghman, Lotte & Kergosien, Yannick & Billaut, Jean-Charles, 2023. "A review on integrated scheduling and outbound vehicle routing problems," European Journal of Operational Research, Elsevier, vol. 311(1), pages 1-23.

    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. Berghman, Lotte & Kergosien, Yannick & Billaut, Jean-Charles, 2023. "A review on integrated scheduling and outbound vehicle routing problems," European Journal of Operational Research, Elsevier, vol. 311(1), pages 1-23.
    2. Ling Liu & Sen Liu, 2020. "Integrated Production and Distribution Problem of Perishable Products with a Minimum Total Order Weighted Delivery Time," Mathematics, MDPI, vol. 8(2), pages 1-18, January.
    3. Diego Cattaruzza & Nabil Absi & Dominique Feillet, 2018. "Vehicle routing problems with multiple trips," Annals of Operations Research, Springer, vol. 271(1), pages 127-159, December.
    4. Diego Cattaruzza & Nabil Absi & Dominique Feillet, 2016. "Vehicle routing problems with multiple trips," 4OR, Springer, vol. 14(3), pages 223-259, September.
    5. Sze, Jeeu Fong & Salhi, Said & Wassan, Niaz, 2017. "The cumulative capacitated vehicle routing problem with min-sum and min-max objectives: An effective hybridisation of adaptive variable neighbourhood search and large neighbourhood search," Transportation Research Part B: Methodological, Elsevier, vol. 101(C), pages 162-184.
    6. Ullrich, Christian A., 2013. "Integrated machine scheduling and vehicle routing with time windows," European Journal of Operational Research, Elsevier, vol. 227(1), pages 152-165.
    7. Alexis Robbes & Yannick Kergosien & Virginie André & Jean-Charles Billaut, 2022. "Efficient heuristics to minimize the total tardiness of chemotherapy drug production and delivery," Flexible Services and Manufacturing Journal, Springer, vol. 34(3), pages 785-820, September.
    8. Lee, Jongsung & Kim, Byung-In & Johnson, Andrew L. & Lee, Kiho, 2014. "The nuclear medicine production and delivery problem," European Journal of Operational Research, Elsevier, vol. 236(2), pages 461-472.
    9. Kergosien, Y. & Gendreau, M. & Billaut, J.-C., 2017. "A Benders decomposition-based heuristic for a production and outbound distribution scheduling problem with strict delivery constraints," European Journal of Operational Research, Elsevier, vol. 262(1), pages 287-298.
    10. Wang, Yu & Ropke, Stefan & Wen, Min & Bergh, Simon, 2023. "The mobile production vehicle routing problem: Using 3D printing in last mile distribution," European Journal of Operational Research, Elsevier, vol. 305(3), pages 1407-1423.
    11. Martha-Selene Casas-Ramírez & José-Fernando Camacho-Vallejo & Rosa G. González-Ramírez & José-Antonio Marmolejo-Saucedo & José-Manuel Velarde-Cantú, 2018. "Optimizing a Biobjective Production-Distribution Planning Problem Using a GRASP," Complexity, Hindawi, vol. 2018, pages 1-13, February.
    12. Rivera, Juan Carlos & Murat Afsar, H. & Prins, Christian, 2016. "Mathematical formulations and exact algorithm for the multitrip cumulative capacitated single-vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 249(1), pages 93-104.
    13. Yossiri Adulyasak & Jean-François Cordeau & Raf Jans, 2014. "Optimization-Based Adaptive Large Neighborhood Search for the Production Routing Problem," Transportation Science, INFORMS, vol. 48(1), pages 20-45, February.
    14. Feng Li & Zhou Xu & Zhi-Long Chen, 2020. "Production and Transportation Integration for Commit-to-Delivery Mode with General Shipping Costs," INFORMS Journal on Computing, INFORMS, vol. 32(4), pages 1012-1029, October.
    15. Li, Feng & Xu, Shifu & Xu, Zhou, 2023. "New exact and approximation algorithms for integrated production and transportation scheduling with committed delivery due dates and order acceptance," European Journal of Operational Research, Elsevier, vol. 306(1), pages 127-140.
    16. Daniel Schubert & André Scholz & Gerhard Wäscher, 2017. "Integrated Order Picking and Vehicle Routing with Due Dates," FEMM Working Papers 170007, Otto-von-Guericke University Magdeburg, Faculty of Economics and Management.
    17. Pedro L. Miranda & Reinaldo Morabito & Deisemara Ferreira, 2018. "Optimization model for a production, inventory, distribution and routing problem in small furniture companies," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 26(1), pages 30-67, April.
    18. Daniel Schubert & André Scholz & Gerhard Wäscher, 2018. "Integrated order picking and vehicle routing with due dates," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 40(4), pages 1109-1139, October.
    19. Masmoudi, Mohamed Amine & Hosny, Manar & Demir, Emrah & Genikomsakis, Konstantinos N. & Cheikhrouhou, Naoufel, 2018. "The dial-a-ride problem with electric vehicles and battery swapping stations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 118(C), pages 392-420.
    20. Iman Dayarian & Guy Desaulniers, 2019. "A Branch-Price-and-Cut Algorithm for a Production-Routing Problem with Short-Life-Span Products," Transportation Science, INFORMS, vol. 53(3), pages 829-849, May.

    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:spr:joheur:v:26:y:2020:i:1:d:10.1007_s10732-019-09420-1. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.