Skip to main content
Log in

Transportation problem with nonlinear side constraints a branch and bound approach

  • Published:
Zeitschrift für Operations Research Aims and scope Submit manuscript

Abstract

In a container terminal management, we are often confronted with the following problem: how to assign a reasonable depositing position for an arriving container, so that the efficiency of searching for and loading of a container later can be increased. In this paper, the problem is modeled as a transportation problem with nonlinear side constraints (TPNSC). The reason of nonlinear side constraints arising is that some kinds of containers cannot be stacked in the same row (the space of storage yard is properly divided into several rows). A branch and bound algorithm is designed to solve this problem. The algorithm is based on the idea of using disjunctive arcs (branches) for resolving conflicts that are created whenever some conflicting kinds of containers are deposited in the same row. During the branch and bound, the candidate problems are transformed into classical transportation problems, so that the efficient transportation algorithm can be applied, at the same time the reoptimization technique is employed during the branch and bound. Further, we design a heuristic to obtain a feasible initial solution for TPNSC in order to prune some candidates as early and/or as much as possible. We report computational results on randomly generated problems.

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

Access this article

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Ali AI, Allen EP, Barr RS, Kennington JL (1986) Reoptimization procedure for bounded variable primal simplex network algorithm. Eur J Oper Res 23:256–263

    Google Scholar 

  2. Christofides N, Alvarez-Valdes R, Thamrit JM (1987) Project scheduling with resource constraints: A branch and bound approach. Eur J Oper Res 29:262–273

    Google Scholar 

  3. Ford LR, Fulkerson DR (1962) Flows on Networks. Princeton University Press, Princeton, N.J.

    Google Scholar 

  4. Glover F, Karney D, Klingman D, Russel R (1978) Solving singly constrained transshipment problems. Transp Sci 12:277–297

    Google Scholar 

  5. Klingman D, Phillips NV (1988) Equitable demand adjustment for infeasible transportation problems. J Operat Res Soc 39:737–742

    Google Scholar 

  6. Klingman D, Russel R (1975) Solving constrained transportation problems. Operat Res 23:91–106

    Google Scholar 

  7. Murty K (1976) Linear and Combinatorial Programming. Wiley

  8. Thompson GL, Sethi AP (1986) Solution of constrained generalized transportation problems using the pivot and probe algorithm. Computer and Operat Res 13:1–9

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Cao, B. Transportation problem with nonlinear side constraints a branch and bound approach. ZOR - Methods and Models of Operations Research 36, 185–197 (1992). https://doi.org/10.1007/BF01417216

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01417216

Key words

Navigation