IDEAS home Printed from https://ideas.repec.org/a/exl/1trans/v16y2021i4p23-34.html
   My bibliography  Save this article

Planning And Modeling Of The Time For Acceptance And Stay Of Vehicles At The Loading And Discharging Points

Author

Listed:
  • Asen ASENOV

    (University of Ruse “Angel Kanchev”, 8 Studentska, 7017 Ruse, Bulgaria)

  • Velizara PENCHEVA

    (University of Ruse “Angel Kanchev”, 8 Studentska, 7017 Ruse, Bulgaria)

  • Ivan GEORGIEV

    (University of Ruse “Angel Kanchev”, 8 Studentska, 7017 Ruse, Bulgaria)

Abstract

When delivering goods in the warehouses of enterprises, courier and forwarding companies, and for logistics operators, loading and unloading is...

Suggested Citation

  • Asen ASENOV & Velizara PENCHEVA & Ivan GEORGIEV, 2021. "Planning And Modeling Of The Time For Acceptance And Stay Of Vehicles At The Loading And Discharging Points," Transport Problems, Silesian University of Technology, Faculty of Transport, vol. 16(4), pages 23-34, December.
    • Handle: RePEc:exl:1trans:v:16:y:2021:i:4:p:23-34
    DOI: 10.21307/tp-2021-057
    as

    Download full text from publisher

    File URL: https://www.exeley.com/exeley/journals/transport_problems/16/4/pdf/10.21307_tp-2021-057.pdf
    Download Restriction: no
    File URL: https://www.exeley.com/transport_problems/doi/10.21307/tp-2021-057
    Download Restriction: no
    File URL: https://libkey.io/10.21307/tp-2021-057?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
    ---><---

    References listed on IDEAS

    as
    1. Asoke Kumar Bhunia & Laxminarayan Sahoo & Ali Akbar Shaikh, 2019. "Advanced Optimization and Operations Research," Springer Optimization and Its Applications, Springer, number 978-981-32-9967-2, December.
    2. Baldacci, Roberto & Mingozzi, Aristide & Roberti, Roberto, 2012. "Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints," European Journal of Operational Research, Elsevier, vol. 218(1), pages 1-6.
    Full references (including those not matched with items on IDEAS)

    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. Nicolas Rincon-Garcia & Ben J. Waterson & Tom J. Cherrett, 2018. "Requirements from vehicle routing software: perspectives from literature, developers and the freight industry," Transport Reviews, Taylor & Francis Journals, vol. 38(1), pages 117-138, January.
    2. Almoustafa, Samira & Hanafi, Said & Mladenović, Nenad, 2013. "New exact method for large asymmetric distance-constrained vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 226(3), pages 386-394.
    3. Herminghaus, Stephan, 2019. "Mean field theory of demand responsive ride pooling systems," Transportation Research Part A: Policy and Practice, Elsevier, vol. 119(C), pages 15-28.
    4. Eugenia Ama Andoh & Hao Yu, 2023. "A two-stage decision-support approach for improving sustainable last-mile cold chain logistics operations of COVID-19 vaccines," Annals of Operations Research, Springer, vol. 328(1), pages 75-105, September.
    5. 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.
    6. Letizia Tebaldi & Teresa Murino & Eleonora Bottani, 2020. "An Adapted Version of the Water Wave Optimization Algorithm for the Capacitated Vehicle Routing Problem with Time Windows with Application to a Real Case Using Probe Data," Sustainability, MDPI, vol. 12(9), pages 1-13, May.
    7. Jiliu Li & Zhixing Luo & Roberto Baldacci & Hu Qin & Zhou Xu, 2023. "A New Exact Algorithm for Single-Commodity Vehicle Routing with Split Pickups and Deliveries," INFORMS Journal on Computing, INFORMS, vol. 35(1), pages 31-49, January.
    8. Schneider, M., 2016. "The vehicle-routing problem with time windows and driver-specific times," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 65941, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    9. Qie He & Stefan Irnich & Yongjia Song, 2018. "Branch-Cut-and-Price for the Vehicle Routing Problem with Time Windows and Convex Node Costs," Working Papers 1804, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    10. Dimitris Bertsimas & Patrick Jaillet, & Sébastien Martin, 2019. "Online Vehicle Routing: The Edge of Optimization in Large-Scale Applications," Operations Research, INFORMS, vol. 67(1), pages 143-162, January.
    11. Drexl, Michael & Schneider, Michael, 2015. "A survey of variants and extensions of the location-routing problem," European Journal of Operational Research, Elsevier, vol. 241(2), pages 283-308.
    12. Roberto Baldacci & Andrew Lim & Emiliano Traversi & Roberto Wolfler Calvo, 2020. "Optimal Solution of Vehicle Routing Problems with Fractional Objective Function," Transportation Science, INFORMS, vol. 54(2), pages 434-452, March.
    13. Ehmke, Jan Fabian & Campbell, Ann Melissa, 2014. "Customer acceptance mechanisms for home deliveries in metropolitan areas," European Journal of Operational Research, Elsevier, vol. 233(1), pages 193-207.
    14. Bhusiri, Narath & Qureshi, Ali Gul & Taniguchi, Eiichi, 2014. "The trade-off between fixed vehicle costs and time-dependent arrival penalties in a routing problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 62(C), pages 1-22.
    15. Gilbert Laporte, 2016. "Scheduling issues in vehicle routing," Annals of Operations Research, Springer, vol. 236(2), pages 463-474, January.
    16. Sasan Harifi & Madjid Khalilian & Javad Mohammadzadeh & Sadoullah Ebrahimnejad, 2021. "Optimization in solving inventory control problem using nature inspired Emperor Penguins Colony algorithm," Journal of Intelligent Manufacturing, Springer, vol. 32(5), pages 1361-1375, June.
    17. Remy Spliet & Adriana F. Gabor, 2015. "The Time Window Assignment Vehicle Routing Problem," Transportation Science, INFORMS, vol. 49(4), pages 721-731, November.
    18. Schyns, M., 2015. "An ant colony system for responsive dynamic vehicle routing," European Journal of Operational Research, Elsevier, vol. 245(3), pages 704-718.
    19. Leonardo Lozano & Daniel Duque & Andrés L. Medaglia, 2016. "An Exact Algorithm for the Elementary Shortest Path Problem with Resource Constraints," Transportation Science, INFORMS, vol. 50(1), pages 348-357, February.
    20. Quoc Trung Bui & Yves Deville & Quang Dung Pham, 2016. "Exact methods for solving the elementary shortest and longest path problems," Annals of Operations Research, Springer, vol. 244(2), pages 313-348, September.

    More about this item

    Statistics

    Access and download statistics

    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:exl:1trans:v:16:y:2021:i:4:p:23-34. 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: MPS Ltd. (email available below). General contact details of provider: https://www.exeley.com/journal/transport_problems .

    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.