Vehicle routing problem for freight forwarding

Main Article Content

Shunichi Ohmori
Kazuho Yoshimoto
Satoshi Kuriyama
Sirawadee Arunyanart

Abstract

This paper reveals a current business situation where several types of subcontracting transportation are used for
delivery services in forwarding companies. Each subcontracting option contains different cost structure and
constraint set that make more complex in transportation planning. This problem comprises new aspects which
extend the traditional vehicle routing problem (VRP). A simulated annealing (SA) technique is proposed for
simultaneously solving the combination of optimization problems in vehicle routing and scheduling.

Article Details

How to Cite
Ohmori, S., Yoshimoto, K., Kuriyama, S., & Arunyanart, S. (2016). Vehicle routing problem for freight forwarding. Asia-Pacific Journal of Science and Technology, 22(2), APST–22. https://doi.org/10.14456/apst.2017.28
Section
Research Articles

References

[1] Japan Institute of Logistics System, 2013. Logistics Cost Report 2013. Japan Institute of Logistics System.
[2] Toth, P., Vigo, D., 2002. An Overview of Vehicle Routing Problems. SIAM Monographs on Discrete Mathematics and Applications, 1-26.
[3] Krajewska, M., Kopfer, H., 2009. Transportation Planning in Freight Forwarding Companies Tabu Search Algorithm for the Integrated Operational Transportation Planning Problem. European Journal of Operational Research 197, 741-751.
[4] Klibi, W., Lasalle, F., Martel, A., Soumia, I., 2010. The Stochastic Multiperiod Location Transportation Problem. Trans-science 44, 221-237.