Skip to main content
SpringerLink
Log in

The oil tankers dispatching problem

  • Application Article
  • Published:
OPSEARCH Aims and scope Submit manuscript

Abstract

The paper aims at obtaining an optimal route of a fleet of oil-delivery tankers from a source to a number of service stations. The distance between any two stations and demand(s) for each station are given. The objective is to find an optimal route undertaken by tankers such that the requirements of stations are met, the total distance travelled by the Tankers and the backload of the Tankers is to be minimized under the considerations. Also, the Tanker should visit a pair of stations exactly once. Further, a tanker does not supply the requirements of the stations partially. Here the tanker carries back the residue to the depot the available amount of oil will be considered as Backload or undelivered oil when the Tanker returns to depot (source station) or the maximum utilization of the capacity of Tankers in a trip schedule. Dantzig and Ramser—[4] investigated the problem of “The Truck Dispatching Problem” without the minimum backload and obtained a near optimal solution with the dynamic programming approach. For obtaining the optimal solution of the same problem with minimum backload, we proposed the Lexicographic Search approach. The algorithm is tested using C-language and the computational details are also reported, observed that it takes less computational time for higher size of problems.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others

References

  1. Achuthan, N.R., Caccetta, L., Hill, S.P.: Capacited vehicle routing problem: Some new cutting planes. APORS 20(1), (1998)

  2. Bellman, R.: On a routing problem. Q. Appl. Math. XVI(1), 87–90 (1958)

    Google Scholar 

  3. Clarke, G., Wright, J.W.: Scheduling of vehicles from a central depot to a number of delivery points. Opns. Res. 12, 568–581 (1964)

    Article  Google Scholar 

  4. Dantzig, G.B., Ramser, J.H.: The truck dispatching problem. Manag. Sci. 6, 80–91 (1959)

    Article  Google Scholar 

  5. Das, S.: The most economical route for a TSP. Paper presented in XI Annual Convention of ORSI, (1978)

  6. Gehring, H., Homberger, J.: A parallel two-phase Metaheuristic for routing problems with time windows. APORS, 18(1), (2001)

  7. Golden, B.L., Wong, R.T.: Capacitated arc routing problems. Networks 11(3), 305–315 (1981)

    Article  Google Scholar 

  8. Laporte, G., Nobert Y., Desrochers M.: Optimal routing under capacity and distance restrictions. Opns. Res, 5, (1985)

  9. Laporte, G., Desrochers, M., Nobert, Y.: Two exact algorithms for the distance constrained vehicle routing problem. Networks 14, 161–172 (1994)

    Article  Google Scholar 

  10. Laporte, G. et.al.: The multi-depot m-Salesman problem, In methods of operations Res. Oelgeschlager, Gunn &Hain, Cambridge, MA, 367–370, 1981.

  11. Laporte, G., Nobert, Y.: A branch & bound algorithm for the capacited vehicle routing problems, OR Spektrum, 65–77, 1983.

  12. Laporte, G., et al.: An exact algorithm for the asymmetrical capacited vehicle routing problem. Networks 16, 33–46 (1986)

    Article  Google Scholar 

  13. Li, C.-L., Simchi-Levi, D., Desrochers, M.: On a distance constrained vehicle routing problem. Opns. Res. 40(4–6), 790–799 (1992)

    Article  Google Scholar 

  14. Malapert, A. et. al.: Two dimensional pickup and delivery routing problem with loading constraints, 2008. Internet.

  15. Martello, S., Toth, P.: An exact algorithm for large unbounded knapsack problems. Oper. Res. Lett. 9, 15–20 (1990)

    Article  Google Scholar 

  16. Martello, S., Toth, P.: Knapsack problems: Algorithms and computer implementation, John Wiley and Sons, 1990. Internet.

  17. Montane, F.A.T., Galvao, R.D.: Vehicle routing problems with simultaneous pick-up and delivery service. OPSEARCH 39(1), 19–33 (2002)

    Google Scholar 

  18. Ong, H.L., Ang, B.W., Goh, T.N., Deng, C.C.: A vehicle routing and scheduling problem with time windows and stochastic demand constraints. APORS 14(1) (1997)

  19. Pandit, S.N.N.: Some observations on a routing problem. Opns. Res. 10, 726–727 (1962)

    Article  Google Scholar 

  20. Pandit, S.N.N.: The loading problem. Opns. Res. 10, 639–646 (1962)

    Article  Google Scholar 

  21. Pandit, S. N. N.: Some quantitative combinatorial search problem. Ph. D. Thesis, IIT, Kharagpur, (1963)

  22. Ramesh, T.: Travelling purchaser problem. OPSEARCH 18(2), 78–91 (1981)

    Google Scholar 

  23. Raviganesh, G.R., Kumar, S., Das, S.: Solution of a travelling salesmen problem is a protean network. Published in Mathematical Programming of the Journal of Management and System (IJOMOS) 14(1), 99–110 (1998)

    Google Scholar 

  24. Saksena, J.P., Kumar, S.: The routing problem with k-specified nodes. Opns. Res. 14(5), 909–913 (1966)

    Article  Google Scholar 

  25. Sexton, T., Bodin, L.: Optimizing single vehicle many-to-many operations with desired delivery times: I scheduling. Transp. Sci. 19, 378–410 (1985)

    Article  Google Scholar 

  26. Sexton, T., Bodin, L.: Optimizing single vehicle many-to-many operations with desired delivery times: II routing. Transp. Sci. 19, 411–435 (1985)

    Article  Google Scholar 

  27. Tan, K.C., Lee, L. H., Ou, K.: Hybrid genetic algorithm in solving vehicle routing problems with time window constraints. APORS 18(1) (2001)

  28. Teng, S., Ong, H.L., Huang, H. C.: A Comparative study of metaheuristics for vehicle routing problem with stochastic demands. APORS, 20(1) (2003)

  29. Urquhart, M.E., Viera, O.: A vehicle routing system supporting milk collection. OPSEARCH 39(1), 46–54 (2002)

    Google Scholar 

Download references

Acknowledgments

We express our thanks to the referees for their fruitful observations and suggestions on the earlier draft of the paper.

Author information

Authors and Affiliations

  1. Department of Statistics, D.H.S.K. College, Dibrugarh, 786001, Assam, India

    Nazimuddin Ahmed

  2. Dibrugarh University, Dibrugarh, 786004, Assam, India

    S. Das

  3. Department of Mathematics, S.V.J. College, T.T.D., Tirupati, Andhra Pradesh, India

    S. Purusotham

Authors
  1. Nazimuddin Ahmed
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. Das
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. S. Purusotham
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Nazimuddin Ahmed.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ahmed, N., Das, S. & Purusotham, S. The oil tankers dispatching problem. OPSEARCH 49, 366–385 (2012). https://doi.org/10.1007/s12597-012-0085-2

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12597-012-0085-2

Keywords

Search

Navigation