Abstract In this article, we study robust transshipment under consistent flow constraints. We consider demand uncertainty represented by a finite set of scenarios and characterize subset arcs as so‐called fixed arcs. each scenario, require an integral that satisfies the respective balance addition, on arc, equal for all scenarios. The objective is to minimize maximum cost occurring among show p...

Due to occurrence of unexpected disruptions,a resilient supply chain design is important. In this paper, a bi-objective model is proposed for designing a resilient supply chain including suppliers, distribution centers (DCs), and retailers under disruption risks.The first objective function minimizes total costs. The second objective function maximizes satisfied demands. We use the augmented e-...

In pickup and delivery problems vehicles have to transport loads from origins to destinations without transshipment at intermediate locations In this paper we discuss several characteristics that distinguish them from standard vehicle routing problems and present a survey of the problem types and solution methods found in

In pickup and delivery problems vehicles have to transport loads from origins to destinations without transshipment at intermediate locations. In this paper, we describe an algorithm to solve such problems. The algorithm is based on a set partitioning formulation of the problem and uses new column generation and branching schemes.

This thesis discusses optimization problems and equilibrium in networks. There are three major parts of the thesis. In the first part, we discuss optimization in dynamic networks. We focus on two fundamental optimization problems in dynamic networks: the quickest flow problem and the quickest transshipment problem. The quickest flow problem is to find a minimum time needed to send a given amoun...