We consider a system in which multiple-items are transferred from a warehouse or a plant to a retailer through identical capacitated vehicles, or freight wagons. Any mixture of the items may be loaded on a vehicle. The retailer is facing dynamic deterministic demand for several items, over a finite planning horizon. A vehicle incurs a fixed cost for each trip made from the warehouse to the reta...

We give a model for the description of an urban transportation network and we consider the related optimization problem which consists in finding the desing of the network which has the best transportation performances. This will be done by introducing, for every admissible network, a suitable metric space with a distance that inserted into the Monge-Kantorovich cost functional provides the cri...

We introduce a combined facility location/network design problem in which facilities have constraining capacities on the amount of demand they can serve. This model has a number of applications in regional planning, distribution, telecommunications, energy management, and other areas. Our model includes the classical capacitated facility location problem (CFLP) on a network as a special case. W...

We study a capacity expansion problem that arises in telecommunication network design. Given a capacitated network and a traac demand matrix, the objective is to add capacity to the edges, in modularityes of various modularities, and route traac, so that the overall cost is minimized. We study the polyhedral structure of a mixed-integer formulation of the problem and develop a cutting-plane alg...

Current network modeling practices usually assess the network performance at specified time interval, i.e. every 5 or 10 years time horizon. Furthermore, they are usually based on partially predictable data, which are being generated through various stochastic procedures. In this research, a new quantitative based methodology which combines combinatorial optimization modeling and transportation...

in this study, we discuss the capacitated facility location-allocation problem with uncertain parameters in which the uncertainty is characterized by given finite numbers of scenarios. in this model, the objective function minimizes the total expected costs of transportation and opening facilities subject to the robustness constraint. to tackle the problem efficiently and effectively, an effici...

In a capacitated network design game, each of n players selects a path from her source to her sink. The cost of each edge is shared equally among the players using the edge. Every edge has a finite capacity that limits the number of players using the edge. We study the price of stability for such games with respect to the max-cost objective, i.e., the maximum cost paid by any player. We show th...

We study the polyhedra of splittable and unsplittable single arc–set relaxations of multicommodity flow capacitated network design problems. We investigate the optimization problems over these sets and the separation and lifting problems of valid inequalities for them. In particular, we give a linear–time separation algorithm for the residual capacity inequalities [19] and show that the separat...

the capacitated vehicle routing problem (cvrp) is a well-known combinatorial optimization problem that holds a central place in logistics management. the vehicle routing is an applied task in the industrial transportation for which an optimal solution will lead us to better services, save more time and ultimately increase in customer satisfaction. this problem is classified into np-hard problem...