Add to ORKGA branch and bound type algorithm is presented in this paper to the problem of finding a transportation schedule which minimises the total transportation cost, where the transportation cost over each route is assumed to be a piecewice linear continuous convex function with increasing slopes. The algorithm is an extension of the work done by Balachandran and Perry, in which the transportation cost over each route is assumed to beapiecewise linear discontinuous function with decreasing slopes. A numerical example is solved illustrating the algorithm
Organizations providing goods and services are mainly focusing on cost minimization within their org...
International audienceWe consider the problem of finding the cheapest routing for a set of commoditi...
This research work represents transportation modeling approaches and forecasting techniques addressi...
A branch and bound type algorithm is presented in this paper to the problem of finding a transportat...
In this paper we present an exact solution method for the transportation problem with piecewise line...
This presentation was given at the Production and Operations Management Annual Conference (POMS)
AbstractA bicriterion shortest path problem with a general nonadditive cost seeks to optimize a comb...
A branch-and-bound method is proposed for minimizing a convex-concave function over a convex set. Th...
© Published under licence by IOP Publishing Ltd.The article describes the algorithm for branch and b...
As a transportation problem we usually denote one of the classical problems of the linear programmin...
AbstractWe develop an algorithm to globally solve the problem: minimize {ƒ0(χ): ƒi(χ) ≤ bi, i = 1,…,...
28 pagesThe Pickup and Delivery Problem with Shuttle routes (PDPS) is a special case of the Pickup a...
Abstract. It is well-known that Linear Programming Problem (LPP) is one of the most potential mathem...
In this paper we implement a branch-price and cut algorithm for a time dependent vehicle routing pro...
AbstractA branch-and-cut algorithm for solving linear problems with continuous separable piecewise l...
Organizations providing goods and services are mainly focusing on cost minimization within their org...
International audienceWe consider the problem of finding the cheapest routing for a set of commoditi...
This research work represents transportation modeling approaches and forecasting techniques addressi...
A branch and bound type algorithm is presented in this paper to the problem of finding a transportat...
In this paper we present an exact solution method for the transportation problem with piecewise line...
This presentation was given at the Production and Operations Management Annual Conference (POMS)
AbstractA bicriterion shortest path problem with a general nonadditive cost seeks to optimize a comb...
A branch-and-bound method is proposed for minimizing a convex-concave function over a convex set. Th...
© Published under licence by IOP Publishing Ltd.The article describes the algorithm for branch and b...
As a transportation problem we usually denote one of the classical problems of the linear programmin...
AbstractWe develop an algorithm to globally solve the problem: minimize {ƒ0(χ): ƒi(χ) ≤ bi, i = 1,…,...
28 pagesThe Pickup and Delivery Problem with Shuttle routes (PDPS) is a special case of the Pickup a...
Abstract. It is well-known that Linear Programming Problem (LPP) is one of the most potential mathem...
In this paper we implement a branch-price and cut algorithm for a time dependent vehicle routing pro...
AbstractA branch-and-cut algorithm for solving linear problems with continuous separable piecewise l...
Organizations providing goods and services are mainly focusing on cost minimization within their org...
International audienceWe consider the problem of finding the cheapest routing for a set of commoditi...
This research work represents transportation modeling approaches and forecasting techniques addressi...