The capacitated vehicle routing problem with sequence-based pallet loading and axle weight constraints is an extension of the classical Capacitated Vehicle Routing Problem (CVRP). It integrates loading constraints in a routing problem and is based on a real-world transportation problem. The demand of the customers consists of pallets. These pallets may be placed in two horizontal rows inside th...

This paper is concerned with the design and probabilistic analysis of algorithms for the maximum-ow problem and capacitated transportation problems. These algorithms run in linear time and, under certain assumptions about the probability distribution of edge capacities, obtain an optimal solution with high probability. The design of our algorithms is based on the following general method, which...

A strongly polynomial time algorithm is described to solve the node-capacitated routing problem in an undirected ring network.

Multi-echelon distribution systems are quite common in supply-chain and logistic systems. They are used by public administrations in their transportation and traffic planning strategies as well as by companies to model their distribution systems. In the literature, most of the studies address issues related to the movement of flows throughout the system from their origins to their final destina...

We study 0-1 reformulations of the multicommodity capacitated network design problem, which is usually modeled with general integer variables to represent, design decisions on the number of facilities to install on each arc of the network. The reformulations are based on the multiple choice model, a generic approach to represent piecewise linear costs using 0-1 variables. This model is improved...

In modeling flows and controls in transportation, distribution, communication, manufacturing systems, etc., it is often convenient to represent the system as a store-and-forward network. In such networks it is common for time, space, attention, or other resources, to be shared between sets of neighbouring nodes. For example, neighbouring nodes may share storage space, machine time, operating ti...

Abstract: This paper presents an algorithm to find optimum cost time trade off pairs in a fractional capacitated transportation problem with bounds on total availabilities at sources and total destination requirements. The objective function is a ratio of two linear functions consisting of variable costs and profits respectively. Sometimes, situations arise where either reserve stocks have to b...