IDEAS home Printed from https://ideas.repec.org/a/taf/tjorxx/v69y2018i2p235-246.html
   My bibliography  Save this article

Long-haul vehicle routing and scheduling with idling options

Author

Listed:
  • Çağrı Koç
  • Ola Jabali
  • Gilbert Laporte

Abstract

This paper introduces the vehicle routing and truck driver scheduling problem with idling options, an extension of the long-haul vehicle routing and truck driver scheduling problem with a more comprehensive objective function that accounts for routing cost, driver cost and idling cost, i.e., the cost associated with energy supply used to maintain drivers’ comfort when the vehicle is not moving. For the idling cost, we consider Electrified Parking Space (EPS) and Auxiliary Power Unit (APU) usage costs. The use of EPSs or APUs avoids keeping the engine running while the vehicle is not moving. We develop a multi-start matheuristic algorithm that combines adaptive large neighborhood search and mixed integer linear programming. We present extensive computational results on instances derived from the Solomon test bed.

Suggested Citation

  • Çağrı Koç & Ola Jabali & Gilbert Laporte, 2018. "Long-haul vehicle routing and scheduling with idling options," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 69(2), pages 235-246, February.
    • Handle: RePEc:taf:tjorxx:v:69:y:2018:i:2:p:235-246
    DOI: 10.1057/s41274-017-0202-y
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1057/s41274-017-0202-y
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/s41274-017-0202-y?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.

    Citations

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


    Cited by:

    1. Singh, Nitish & Dang, Quang-Vinh & Akcay, Alp & Adan, Ivo & Martagan, Tugce, 2022. "A matheuristic for AGV scheduling with battery constraints," European Journal of Operational Research, Elsevier, vol. 298(3), pages 855-873.
    2. Tilk, Christian & Goel, Asvin, 2020. "Bidirectional labeling for solving vehicle routing and truck driver scheduling problems," European Journal of Operational Research, Elsevier, vol. 283(1), pages 108-124.
    3. Vieira, Bruno S. & Ribeiro, Glaydston M. & Bahiense, Laura & Cruz, Roberto & Mendes, André B. & Laporte, Gilbert, 2021. "Exact and heuristic algorithms for the fleet composition and periodic routing problem of offshore supply vessels with berth allocation decisions," European Journal of Operational Research, Elsevier, vol. 295(3), pages 908-923.
    4. Mohammad Asghari & Seyed Mohammad Javad Mirzapour Al-E-Hashem, 2021. "Green vehicle routing problem: A state-of-the-art review," Post-Print hal-03182944, HAL.
    5. Mayerle, Sérgio Fernando & De Genaro Chiroli, Daiane Maria & Neiva de Figueiredo, João & Rodrigues, Hidelbrando Ferreira, 2020. "The long-haul full-load vehicle routing and truck driver scheduling problem with intermediate stops: An economic impact evaluation of Brazilian policy," Transportation Research Part A: Policy and Practice, Elsevier, vol. 140(C), pages 36-51.
    6. Asghari, Mohammad & Mirzapour Al-e-hashem, S. Mohammad J., 2021. "Green vehicle routing problem: A state-of-the-art review," International Journal of Production Economics, Elsevier, vol. 231(C).
    7. Vital, Filipe & Ioannou, Petros, 2022. "Optimizing Fuel Consumption and Pollutant Emissions in Truck Routing with Parking Availability Prediction and Working Hours Constraints," Institute of Transportation Studies, Working Paper Series qt8rw99523, Institute of Transportation Studies, UC Davis.
    8. Mor, Andrea & Archetti, Claudia & Jabali, Ola & Simonetto, Alberto & Speranza, M. Grazia, 2022. "The Bi-objective Long-haul Transportation Problem on a Road Network," Omega, Elsevier, vol. 106(C).
    9. Alberto Ceselli & Ángel Felipe & M. Teresa Ortuño & Giovanni Righini & Gregorio Tirado, 2021. "A Branch-and-Cut-and-Price Algorithm for the Electric Vehicle Routing Problem with Multiple Technologies," SN Operations Research Forum, Springer, vol. 2(1), pages 1-33, March.
    10. Maximilian Schiffer & Michael Schneider & Grit Walther & Gilbert Laporte, 2019. "Vehicle Routing and Location Routing with Intermediate Stops: A Review," Transportation Science, INFORMS, vol. 53(2), pages 319-343, March.
    11. Vital, Filipe & Ioannou, Petros, 2021. "Scheduling and shortest path for trucks with working hours and parking availability constraints," Transportation Research Part B: Methodological, Elsevier, vol. 148(C), pages 1-37.

    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:taf:tjorxx:v:69:y:2018:i:2:p:235-246. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/tjor .

    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.