English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

In transportation problem, for transporting a product from supply origins to demand destinations, a company declared the tender, once a company gain total transportation cost. Numbers of Transportation Company are interested in this tender. Out of them, some companies are not able to fulfill the requirements of the tender so such companies are combining to gather and jointly apply in tendering to get the assignment. All the companies which are jointly applying, having different power. So it is necessary for all companies to decide some strategies according to their cost, profit and units of supply before applying in such tendering procedure so that all companies will get maximum benefit. In this paper, we developed the model and solve such type of transportation problems with proper illustration by using LINGO package and Nash Bargaining model based approach when more than two companies are jointly applied in the tendering process and from that we find non integer and integer solutions respectively.

n-Parties Contract Based Transportation Problem and Its Solution