IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v197y2009i2p741-751.html
   My bibliography  Save this article

Transportation planning in freight forwarding companies: Tabu search algorithm for the integrated operational transportation planning problem

Author

Listed:
  • Krajewska, Marta Anna
  • Kopfer, Herbert

Abstract

The integrated operational transportation planning problem extends the traditional vehicle routing and scheduling problem by the possibility of outsourcing a part of the requests by involving subcontractors. The purpose of this paper is to present the integrated planning problem and to propose an approach for solving it by a tabu search heuristic. Existing approaches from literature which discuss vehicle routing combined with outsourcing regard only one specific type of subcontracting. This paper describes and explores the complex situation where an own fleet and several types of subcontracting are used for request fulfillment. As the approach contains new aspects, unknown to the literature so far, tabu search is extended to special types of moves. On the basis of computational results the cost structure is analyzed in order to investigate the long-term planning question whether and to what extend it is profitable to maintain an own fleet.

Suggested Citation

  • Krajewska, Marta Anna & Kopfer, Herbert, 2009. "Transportation planning in freight forwarding companies: Tabu search algorithm for the integrated operational transportation planning problem," European Journal of Operational Research, Elsevier, vol. 197(2), pages 741-751, September.
    • Handle: RePEc:eee:ejores:v:197:y:2009:i:2:p:741-751
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(08)00508-0
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. Nanry, William P. & Wesley Barnes, J., 2000. "Solving the pickup and delivery problem with time windows using reactive tabu search," Transportation Research Part B: Methodological, Elsevier, vol. 34(2), pages 107-121, February.
    2. Olli Bräysy & Michel Gendreau, 2005. "Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms," Transportation Science, INFORMS, vol. 39(1), pages 104-118, February.
    3. Martin Savelsbergh & Marc Sol, 1998. "Drive: Dynamic Routing of Independent Vehicles," Operations Research, INFORMS, vol. 46(4), pages 474-490, August.
    4. Olli Bräysy & Michel Gendreau, 2005. "Vehicle Routing Problem with Time Windows, Part II: Metaheuristics," Transportation Science, INFORMS, vol. 39(1), pages 119-139, February.
    5. M-C Bolduc & J Renaud & F Boctor & G Laporte, 2008. "A perturbation metaheuristic for the vehicle routing problem with private fleet and common carriers," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(6), pages 776-787, June.
    6. Brandao, Jose, 2006. "A new tabu search algorithm for the vehicle routing problem with backhauls," European Journal of Operational Research, Elsevier, vol. 173(2), pages 540-555, September.
    7. Chu, Ching-Wu, 2005. "A heuristic algorithm for the truckload and less-than-truckload problem," European Journal of Operational Research, Elsevier, vol. 165(3), pages 657-667, September.
    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. Ziebuhr, Mario & Kopfer, Herbert, 2016. "Solving an integrated operational transportation planning problem with forwarding limitations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 87(C), pages 149-166.
    2. Li, Yuan & Chen, Haoxun & Prins, Christian, 2016. "Adaptive large neighborhood search for the pickup and delivery problem with time windows, profits, and reserved requests," European Journal of Operational Research, Elsevier, vol. 252(1), pages 27-38.
    3. Yiting Xing & Ling Li & Zhuming Bi & Marzena Wilamowska‐Korsak & Li Zhang, 2013. "Operations Research (OR) in Service Industries: A Comprehensive Review," Systems Research and Behavioral Science, Wiley Blackwell, vol. 30(3), pages 300-353, May.
    4. Meuffels, W.J.M. & Fleuren, H.A. & Cruijssen, F. & van Dam, E.R., 2009. "Enriching the Tactical Network Design of Express Service Carriers with Fleet Scheduling Characteristics," Other publications TiSEM e146d914-9638-4ae0-9587-b, Tilburg University, School of Economics and Management.
    5. Stenger, Andreas & Schneider, Michael & Schwind, Michael & Vigo, Daniele, 2012. "Location routing for small package shippers with subcontracting options," International Journal of Production Economics, Elsevier, vol. 140(2), pages 702-712.
    6. Archetti, Claudia & Peirano, Lorenzo, 2020. "Air intermodal freight transportation: The freight forwarder service problem," Omega, Elsevier, vol. 94(C).
    7. Wang, Xin & Kopfer, Herbert & Gendreau, Michel, 2014. "Operational transportation planning of freight forwarding companies in horizontal coalitions," European Journal of Operational Research, Elsevier, vol. 237(3), pages 1133-1141.
    8. Meuffels, W.J.M., 2015. "The design of road and air networks for express service providers," Other publications TiSEM d3266cb8-bc55-41be-adc7-4, Tilburg University, School of Economics and Management.
    9. Liu, Jia-Cai & Sheu, Jiuh-Biing & Li, Deng-Feng & Dai, Yong-Wu, 2021. "Collaborative profit allocation schemes for logistics enterprise coalitions with incomplete information," Omega, Elsevier, vol. 101(C).
    10. Saeed, Naima, 2013. "Cooperation among freight forwarders: Mode choice and intermodal freight transport," Research in Transportation Economics, Elsevier, vol. 42(1), pages 77-86.
    11. Gahm, Christian & Brabänder, Christian & Tuma, Axel, 2017. "Vehicle routing with private fleet, multiple common carriers offering volume discounts, and rental options," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 97(C), pages 192-216.
    12. S. Acharyya & A. K. Datta, 2020. "Matching formulation of the Staff Transfer Problem: meta-heuristic approaches," OPSEARCH, Springer;Operational Research Society of India, vol. 57(3), pages 629-668, September.
    13. Margaretha Gansterer & Richard F. Hartl, 2016. "Request evaluation strategies for carriers in auction-based collaborations," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 38(1), pages 3-23, January.

    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. Zhenzhen Zhang & Zhixing Luo & Hu Qin & Andrew Lim, 2019. "Exact Algorithms for the Vehicle Routing Problem with Time Windows and Combinatorial Auction," Transportation Science, INFORMS, vol. 53(2), pages 427-441, March.
    2. Liu, Ran & Jiang, Zhibin, 2012. "The close–open mixed vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 220(2), pages 349-360.
    3. Baals, Julian & Emde, Simon & Turkensteen, Marcel, 2023. "Minimizing earliness-tardiness costs in supplier networks—A just-in-time truck routing problem," European Journal of Operational Research, Elsevier, vol. 306(2), pages 707-741.
    4. Taş, D. & Gendreau, M. & Dellaert, N. & van Woensel, T. & de Kok, A.G., 2014. "Vehicle routing with soft time windows and stochastic travel times: A column generation and branch-and-price solution approach," European Journal of Operational Research, Elsevier, vol. 236(3), pages 789-799.
    5. Fröhlich von Elmbach, Alexander & Scholl, Armin & Walter, Rico, 2019. "Minimizing the maximal ergonomic burden in intra-hospital patient transportation," European Journal of Operational Research, Elsevier, vol. 276(3), pages 840-854.
    6. Liu, Ran & Xie, Xiaolan & Garaix, Thierry, 2014. "Hybridization of tabu search with feasible and infeasible local searches for periodic home health care logistics," Omega, Elsevier, vol. 47(C), pages 17-32.
    7. Eric Prescott-Gagnon & Guy Desaulniers & Michael Drexl & Louis-Martin Rousseau, 2010. "European Driver Rules in Vehicle Routing with Time Windows," Transportation Science, INFORMS, vol. 44(4), pages 455-473, November.
    8. Yu, Mingzhu & Qi, Xiangtong, 2014. "A vehicle routing problem with multiple overlapped batches," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 61(C), pages 40-55.
    9. Goel, Asvin & Gruhn, Volker, 2008. "A General Vehicle Routing Problem," European Journal of Operational Research, Elsevier, vol. 191(3), pages 650-660, December.
    10. Weiwei Chen & Jie Song & Leyuan Shi & Liang Pi & Peter Sun, 2013. "Data mining-based dispatching system for solving the local pickup and delivery problem," Annals of Operations Research, Springer, vol. 203(1), pages 351-370, March.
    11. Jean-Yves Potvin, 2009. "State-of-the Art Review ---Evolutionary Algorithms for Vehicle Routing," INFORMS Journal on Computing, INFORMS, vol. 21(4), pages 518-548, November.
    12. Asvin Goel, 2009. "Vehicle Scheduling and Routing with Drivers' Working Hours," Transportation Science, INFORMS, vol. 43(1), pages 17-26, February.
    13. Asbach, Lasse & Dorndorf, Ulrich & Pesch, Erwin, 2009. "Analysis, modeling and solution of the concrete delivery problem," European Journal of Operational Research, Elsevier, vol. 193(3), pages 820-835, March.
    14. Lu, Quan & Dessouky, Maged M., 2006. "A new insertion-based construction heuristic for solving the pickup and delivery problem with time windows," European Journal of Operational Research, Elsevier, vol. 175(2), pages 672-687, December.
    15. Schmid, Verena & Doerner, Karl F. & Laporte, Gilbert, 2013. "Rich routing problems arising in supply chain management," European Journal of Operational Research, Elsevier, vol. 224(3), pages 435-448.
    16. Gerhard Hiermann & Matthias Prandtstetter & Andrea Rendl & Jakob Puchinger & Günther Raidl, 2015. "Metaheuristics for solving a multimodal home-healthcare scheduling problem," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 23(1), pages 89-113, March.
    17. Chou, Chang-Chi & Chiang, Wen-Chu & Chen, Albert Y., 2022. "Emergency medical response in mass casualty incidents considering the traffic congestions in proximity on-site and hospital delays," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 158(C).
    18. 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.
    19. Qi, Mingyao & Lin, Wei-Hua & Li, Nan & Miao, Lixin, 2012. "A spatiotemporal partitioning approach for large-scale vehicle routing problems with time windows," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 48(1), pages 248-257.
    20. Xiang, Zhihai & Chu, Chengbin & Chen, Haoxun, 2006. "A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints," European Journal of Operational Research, Elsevier, vol. 174(2), pages 1117-1139, October.

    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:ejores:v:197:y:2009:i:2:p:741-751. 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/eor .

    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.